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 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
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 |
---|