| ENG RUS | Timus Online Judge |
Common BoardВиктор Крупко Who has TIME LIMIT (+) [7] // Problem 1292. Mars Space Stations 26 Apr 2005 23:21 1000=1^3+0^3+0^3+0^3=1 1=1^3=1 IF THE DISTANCE BETWEEN TWO POINTS = 1 THAT FOLLOWING TOO WILL BE 1. USE BREAK Homly Re: Who has TIME LIMIT (+) [1] // Problem 1292. Mars Space Stations 8 Jun 2005 08:32 It is wrong. "Oh, by the way! The value of SMK is always divisible by 3. It’s normal for Martians – all their numbers are divisible by 3." Виктор Крупко Re: Who has TIME LIMIT (+) // Problem 1292. Mars Space Stations 9 Jun 2005 00:56 On another if the previous number is equal to next that break vano_B1 Re: Who has TIME LIMIT (+) [1] // Problem 1292. Mars Space Stations 15 Jun 2005 15:16 f(153)=1^3+5^3+3^3=1+125+27=153 =)) AlexF Re: Who has TIME LIMIT (+) // Problem 1292. Mars Space Stations 25 Feb 2006 19:43 That's really so! :) Thank you! I've got AC! FrancaiS Why I've got TL? [2] // Problem 1292. Mars Space Stations 21 Jun 2007 01:35 Its my solution: [code deleted] Edited by author 21.06.2007 01:35 Edited by moderator 06.12.2019 20:30 IgorKoval(from Pskov) Re: Why I've got TL? [1] // Problem 1292. Mars Space Stations 2 Dec 2011 18:57 Your prog get AC, but look at this test: 1 33333 313 1 log of my prog: 2) 55 3) 250 4) 133 5) 55 6) 250 7) 133 8) 55 9) 250 10) 133 11) 55 12) 250 13) 133 14) 55 15) 250 16) 133 17) 55 18) 250 19) 133 20) 55 21) 250 22) 133 23) 55 24) 250 25) 133 26) 55 27) 250 ----- there is period! And you never get dist[j]==dist[j-1] And your prog get TLE on my test: ||| 33333 1) ||| 33333 313 1 2) ||| 33333 313 1 3) ||| 33333 313 1 4) ||| 33333 313 1 5) ||| 33333 313 1 i) ||| 33333 313 1 33333) ||| 33333 313 1 But there is no such tests => AC. =) [code deleted] Edited by author 02.12.2011 18:57 Edited by moderator 06.12.2019 20:31 adamant Re: Why I've got TL? // Problem 1292. Mars Space Stations 29 Apr 2014 13:50 313 isn't divisible by 3. evjava Why WA#10? [6] // Problem 1193. Queue at the Exam 19 Nov 2009 22:21 program Project2; {$APPTYPE CONSOLE} uses SysUtils; type tt = record t1, t2, t3: integer; end; var i, n, time, tek: integer; a: array[1..50] of tt; begin readln(n); for i := 1 to n do readln(a[i].t1, a[i].t2, a[i].t3); { sort(1, n);} //....a[1].t1<a[2].t1<.....<a[n].t1 time := 0; tek := 0; for i := 1 to n do begin if tek >= a[i].t1 then tek := tek + a[i].t2 else tek := a[i].t1 + a[i].t2; if tek > a[i].t3 then begin time :=time+ tek - a[i].t3; tek := a[i].t3; end end; writeln(time); end. [SESC USU] Zhirov Eugene Why WA#10? [5] // Problem 1193. Queue at the Exam 4 Dec 2009 22:04 I don't understand too. Have tried many test... And it works correctly. Help please by giving test =). Susan Arr (RAU) Re: Why WA#10? [4] // Problem 1193. Queue at the Exam 27 Dec 2010 22:08 Try this 3 100 10 120 70 40 150 99 15 100 The answer is 25. VolkovStanislav[MSU_Tashkent] Re: Why WA#10? // Problem 1193. Queue at the Exam 8 Aug 2011 23:52 Edited by author 09.08.2011 01:40 Astekinane Re: Why WA#10? [1] // Problem 1193. Queue at the Exam 22 Sep 2011 20:57 Why? I think it 35: 0 min: 1:100 10 120 2:70 40 150 3:99 15 100 Q{} 70 min: 1:30 10 120 3:29 15 100 Q{2(40)} 70+29 min: 1:1 10 120 Q{2(11),3(15)} 70+29+1 min: Q(2(10),3(15),1(10)} fin:100+10+15+10 min; Third student doesn't fit into 35 minutes. Levan Khunjgurua[Tbilisi SU] Re: Why WA#10? // Problem 1193. Queue at the Exam 29 Apr 2014 02:31 So? Extra time for the second one is 0 for the third is 25 for the first it is - 15 Shift = 40. Why is it incorrect? Algorithm - sort by T1 - results 2,3,1 Total time for the second student to accomplish = 110 110 > 99 so, here goes the third ready student 110+15=125. 125 - 100 = 25 Total time = 125. 125 > 100 so, here goes the first ready student 125+10=135. 135 - 120= 15 So the total shift is 40 minutes. What's wrong? :/ daminus SURE!!!! // Problem 1193. Queue at the Exam 1 Mar 2012 15:38 Oh, that's true!!! Thanks!! Сергей No subject // Problem 1118. Nontrivial Numbers 28 Apr 2014 23:41 test2 pls jex 2 тест [1] // Problem 1118. Nontrivial Numbers 31 Jan 2009 22:09 Какой там 2 тест? у меня не проходит(time limted); Сергей Re: 2 тест // Problem 1118. Nontrivial Numbers 28 Apr 2014 18:22 у меня тоже( Masterpiece WA #3, plz, help!!! [3] // Problem 1644. A Whole Lot of Walnuts 19 Jun 2012 04:26 People, can u help with test #3? I'm receiving WA... Andrew Sboev Re: WA #3, plz, help!!! [2] // Problem 1644. A Whole Lot of Walnuts 20 Jun 2012 11:33 "It is known as a fact, that ten walnuts is always enough and two walnuts are always not enough." B_o_y_k_a Re: WA #3, plz, help!!! // Problem 1644. A Whole Lot of Walnuts 30 Jun 2012 12:22 thanks!! that helped me!! BillSu Re: WA #3, plz, help!!! // Problem 1644. A Whole Lot of Walnuts 28 Apr 2014 17:20 I make the same mistake too. It is never too careful to read the question. vortexxx192 [ONPU] To admins (idea about new problem) [1] // Problem 1510. Order 11 Jan 2014 08:17 Hi! That is no surprise for you that O(N*logN) solution using C++ map<int, int> fits in 1 second perfectly. An idea is to create a problem "Order: version 2" with lower time limit (0.5 sec or something like that) and, maybe, higher amount of input. For what? Just for saying "YOU SHALL NOT PASS"© to O(N*logN) solutions and giving a chance only to O(N) algorithms (like Boyer-Moore Majority Vote Algorithm). And difficulty, of course, should be increased correspondingly. Thanks for attention. Long live Timus! Edited by author 11.01.2014 08:22 BillSu Re: To admins (idea about new problem) // Problem 1510. Order 28 Apr 2014 15:02 Looks like they take your advice, although not exactly. But not we can not get pass by using map. staticor Levenshtein [1] // Problem 1786. Sandro's Biography 30 Jun 2013 13:37 Levenshtein problem BillSu Re: Levenshtein // Problem 1786. Sandro's Biography 28 Apr 2014 11:33 Not. This is not Levenshtein problem. It's different. Tural Neymanov Can anybody clarify this to me? [2] // Problem 1796. Amusement Park 28 Apr 2013 04:03 Is such an input possible? 2 0 0 0 1 0 100 this means that teacher gave 1020 but the 20 that were given were unnecessary, and it's said that every note is needed. Thanks. ilalex Re: Can anybody clarify this to me? [1] // Problem 1796. Amusement Park 28 Apr 2013 19:42 No. Btw, my AC solution gives 0 on this test. BillSu Re: Can anybody clarify this to me? // Problem 1796. Amusement Park 28 Apr 2014 06:02 That, there not such test case here. Because your code should be wrong. The answer for this is : 1 10, which is my AC code give, and should be as we calculate by ourselves. But according to the question statement, it should not give such test cases. Because the teacher would not give unnecessary money. Edited by author 28.04.2014 06:04 Maqsud Erjonov Why WA #4? [5] // Problem 1404. Easy to Hack! 14 Sep 2009 19:01 var sh,de:string; a:array[1..100]of integer; i,n:Integer; begin readln(sh); n:=length(sh); for i:=1 to n do a[i]:=ord(sh[i])-97; for i:=2 to n do if a[i]<a[i-1] then a[i]:=a[i]+((a[i-1]-a[i])div 26 + 1)*26; for i:=n downto 2 do a[i]:=a[i]-a[i-1]; a[1]:=a[1]-5; de:=''; for i:=1 to n do de:=de+chr(97+a[i] mod 26); writeln(de); end. i didn't understand where is my mistake Sergey Lazarev (MSU Tashkent) Re: Why WA #4? [3] // Problem 1404. Easy to Hack! 14 Sep 2009 20:42 a[1] can be less than 5. Maqsud Erjonov Re: Why WA #4? // Problem 1404. Easy to Hack! 15 Sep 2009 17:43 Thank you Le Viet Thanh Long Re: Why WA #4? // Problem 1404. Easy to Hack! 5 Aug 2011 10:26 Edited by author 05.08.2011 16:43 Edited by author 05.08.2011 16:43 BillSu Re: Why WA #4? // Problem 1404. Easy to Hack! 27 Apr 2014 18:03 You are great! I got the same mistake. Adhambek Re: Why WA #4? // Problem 1404. Easy to Hack! 25 May 2013 01:19 if you problem input is "adham" . what is output? output is "vdetm" . You should know if the first letter is "a" or "b" or "c" or "d" or "f" (char)("a" + 26) is correct way! Сергей Почему по лимиту не проходит код? Код прост да неузнаваемости??? // Problem 1118. Nontrivial Numbers 27 Apr 2014 13:36 Паскаль почти все задачи по лимиту не проходят на одно и то же время, почему??? Bahturin Alexander (SibSUTI) Description of the mistake in the format of the sample input [10] // Problem 1638. Bookworm 11 Oct 2008 13:40 The correct format of the input is: <width of the book w/o the cover> <width of the cover> <number of the book where the worm _finishes_> <number of the book where the worm _starts_> (so, the last two were just given in the incorrect order) chobits Re: Description of the mistake in the format of the sample input // Problem 1638. Bookworm 11 Oct 2008 13:43 really? Ekvilon Re: Description of the mistake in the format of the sample input [8] // Problem 1638. Bookworm 11 Oct 2008 14:07 I disagree. Order of input data is absolutely correct. Bahturin Alexander (SibSUTI) Re: Description of the mistake in the format of the sample input [7] // Problem 1638. Bookworm 11 Oct 2008 16:30 So whould you mind explaining me the 'Sample output'? I treated the input as I wrote above and got AC.. spNautilus Re: Description of the mistake in the format of the sample input [6] // Problem 1638. Bookworm 11 Oct 2008 17:23 I did as he told and got AC, too. Vedernikoff Sergey (HSE: EconomicsForever!) Re: Description of the mistake in the format of the sample input [5] // Problem 1638. Bookworm 11 Oct 2008 18:14 You are wrong, guys. Input format is correct. You're lucky that ACed the problem without thinking about it. Think - and you'll find out that input specification is indeed correct - it's a very famous logical puzzle =) Anisimov Dmitry (Novosibirsk STU) Re: Description of the mistake in the format of the sample input [4] // Problem 1638. Bookworm 12 Oct 2008 20:11 The input format is entirely correct. The problem requires knowledge about how REAL books are USUALLY placed on shelves. The problem is very old trick really. I am sure many of contestants were already familiar with it (I was). Edited by author 12.10.2008 20:12 Edited by author 12.10.2008 20:12 Bahturin Alexander (SibSUTI) Re: Description of the mistake in the format of the sample input [1] // Problem 1638. Bookworm 14 Oct 2008 00:26 So.. Do you (all of you who says that input format is correct) mean that books are stored in a way that the last page is the leftmost one? If so than it's not surprising that the solution which swaps numbers of the books gets AC. Dr Zhihua Lai Re: Description of the mistake in the format of the sample input // Problem 1638. Bookworm 29 Aug 2011 17:05 yes, just imagine. when you place books on the shelf, the books are facing inwards, which means, the first page is on the right and the last page is on the left. Bogatyr Re: Description of the mistake in the format of the sample input [1] // Problem 1638. Bookworm 15 Oct 2012 22:34 Hah, I wasn't familiar with this particular trick, but I've done enough of the "simple" problems on Timus now to know that many problems derive their difficulty not from the underlying algorithm, but in correctly understanding problem statements which are sometimes tricky, ambiguous, or rely on unstated assumptions (like this one, assuming how people "normally" put books on shelves, and which side of the book contains the first page). So I'm learning to always ask "what's the catch?" and got AC first time on this one (after initial WA on many other "simple" problems). So solving Timus problems is successfully training me to read problems very carefully! BillSu Re: Description of the mistake in the format of the sample input // Problem 1638. Bookworm 27 Apr 2014 13:04 If you are really smart, try the problems not one get AC before, otherwise get the hell out of your pretentious mask. Nguyen Trung Hieu Can understand this problems statement mean [1] // Problem 1194. Handshakes 26 Sep 2013 13:35 Someone can explain the example test case and how this work for me? I read this problem many many times but still can't understand what this mean :( BillSu Re: Can understand this problems statement mean // Problem 1194. Handshakes 27 Apr 2014 10:32 You have to get inside the Author's head, and ask him/her. I am not going to be bothered with such problem any more. caoqinxiang To Admin [3] // Problem 1224. Spiral 4 Mar 2008 18:08 input 2 1 output 0 this is correct. however this solution get WA. AC program writes 1, which is wrong in fact. Moein Fatehi Re: To Admin [1] // Problem 1224. Spiral 22 Sep 2011 16:09 yea, U're Right White Falcon Re: To Admin // Problem 1224. Spiral 31 May 2013 23:42 Moein Fatehi wrote 22 September 2011 16:09 yea, U're Right It depends... Think more... BillSu Re: To Admin // Problem 1224. Spiral 26 Apr 2014 19:36 In fact. It is 1. Think... Ali Hassan New here, compilation error I do not understand what I have done wrong 26 Apr 2014 19:21 Edited by author 26.04.2014 19:40 Adhambek TEST 6 example [2] // Problem 1654. Cipher Message 19 May 2013 10:50 input : tatu!.?.?.!utat output : "" Edited by author 20.06.2013 00:20 Edited by author 20.06.2013 00:21 Edited by author 20.06.2013 00:35 JesusChristBuddhaAllah Re: TEST 6 example // Problem 1654. Cipher Message 27 Oct 2013 13:31 Штирлиц же "Убирает все пробелы и знаки препинания." BillSu Re: TEST 6 example // Problem 1654. Cipher Message 26 Apr 2014 15:17 That's a totally wrong test cases. The AC program won't give "". It is still original string. Besides there are NOT punctuation inside string. Sunnat No subject // Problem 1001. Reverse Root 26 Apr 2014 15:13 object _1001 { def main(args: Array[String]): Unit = { println(scala.io.Source.stdin.getLines.flatMap(_.split(" ").filter(!_.isEmpty())).toArray.reverse.map(t => math.sqrt(t.toDouble)).mkString("\n")) } } Kirill_Khapov WA 12 [1] // Problem 1876. Centipede's Morning 26 Apr 2014 10:13 #include <iostream> using namespace std; main() { int a, b; cin >> a >> b; if (39+2*a>a+2*b) cout << 39+2*a; else cout << 40+2*b; } my code is wrong :CC where is error? Edited by author 26.04.2014 10:14 Kirill_Khapov Re: WA 12 // Problem 1876. Centipede's Morning 26 Apr 2014 10:15 I found my error :D BillSu This Problem more looks like a joy! - Careful - telling you why. // Problem 1723. Sandro's Book 25 Apr 2014 16:35 One single letter count! Of course, Any substring would include one letter. Sunnat here my c code [1] // Problem 1149. Sinus Dances 7 Apr 2012 17:28 #include<stdio.h> main() { int n,i,j; scanf("%i",&n); for(i=1;i<n;i++) printf("("); for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { if(j>1) printf((j&1)?"+":"-"); printf("sin(%i",j); } for(j=1;j<=i;j++)printf(")"); printf("+%i",n+1-i); if(i!=n)printf(")"); } } BillSu Re: here my c code // Problem 1149. Sinus Dances 25 Apr 2014 13:26 A concise code. Much better than mine. Mes Why this is not correct? // Problem 1710. Boris, You Are Wrong! 24 Apr 2014 14:04 I keep getting wrong answer at the 2 example. Isn't it from the examples provided? If so, why for 0 0 4 3 6 0 the solution NO 0 0 5 0 1.6 1.2 is not correct? A1B1 is equal to A2B2, B1C1 is equal to B2C2, C1A1 is different from C2A2, the cosine is the same, therefore the angle is the same.
|