| ENG RUS | Timus Online Judge |
Common Board<<~Kossack~>> If you got WA#3 or WA#16 [8] // Problem 1600. Airport 24 Mar 2008 23:20 ds:=sqr(b)-a*c; the checking must look like this if ds+0.000000000001>=0 then ... Olympic Bear (Nikolay Dubchuk) Re: If you got WA#3 or WA#16 // Problem 1600. Airport 10 Jun 2008 17:36 Also when I calculated square roots for a*t^2 + 2*b*t + c = 0 as t1,2 = (-b +- sqrt(b^2 - a*c)) / a I had wa3. When I use b = 2.0 * b t1,2 = (-b +- sqrt(b^2 - 4.0*a*c)) / (2.0*a) I got AC. It is very curiously... yujj Re: If you got WA#3 or WA#16 [4] // Problem 1600. Airport 13 Jun 2008 15:05 I has WA#3. Even, i use check ds+0.000000000001>=0. I don't understand what's wrong. :( Can you talk me what in test 3? Hadi Moshayedi Re: If you got WA#3 or WA#16 [3] // Problem 1600. Airport 24 Jul 2008 15:18 If ds passes this test, it may be less than zero. so, if it is less than zero, reset it to zero. otherwise, sqrt won't perform as expected. Denis Koshman Re: If you got WA#3 or WA#16 [1] // Problem 1600. Airport 19 Aug 2008 04:14 Also check for possible -0.000 replies (that happens in printf("%.3lf") when number is negative, but becomes zero after round-up). Some checkers do not like that. Linas Re: If you got WA#3 or WA#16 // Problem 1600. Airport 19 Oct 2008 22:40 Is negative time a possible answer? :( Azrail Re: If you got WA#3 or WA#16 // Problem 1600. Airport 1 Dec 2008 14:14 There is curious fact, that you can get AC with eps = .1! Most important do not forget about: Hadi Moshayedi wrote 24 July 2008 15:18 If ds passes this test, it may be less than zero. so, if it is less than zero, reset it to zero. otherwise, sqrt won't perform as expected. __Andrewy__ Re: If you got WA#3 or WA#16 // Problem 1600. Airport 30 Aug 2015 20:40 Thanks! anotherworld Re: If you got WA#3 or WA#16 // Problem 1600. Airport 24 Jul 2023 18:06 I also checked abs(ds) < eps , then t = -b/(2*a) Without it, it was WA3 anotherworld WA 14 // Problem 1325. Dirt 24 Jul 2023 00:15 THIS TEST 6 5 1 3 6 3 11112 22221 11112 22212 21112 22222 ANS:7 1 👑TIMOFEY👑`~ easy bfs // Problem 2140. BitMazeCraft 23 Jul 2023 14:34 Silomett TL so strict // Problem 1434. Buses in Vasyuki 23 Jul 2023 07:56 qwq Edited by author 23.07.2023 08:21 MyRoot WA4 [2] // Problem 1871. Seismic Waves 22 Oct 2018 19:29 I am using Dijkstra's algorithm(and skip first vertex). I output a list of names whose shortest distance is less 141. I can't find the tests that crack my solution... Give me tests, please) MyRoot Re: WA4 [1] // Problem 1871. Seismic Waves 22 Oct 2018 22:02 When a user retweets, It is NOT their name that is added to the line! InstouT94 Re: WA4 // Problem 1871. Seismic Waves 23 Jul 2023 01:14 OMG, I had the same stupid mistake! Cat36 WA 3 [4] // Problem 1590. Bacon’s Cipher 11 Nov 2008 23:42 Give me some tests, please Edited by author 11.11.2008 23:43 Aleksandr oO Shvarkunov [Pskov SPI Kamikaze] Re: WA 3 [2] // Problem 1590. Bacon’s Cipher 2 Feb 2009 20:14 abab answer - 7 It helped me with WA3 (Z-function O(N^2) solution) rthfdffdfdfffffdddffdgdfdfdg answer - 349 hshhflgseiuajsliouew answer - 202 gggfffgggghhhhghh answer - 126 aaaabbbbfghjjlltrgttcdssdbnpoiuyewtdarsuorprpooeuyywdgfxsdkkvcjbidfryieiue answer - 2713 Edited by author 02.02.2009 20:14 Edited by author 02.02.2009 20:21 strange Re: WA 3 // Problem 1590. Bacon’s Cipher 12 Nov 2011 23:53 If you use Z-function don't forget re-initialize z-array before each iteration!!! z[0]..z[i] = {0} Yarila Re: WA 3 // Problem 1590. Bacon’s Cipher 22 Jul 2023 18:05 hm... This are tests successful, but error on 1 test Pavel Re: WA 3 // Problem 1590. Bacon’s Cipher 25 Sep 2021 03:30 try bbbabbbababb answer is 51 Sihang Give you some testcases,maybe can help you [2] // Problem 1066. Garland 27 Jan 2009 16:54 999 987.23 answer 934270.79 3 100 answer 0.00 4 1000 answer 0.00 5 12 answer 0.00 Azat Yusupov(TUIT Urgench) Re: Give you some testcases,maybe can help you // Problem 1066. Garland 11 Oct 2010 18:10 Thank you very much! Andrey Re: Give you some testcases,maybe can help you // Problem 1066. Garland 21 Jul 2023 17:45 thank you. Try this if you have WA3. andreyDagger`~ WA26 // Problem 1913. Titan Ruins: Alignment of Forces 21 Jul 2023 00:03 eps >= 1e-9 - WA26 eps = 1e-7 - AC Тимур Time limited [1] // Problem 2117. Polyphemus' triples 24 Mar 2021 14:47 plese help test 104 tepamid Re: Time limited // Problem 2117. Polyphemus' triples 18 Jul 2023 22:31 Obviously sqrt(1e18) operations will TLE. You need to do factorization smarter. Perhaps some divisors are not needed to find the solution? 👑TIMOFEY👑`~ easy bfs // Problem 1301. Cube in Labyrinth 17 Jul 2023 08:22 👑TIMOFEY👑`~ WA6 // Problem 2147. City Building 16 Jul 2023 23:49 4 5 4 5 1 2 2 1 2 3 3 2 3 4 ans: 14 Andrewq test 7 wrong // Problem 1005. Stone Pile 15 Jul 2023 06:08 Edited by author 15.07.2023 07:47 andreyDagger`~ Damned solution // Problem 1148. Building Towers 15 Jul 2023 01:29 I used my own hash map with modulo 1e5, and buckets with size equal to one Parassat Kyzyrkanov WA7 // Problem 1574. Mathematicians and brackets 14 Jul 2023 12:24 it's the case where count of '(' is greater than ')'. For example: (( or (() 👑TIMOFEY👑`~ WA 38 IIIIIIIIII GOOOOOOOOOOOOOOOOT ACCCCCCCCCCCCCCCCCCCCC // Problem 1912. Titan Ruins: Passing through Walls 12 Jul 2023 15:29 its wa is something like a Ivan's Car problem name WHY WA#12 [2] // Problem 1336. Problem of Ben Betsalel 2 Apr 2012 18:34 [code deleted] Edited by moderator 27.07.2023 17:22 Schullz Re: WHY WA#12 // Problem 1336. Problem of Ben Betsalel 19 Sep 2012 02:55 I know that 12th test is so big. Maybe it will help you Edited by author 19.09.2012 02:57 Raphael Osipov Re: WHY WA#12 // Problem 1336. Problem of Ben Betsalel 11 Jul 2023 22:48 the solution in C++ gave WA12, but the same algorithm in Python gave AC. I think, overflow is comming. Igor Parfenov About new lines // Problem 1542. Autocompletion 11 Jul 2023 15:44 There is no checker in this problem. In my solution I 1. Print new line after query even if there is no strings which satisfy it 2. Don't print new line after last query __Andrewy__ I don't understand the first example [1] // Problem 2022. Riding a Toad 29 May 2019 10:02 Pls, explain me why i'm wrong Let T is answer. t in [0,T]: x(t)=vx*t, y(t)=vy*t-g*t^2/2 t > T: x(t) = x(T) + (vx+ux)(t-T) = (vx+ux)t - ux*T y(t) = y(T) + (vy - g*T + uy)*(t-T)-g * (t-T)^2/2 = (-g/2)*t^2 + (vy+uy)*t-y*T t1, t2: x(t1)=L, x(t2)=L+l t1 = (L+ux*T)/(vx+ux) t2 = (L+l+ux*T)/(vx+ux) tv: y'(tv)=0, tv = (vy+uy)/g Then i use conditions: 0<T<L/vx, T<2*vy/g h<y(t1)<h+d, h<y(t2)<h+d if tv in (T-eps, T+eps) then y(tv)<h+d My algo: find all candidates from conditions and then check that candidate is good My code: [code deleted] Edited by moderator 27.07.2023 17:23 InstouT94 Re: I don't understand the first example // Problem 2022. Riding a Toad 10 Jul 2023 02:27 "Nod can throw a stone with an ABSOLUTE initial speed (ux, uy)." 👑TIMOFEY👑`~ wa 28 // Problem 1447. Portkey Network 9 Jul 2023 13:07 play with precision Yury_Semenov Useful test // Problem 1058. Chocolate 7 Jul 2023 17:22 5 0 0 4 0 4 2 2 4 0 2 answer: 3.640719
|