kawatea's solution http://codeforces.me/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 | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
kawatea's solution http://codeforces.me/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 .