| ENG RUS | Timus Online Judge |
Discussion of Problem 1526. Martian PlatesYermak First test doesn't fit the statement limitations! (+) [6] // Problem 1526. Martian Plates 11 Aug 2012 20:38 #include <stdio.h> int p,t,n,m; int main() { scanf("%d%d%d%d",&p,&t,&n,&m); if (p<2 || p>10000 || t<2 || t>200 || (t&1) || n<1 || n>10 || m<1 || m>100) return 1/(p-p); return 0; } This program gets "Crash (integer division by zero)" at test #1. http://acm.timus.ru/status.aspx?space=1&num=1526 Sandro (USU) Re: First test doesn't fit the statement limitations! (+) [5] // Problem 1526. Martian Plates 12 Aug 2012 13:08 You are right, m = 0 in the 1st test. This limitation in the problem statement is fixed now. Andrew Sboev [USU] Re: First test doesn't fit the statement limitations! (+) [4] // Problem 1526. Martian Plates 12 Aug 2012 16:06 But there is a division by zero in his code! Sandro, why did you delete my post? Sandro (USU) Re: First test doesn't fit the statement limitations! (+) [3] // Problem 1526. Martian Plates 13 Aug 2012 01:34 Because the solution of Yermak is a input validator. If the system verdict on some test is Crash (division by zero), then this test is incorrect. If the test is correct, system verdict should be Wrong Answer. Andrew Sboev [USU] Re: First test doesn't fit the statement limitations! (+) [2] // Problem 1526. Martian Plates 13 Aug 2012 11:54 Sandro, look at this line of his code! There is a division by zero if condition is true, because p-p = 0! if (p<2 || p>10000 || t<2 || t>200 || (t&1) || n<1 || n>10 || m<1 || m>100) return 1/(p-p); Edited by author 13.08.2012 11:55 Noob Re: First test doesn't fit the statement limitations! (+) [1] // Problem 1526. Martian Plates 13 Aug 2012 22:43 Captain Obvious to the rescue! Andrew Sboev [USU] Re: First test doesn't fit the statement limitations! (+) // Problem 1526. Martian Plates 14 Aug 2012 00:03 Noob, oh, i understand. Edited by author 14.08.2012 00:04 Yermak When waiter takes plates away does he take all plates away? [1] // Problem 1526. Martian Plates 11 Aug 2012 02:27 Or is this possible: bring 1, bring 2, take 2 away, bring 3, take 3 away, take 1 away? Or what is the answer for 9999 6 1 0 ? 4 or 5? Yermak Re: When waiter takes plates away does he take all plates away? // Problem 1526. Martian Plates 11 Aug 2012 02:41 After careful analysis of second sample I concluded that waiter could take away any number of plates. Radi Muhammad Reza what might be test case 3: wa again and again // Problem 1526. Martian Plates 24 Jul 2012 05:57 i did just dp. [bitmask][no of iter until roll back][height left] somebody help please. thanks in advance Spatarel Dan Constantin i and j can be eqal // Problem 1526. Martian Plates 16 Apr 2012 18:40 i and j can be eqal! This made my get a WA#6. Here are some interesting tests: Input: 1000 4 2 1 1 1 Output: 7 Input: 1000 4 1 1 1 1 Output: 1 Igor E. Tuphanov Question about worktime [3] // Problem 1526. Martian Plates 24 Feb 2007 14:25 How do you think, is 1000*100*100*10 - solution quite normal? Or is there a faster solution? I've got AC with time above, but it take me some time to fit TL. Kit Re: Question about worktime // Problem 1526. Martian Plates 24 Feb 2007 18:01 My solution has same complexity, but it works fairly fast. svr Re: Question about worktime [1] // Problem 1526. Martian Plates 26 Aug 2007 10:37 It's interesting to recognize professional secrets. I think,that here 1000=1024=2^10 and means DP on subsets of admissible plates. First 100- is number of ways to remove first stage of fiesta:when first stack of plates go up and disappeare after. Second 100- Dp when calculating number of ways to build the fist stack of plates as a function of it's height<=100. And final 10- innerst loop op Dp then one of 10 plates may be pushed to head of stack(stack here not programming but fiesta's term) Edited by author 26.08.2007 10:38 Edited by author 26.08.2007 10:38 Denis Koshman Re: Question about worktime // Problem 1526. Martian Plates 6 Aug 2008 02:43 Actually it's not quite 1000*10 if optimized properly. Either 1000 decreases by considering only dishes within uncommon pairs or 10 decreases according to number of dishes affectable by current value of 2^10 loop. It even can become 2000 or smth like that. Edited by author 06.08.2008 02:43 Yermak (1<=i<=n and 1<=j<=n)? [1] // Problem 1526. Martian Plates 18 Feb 2007 15:53 (1<=i<=n and 1<=j<=n)? Denis Koshman Re: (1<=i<=n and 1<=j<=n)? // Problem 1526. Martian Plates 6 Aug 2008 02:36 I guess it is frost sorry... // Problem 1526. Martian Plates 18 Feb 2007 16:33 sorry..... Edited by author 15.03.2007 12:35
|