|  | 
|  | 
| | we have 12 hours on clocksPlease give me some tests, my program passed all the tests on the forum
 Edited by author 22.07.2020 04:11
 33:00:00
 4:00:00
 12:00:00
 answer: 4:00:00
 
 4
 1:00:00
 6:00:00
 6:00:00
 12:00:00
 answer: 6:00:00
 
 3
 1:00:00
 6:00:00
 12:00:00
 answer: 1:00:00
my program as many others in net got AC but failed on test3
 1:00:00
 12:59:58
 12:59:59
 Correct answer is 1:00:00 but not 13:00:00.
 
 Edited by author 07.06.2012 16:51
i can't find the bug in my code, pls give me some tests :D Try this test:
 input:
 3
 12:00:00
 5:00:00
 8:30:00
 output:
 12:00:00
 
 My program passed all of the tests given in this forum and still failed on this one!
.... I find some errors and now WA19 can anybody help me? if you have WA#7 try this test13
 1:00:00
 1:00:00
 1:00:00
 1:00:00
 1:00:00
 1:00:00
 1:00:00
 1:00:00
 1:00:00
 1:00:00
 1:00:00
 1:00:00
 2:00:00
 
 right answer 1:00:00
 i have WA7, but my answer on this test is right (1:00:00)why?
 right answer is 1:00:00. 1:00:00 -> 2:00:00, 12 hours2:00:00 -> 1:00:00, 11 hours
 
 11 less than 12=)))
 can you explain please, why 1:00:00 -> 2:00:00, 12 hours.i guess that 1:00:00 -> 2:00:00 is 1 hour
 because you have 12 clocks with 1:00:00 time and if you change them all to 2:00:00, you'll spend 12 hours (1 * 12).512:00:00
 12:00:00
 12:00:00
 12:00:00
 1:00:00
In english language:"and the hour-hand rotates 60 times slower than the minute-hand." ->
 "and the hour-hand rotates 12 times slower than the minute-hand.", and similar mistake in russian.
12:00:00 or 4:00:00 I think answer can be any of 12:00:00, 4:00:00, 8:00:00 , can't it?On this test my AC solution got WA:
 void main()
 {
 printf("50000\n");
 for(int i=0;i<25003;i++)
 {
 printf("1:00:08\n");
 };
 for(int i=25003;i<50000;i++)
 {
 printf("1:00:07\n");
 }
 };
 
 Right answer is 1:00:08 but my program write 1:00:07
 Thank you for test. The problem was rejudged, 63 authors lost AC. Please change russian statment ("все часы идут вразнобой") to ("некоторые часы идут вразнобой")!!! ;)))Could someone give some useful tests for this problem? My code seems to give good output for all tests posted here, but i still get WA #3.Can someone please help me with test case #3. I get WA on it, but my solution passes all test cases I made. :\My program works on sample input and all inputs given in discussion forum. But I am getting WA3. Can anybody please give me direction or this test case? I get WA3 as well, so ca u pls help me?
 Edited by author 02.04.2009 05:52
 
 Edited by author 02.04.2009 05:52
 Mine too, what's the catch ? :(This test can help you:3
 3:00:00
 6:00:00
 9:00:00
 Answer is 9:00:00
 
 Edited by author 10.07.2008 23:14
 Ansewr of my program is 9:00:00, but WA5(I Have TLE on test 14, but my solution work O(n*log(n)).Qsort and linear algorithm O(n)! I don't understant why TLE.
 Instead of qsort better O(n) sort using arr[43200] (busket) or maybe use
 for i := 1 to n do
 swap(a_[random(n)+1],a_[random(n)+1]);
 
 It's O(MAXTIME), MAXTIME=12*60*60in promblem say that all clock difrentbut in 14 test some clock have same time and it amount >255 :)
 in promblem say that all clock difrentbut in 14 test some clock have same time and it amount >255 :)
 Judge Look!!!I got WA#14 too :( ... please give me some usefull tests... thXTry this test, when I had WA #14 it helped me.
 input:
 3
 1:00:00
 7:00:00
 7:00:00
 
 output:
 7:00:00
WA :(Can anyone give me some sly tests?
 | 
 | 
|