how do we know in problem 317B - Муравьи an array of a[147][147] will suffice?? thanks in advance
→ Pay attention
Before contest
Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round)
01:42:07
Register now »
Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round)
01:42:07
Register now »
*has extra registration
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | -is-this-fft- | 162 |
| 3 | maomao90 | 159 |
| 3 | atcoder_official | 159 |
| 5 | cry | 158 |
| 5 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/06/2024 07:22:53 (k2).
Desktop version, switch to mobile version.
Supported by
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.