Contradiction constraints in problem 580D div 2

Revision en4, by Futymy, 2017-12-18 08:49:40

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?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English Futymy 2017-12-18 08:58:45 3
en4 English Futymy 2017-12-18 08:49:40 2 Tiny change: 't case: \n7 4 3\n2' -> 't case: \n\n7 4 3\n2'
en3 English Futymy 2017-12-18 08:48:34 4 Reverted to en1
en2 English Futymy 2017-12-18 08:47:50 4
en1 English Futymy 2017-12-18 08:46:49 382 Initial revision (published)