| ENG RUS | Timus Online Judge |
Discussion of Problem 1382. Game with Cardsmouse_wireless2 Statement is incomplete? // Problem 1382. Game with Cards 23 May 2019 17:45 Problem statement says "His friends write numbers from 1 to N on cards", but it doesn't mention that these numbers should be distinct. Yet, it seems like the problem only accepts solutions in which the numbers are distinct (i.e. the numbers on the N cards are a permutation of [1..N]). Vladimir Yakovlev (USU) Problem 1382 'Game with Cards' has been rejudged // Problem 1382. Game with Cards 3 Feb 2016 09:02 A dozen of new tests has been added. Time limit has been decreased to 500 ms. All submissions have been rejudged - 58 authors have lost their AC. NotImplemented 37 Test // Problem 1382. Game with Cards 3 May 2014 17:27 Can anybody provide me with 37 test? I have runtime error in Python. Roks some tests [8] // Problem 1382. Game with Cards 24 Jan 2009 20:23 4 2 4 3 2 4 4 2 1 1 2 3 4 // 2 1 2 2 4 3 2 1 2 1 1 4 4 4 2 3 1 // 1 1 2 2 2 2 2 2 1 1 1 // 1 1 3 1 2 1 2 3 2 3 1 3 // 1 1 1 Edited by author 24.01.2009 20:24 SkorKNURE Re: some tests [3] // Problem 1382. Game with Cards 24 Jan 2009 20:24 Hint: Try to build bipartite graph with 2*N edges. Then iteratively find vertice with only one connected edge. This edge will be "true" anyhow, so its pair from the guy's statement is "false". Also "false" are all edges, connected to both vertices of current one, and then you can mark their pairs as "true" ans so on... svr Re: some tests [1] // Problem 1382. Game with Cards 19 Jun 2009 10:37 What residue graph after this procedure. Can it have vertices with deg>2? Logically it must be union of separeted edges(matched vertices) and disjoint circles. But My Ac prog says that in 9 test residue graph has vertice with deg>2. Edited by author 20.06.2009 09:17 Al.Cash Re: some tests // Problem 1382. Game with Cards 19 Jun 2009 13:36 I'm not sure how do you build that "residue graph", but the answer is most likely to be "no")) I would not mind helping you, but don't want to post ideas in forum. Edited by author 19.06.2009 13:37 NotImplemented Re: some tests // Problem 1382. Game with Cards 18 Apr 2014 23:54 What if there is no such edge? taobingxue some other tests [2] // Problem 1382. Game with Cards 12 Sep 2009 19:57 5 5 4 5 5 1 5 4 1 5 4 4 3 4 1 5 5 2 5 4 4 5 1 3 4 3 3 5 5 1 5 5 I hope they can help~ o(∩_∩)o... IGOR_Lviv NU Re: some other tests [1] // Problem 1382. Game with Cards 19 Nov 2009 17:28 Both of these tests are incorrect. My AC program fails on them. hoan Re: some other tests // Problem 1382. Game with Cards 12 Dec 2010 17:32 input: 6 1 2 4 2 3 5 3 1 6 1 5 4 5 6 5 6 4 6 output: 1 1 1 2 2 2 hope can help you. GOOD LUCK!!! Marshall Mathers Re: some tests // Problem 1382. Game with Cards 24 May 2011 19:18 Thank U but they're weak Серовиков Андрей Weak tests // Problem 1382. Game with Cards 27 Apr 2013 13:27 I think tests for this problem are weak. For example, there is no tests like 1000 2 2 2 1 1 1 4 4 4 3 3 3 ... 1000 1000 1000 999 999 99 My program works slowly on this test (nearly 0.5sec) but it's fly like a wind on submission grayluck Help! Why WA 11? [2] // Problem 1382. Game with Cards 26 Sep 2011 11:59 my 2-sat get Wa 11..I dont know why....Can someone give me hints?Thanks! grayluck Re: Help! Why WA 11? [1] // Problem 1382. Game with Cards 26 Sep 2011 12:18 accepted.. It's my stupid fault...And the following test helped me: 3 2 3 3 3 1 1 1 3 2 my answer is : 1 1 1 Hope it may help. Edric Mao Re: Help! Why WA 11? // Problem 1382. Game with Cards 12 Nov 2011 19:37 Thanks a lot tob Help!How to slove this problem? [2] // Problem 1382. Game with Cards 18 Jul 2006 15:54 Can I just search,or there're some other better ways? Denis Koshman Re: Help!How to slove this problem? [1] // Problem 1382. Game with Cards 21 Aug 2008 15:51 Threre is O(N^2) way moshiur Re: Help!How to slove this problem? // Problem 1382. Game with Cards 18 Mar 2010 11:26 2SAT svr 1382 tests are not full [1] // Problem 1382. Game with Cards 12 Feb 2007 22:08 Potentialy very interesting but with too weak tests problem I got Ac very unexpected on halphway of solution. MY prog can't process test 4 1 2 1 2 1 2 3 4 3 4 3 4 with answer 1 1 1 1 This specific case most interesting case when there are K~100-250 unintersecting circles in given graph. We should build forest consist of such circles and process each tree from the root. Circles are bound throught whome each statement belong. All this situation is unreflected because weak tests. Edited by author 12.02.2007 22:08 Edited by author 12.02.2007 22:09 Edited by author 12.02.2007 22:09 Edited by author 12.02.2007 22:11 Denis Koshman Re: 1382 tests are not full // Problem 1382. Game with Cards 21 Aug 2008 14:07 There is an easier greedy solution. Edited by author 21.08.2008 16:04 Chmel_Tolstiy I have AC with wrong alg [-] // Problem 1382. Game with Cards 24 Jul 2008 19:57
|