|
|
3 5 1 4 5 7 3 8 2 4 4 7 5 3 7 7 0 3 5 2 5 1 5 3 4 3 8 8 8 6 0 6 6 1 I got tle on these tests.But I got AC. My AC solution outputs "NO" on both of those test cases. Answer to second test is YES. And, moreover, there are 840 ways to fill the square. Upd. Sorry, forgot about constraint a[0][0]=0. (But, if ignore it, 840 is correct number.) Edited by author 09.07.2026 19:19 Dear admin: Please add this test: 3 2 4 6 2 1 7 8 I got tle on this test.But fortunately I got AC! My AC solution outputs "YES" on that test case. My two AC submissions give different answers on this test: 3 4 0 0 0 0 6 1 5 5 2 8 5 3 P.S. The first test case isn't the sample. Edited by author 19.11.2013 01:26 My AC solution outputs "NO" on that test case. Edited by author 01.08.2016 10:52 Please give me some tests. Edited by author 11.05.2009 01:20 Made some changes and got WA11. Edited by author 11.05.2009 02:12 Can you show me any possible solution sample input #2? 0 1 2 3 2 3 0 1 1 0 3 2 3 2 1 0 Incorrect test 55 was fixed. 5 authors got AC now. We apologize for jury error to all authors, especially to LouTianCheng and Team of Jyonh, who submitted correct solution during online contest. Is this test correct? I think that my program is right. Dear author, are you sure that answer ("NO") for the 1st example of input/output ( 2 4 0 0 0 1 2 1 2 1 2 3 3 3 ) really correct? Is it true that filling square as 0 1 3 2 2 3 1 0 3 2 0 1 1 0 2 3 is NOT correct magic square according to task rules? You may swap top-left and top-right squares to get non-magic square 3 2 0 1 1 0 2 3 3 2 0 1 1 0 2 3 But if we fill square this way... 0 5 8 4 6 7 2 9 9 1 7 6 4 8 5 3 numbers are between 0 and n^2-1, so your example is incorrect! But if we fill square this way... 0 5 8 4 6 7 2 9 9 1 7 6 4 8 5 3 |
|
|