problem.html (406B)
1 <p> 2 3 Time limit per test: 2 seconds 4 Memory limit per test: 256 megabytes 5 6 Given strings a,b,c,d find the number of substrings of a,b, and c that match d, output the sum. 7 8 </p> 9 10 <h2>Constraints</h2> 11 12 <p> 13 14 <ul> 15 <li> 1 <= len(a) <= 4 * 10^5 </li> 16 <li> 1 <= len(b) <= 4 * 10^5 </li> 17 <li> 1 <= len(c) <= 4 * 10^5 </li> 18 <li> 1 <= len(d) <= 4 * 10^5 </li> 19 <li> there are at most 10^2 matches </li> 20 </ul> 21 22 <p>