problem.html (368B)
1 <p> 2 Time: 2 seconds 3 </p> 4 <p> 5 Memory: 256 megabytes 6 </p> 7 8 <p> 9 Given strings a,b,c,d find the number of substrings of a,b, and c that match d, output the sum. 10 </p> 11 12 <h2>Constraints</h2> 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>