Please help me get an idea for this HackerEarth question.
In the editorial, they mentioned 12 as a threshold value but how did they approach it?
# | User | Rating |
---|---|---|
1 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 161 |
3 | Um_nik | 161 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
Please help me get an idea for this HackerEarth question.
In the editorial, they mentioned 12 as a threshold value but how did they approach it?
I hope everyone's doing well.
This post is targeted to the users who have SOLVED this problem.
Solution 1 : https://ideone.com/8oEVbg
Solution 2 : https://ideone.com/lekcZ4
Point to Note : The only difference in the two codes is in the way Binary Search is implemented.
Both the above solutions got accepted but give different output for the following test case.
1
2 2
1
3
Solution 1 would give 2 as the answer (which is correct) while Solution 2 prints 1 as the answer.
So is this test case, valid? If yes, then how Solution 2 is getting accepted?
Name |
---|