kawatea's solution http://mirror.codeforces.com/contest/246/submission/2621642 i think it's brute force because this solution uesd a "for" loop to find distinct names of k sons
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | maroonrk | 152 |
4 | nor | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 145 |
8 | Petr | 145 |
10 | pajenegod | 144 |
kawatea's solution http://mirror.codeforces.com/contest/246/submission/2621642 i think it's brute force because this solution uesd a "for" loop to find distinct names of k sons
Name |
---|
It caches every query. It seems that there could not be many distinct large queries.
for (i = p; i < q; i++) { if (f[w[z][i].second] == 0) { sum++; f[w[z][i].second] = 1; } }
In the worst case this part works (summary) in .
Sample:
K+M -> K+M-1 -> K+M-2 -> .... K
K -> 1,2,3, ..., K-1
K+1 -> some chain of length 1
K+2 -> some chain of length 2
...
K+M -> some chain of length M
Prove:
Each
w[z][i]
will be viewed at most times. To view it k times, we should ask about layerz
from k different ancestors ofw[z][i]
. How to get k different pairs <p,q>? For each of these k ancestors we have to add a chain from it to layerz
. Lengths of these chains will be at least 1,2, ... k. Sum is at most n. So k is at most .