Can someone explain why the condition in Question C the condition is Root(n) in the tutorials? link to problem: https://codeforces.com/contest/1426/problem/C
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Can someone explain why the condition in Question C the condition is Root(n) in the tutorials? link to problem: https://codeforces.com/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).