Hi, The question is this ABC 260 — B. I can not find a flaw in my submission. The failing test cases are not available.
Please find the flaw. Thanking in advance.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
Hi, The question is this ABC 260 — B. I can not find a flaw in my submission. The failing test cases are not available.
Please find the flaw. Thanking in advance.
Name |
---|
The problem states that ties should be resolved by comparing the IDs of the students, you did not implement this.
Edit: But it looks like you tried to do this, by using restortOrig. Unfortunatly it does not work like this. To make it work you would have to use the function stable_sort instead of sort. Well, or you implement the three other comparators so that they handle the tie case correctly.
Thank you. This was the flaw, I used to think
sort()
was stable. I updated the comparators and it worked.you can use std::stable_sort