kawatea's solution http://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 | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
kawatea's solution http://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
times. To view it k times, we should ask about layer
.
w[z][i]
will be viewed at mostz
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