problem.txt (466B)
1 Time: 2 seconds 2 Memory: 256 megabytes 3 4 Given strings a,b,c,d find the number of substrings of a,b, and c that match d, output the sum. 5 6 Constraints: 7 8 - 1 <= len(a) <= 4 * 10^5 9 - 1 <= len(b) <= 4 * 10^5 10 - 1 <= len(c) <= 4 * 10^5 11 - 1 <= len(d) <= 4 * 10^5 12 - there are at most 10^2 matches 13 14 --- 15 16 I'm uncertain about this problem because it seems like floating point precision is enough, but that's both non-obvoius, and I lack the current time / skills to prove that.