I'd be happy if someone explained the solutions of E and J.
http://acm.math.spbu.ru:17249/~ejudge/files/opencup/oc12/gp6/gpce-e.pdf
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 151 |
9 | maroonrk | 151 |
I'd be happy if someone explained the solutions of E and J.
http://acm.math.spbu.ru:17249/~ejudge/files/opencup/oc12/gp6/gpce-e.pdf
Name |
---|
Problem E.
Let
calc(i, j)
be the maximum coverage length of a special symboli
in the patternP
starting fromP[j]
. Then for each equation of the form A = B + C,calc(A, j) = calc(B, j) + calc(C, j + calc(B, j))
, and for equation A = a word over * {a, ..., z} we count it the simple way.To speed up, use a hash table (unordered_map) to memorize
calc(i, j)
values.The solution is then
calc(S, 0) == strlen(P)
.