| # | 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 | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 151 |
Contradiction constraints in problem 580D div 2
Hi Codeforces,
In problem "Kefa and Dishes" (580D div 2), statements said that: "It is guaranteed that there are no such pairs of indexes i and j (1 ≤ i < j ≤ k), that xi = xj and yi = yj."
But in the 5th test case: 7 4 3 2 6 13 5 7 1 9 6 1 15 2 5 3 6 4 8
It's easy to see that x1 = x3. Was this test case invalid?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
Futymy | 2017-12-18 08:58:45 | 3 | ||
| en4 |
|
Futymy | 2017-12-18 08:49:40 | 2 | Tiny change: 't case: \n7 4 3\n2' -> 't case: \n\n7 4 3\n2' | |
| en3 |
|
Futymy | 2017-12-18 08:48:34 | 4 | Reverted to en1 | |
| en2 |
|
Futymy | 2017-12-18 08:47:50 | 4 | ||
| en1 |
|
Futymy | 2017-12-18 08:46:49 | 382 | Initial revision (published) |
