| Show all threads Hide all threads Show all messages Hide all messages |
| Wrong answer on Test#1 | gautamvs | 1471. Distance in the Tree | 13 Jun 2013 07:31 | 2 |
Please suggest some test case to cross this test.
Edited by author 15.12.2012 18:02
Edited by author 15.12.2012 18:02 3
1 0 1
2 0 1
3
0 0
1 1
2 2
right answer : 0 0 0 |
| WA Test 31 | Leinstay | 1880. Psych Up's Eigenvalues | 13 Jun 2013 06:40 | 1 |
|
| wa6 | ssau_617_korabelnik | 1885. Passenger Comfort | 13 Jun 2013 01:18 | 4 |
wa6 ssau_617_korabelnik 29 Oct 2011 21:34 what's test?
Edited by author 29.10.2011 21:35 Re: wa6 Nguyen Khac Tung 30 Oct 2011 08:40 For me, wa6 means max formula is wrong somewhere Re: wa6 IgorKoval(from Pskov) 31 Oct 2011 18:09 Test #6
h == 10000 &&
t2 == 500 &&
Vm == 50 &&
x == 21
ans: 0.000000000000000 476.190476190476200
see other topik For me, wa6 means max formula is wrong somewhere No, the formula is right. But think about MAX time, it also can be real, not only MIN. |
| Solution | sdlcj | 1885. Passenger Comfort | 13 Jun 2013 01:11 | 3 |
Note that : print the double is ok! Solution is very simple but I couldn`t firstly find it. It is a set of equations, everybody learned it at school. Simply try to solve this: y+z=t and v*y+x*z=h, where Y is MIN time and Z is t-MIN time. Try to find MAX by yourself.
Sorry for my awful English. Good luck:)
Edited by author 13.06.2013 01:13 |
| WA#10 | Ade | 1748. The Most Complex Number | 12 Jun 2013 15:48 | 2 |
WA#10 Ade 30 Nov 2012 19:18 Don't know why. Maybe something tricky between 1e11 ~ 1e12? Re: WA#10 SamGTU7_Kareva Nadezhda Vladimirovna 12 Jun 2013 15:48 The same problem. Even precalculated data didn't help |
| In the solution ranking the top one for Java has no Memory used | Yifei Xu | 1197. Lonesome Knight | 12 Jun 2013 03:48 | 1 |
|
| WA | SamGTU5_Ukhova_Yulia_Alexandrovna | 1944. Record of the Attack at the Orbit | 12 Jun 2013 01:33 | 1 |
WA SamGTU5_Ukhova_Yulia_Alexandrovna 12 Jun 2013 01:33 help please, send a working code to this task on с++ on mail juliauhova@mail.ru. I will be very grateful. |
| WA | SamGTU5_Ukhova_Yulia_Alexandrovna | 1759. Long-Livers | 12 Jun 2013 01:20 | 1 |
WA SamGTU5_Ukhova_Yulia_Alexandrovna 12 Jun 2013 01:20 help please, send a working code to this task on с++ on mail juliauhova@mail.ru. I will be very grateful.
Edited by author 12.06.2013 01:24 |
| Dynamic Programming-Google question | anish | | 12 Jun 2013 00:01 | 4 |
Given an array of integers. Find two disjoint contiguous sub-arrays such that the absolute difference between the sum of two sub-array is maximum.
* The sub-arrays should not overlap.
example- array [2, -1, -2, 1, -4, 2, 8]
answer - first (-1 -2 1 -4) Second (2 8), Maximum difference = (10-(-6)) 16.
Can you please provide recurrence relation for Dynamic Programming to solve this?It would be nice if it is accompanied with explanation.
Edited by author 12.06.2013 00:01
Edited by author 12.06.2013 00:01 But you can do it in N^4 time also by using brute force , You appear this question during interview process ? |
| Do not bother with shortest ways | alpha900i | 1178. Akbardin’s Roads | 11 Jun 2013 21:49 | 1 |
Spent some time trying to create algorithm, that would make shortest possible set of roads. Then understood, that Akbardin will fight for shortness later; atm he bothered only with having roads without crossing. That why task became so much easier... Hope this would save someone's time. |
| Brute Force after rejudge | TinyJanssen | 1005. Stone Pile | 11 Jun 2013 19:57 | 4 |
I got an error on #8 after rejudging the problem. First i got AC.
This time I tried a brute force approach.
first i generated al binary digits from 0 to 2^N.
then i counted sum of the stones where the bit was 1.
The difference total-2*sum had to be minimal.
AC in 0.2 sec I tried this approach but got TLE for test 3. Question i keep asking myself is, "Must you check all the 2^N combinations. if "No" how should you set your break point? Try to write more effective code, don't use string and set at all! Try to write more effective code, don't use string and set at all! Thank You. Just nailed it. |
| WA#7 | khanh45a3kct | 1450. Russian Pipelines | 11 Jun 2013 18:53 | 2 |
WA#7 khanh45a3kct 23 Feb 2007 10:48 Re: WA#7 Ivan Tyamgin (TNU) 11 Jun 2013 18:53 |
| No subject | surayyo | 1001. Reverse Root | 11 Jun 2013 17:06 | 1 |
|
| Please help,WA#3. | Hrayr | 1205. By the Underground or by Foot? | 11 Jun 2013 00:52 | 3 |
IS it special case or something like that?
If you have that test please give me. You shouldn't forget inputdata can be not integer but real(coordinates of metro stations or coordinates of point A and B or speeds of metro or foot) good luck (; |
| Accepted | Paata Julakidze | 1100. Final Standings | 10 Jun 2013 14:30 | 1 |
Accepted Paata Julakidze 10 Jun 2013 14:30 |
| What a test 14? | SS123 | 1822. Hugo II's War | 9 Jun 2013 18:38 | 1 |
Give some tests, please... |
| what is the ouput of the number 99 and 202 | sultan | 1189. Pairs of Integers | 9 Jun 2013 17:57 | 4 |
what is the ouput of the number 99 and 202 > what is the ouput of the number 99 and 202
The answer for 99 is:
1
90+9=99
the answer for 202 is:
5
151 + 51 = 202
184 + 18 = 202
186 + 16 = 202
191 + 11 = 202
201 + 01 = 202
Have a luck! :)
If you want, write to me on e-mail: vladovasilev@abv.bg > 200+02
It's wrong.
Edited by author 09.06.2013 17:58 |
| Another Hint | Inacio Medeiros | 1893. A380 | 9 Jun 2013 08:58 | 1 |
Try to "draw" the organization of seats, it helps a lot in writing algorithm solution. |
| 1748 | Vilchevski Konstantin | 1748. The Most Complex Number | 9 Jun 2013 04:59 | 3 |
1748 Vilchevski Konstantin 26 Jan 2010 21:36 Wrong answer 3 test. Help! Re: 1748 Ivanov Alexander (HSE Mozgless Eagles) 22 Jul 2011 17:29 In my case it was problems with test
1
12
Correct answer
12 6
Edited by author 22.07.2011 18:01 Re: 1748 SamGTU7_Kareva Nadezhda Vladimirovna 9 Jun 2013 04:59 try
2
12
2
Second test number is smaller than the first |
| WA 6? what is test? | orcchg | 1823. Ideal Gas | 9 Jun 2013 01:54 | 3 |
No prob, i proceed to AC now.
I guess, Test 6 is:
T != 0.0
V != 0.0
p == 0.0
n - ?
Ans: n = 0 (just 0, not 0.000000)
T != 0.0
V != 0.0
n == 0.0
p - ?
Ans: same here, p = 0 your answer is wrong . because it becomes T != 0 and V != 0 and n == 0 answer is error!
i think answer is "error" when n != 0 and p == 0 or p != 0 and n == 0 ... |
