Can someone explain why the condition in Question C the condition is Root(n) in the tutorials? link to problem: https://codeforces.net/contest/1426/problem/C
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Can someone explain why the condition in Question C the condition is Root(n) in the tutorials? link to problem: https://codeforces.net/contest/1426/problem/C
Name |
---|
After x operations of type-1 and y operations of type-2, the sum of resulting array will be (x + 1)*(y + 1).
We have to minimise (x + y), such that (x + 1)*(y + 1) >= n. Note that for any number N, two numbers A, B such that A*B = N, you will get minimum (A + B) for such A which is closest to square root of N. If you try to plot a graph, it will be a parabola with minima at square root of n, hence you can either use ternary search or check few values near sqrt(n).