I was trying to solve the problem : https://beta.atcoder.jp/contests/abc114/tasks/abc114_d The editorial is not in English and google translate didn't help much.
Can someone please suggest the idea which is used to solve the problem ?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
I was trying to solve the problem : https://beta.atcoder.jp/contests/abc114/tasks/abc114_d The editorial is not in English and google translate didn't help much.
Can someone please suggest the idea which is used to solve the problem ?
Hi, I am probably missing something too basic, however couldn't find the reason why my code is timing out for the test case 6. The problem is based on basic sorting (using library sort).
The Problem : https://mirror.codeforces.com/contest/977/problem/C The Timing Out submission : https://mirror.codeforces.com/contest/977/submission/46529037 The non-timing out submission : https://mirror.codeforces.com/contest/977/submission/46529009
The logic of the non-timing out submission (which is not mine and I just pasted out of curiosity if it would pass) and the one which times out is entirely the same. Also, I have used fast i/p, o/p for reading/writing o/p and it has been working fine for other submissions.
Thanks for your time !
Название |
---|