how do we know in problem 317B - Ants an array of a[147][147] will suffice?? thanks in advance
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
how do we know in problem 317B - Ants an array of a[147][147] will suffice?? thanks in advance
Name |
---|
It isn't; I find for n=30000 I need a 111x111 array. Except if you only consider the top-right quadrant or something (in which 56x56 suffices).
To figure it out? Probably emulating it for n=30000 is the fastest way, and also note that the bounding box won't get smaller wwith larger n so you're sure n=30000 is worst case.