| ENG RUS | Timus Online Judge |
Обсуждение задачи 1314. Погоня в метроMayank Tiwari Any help for Test case 4 [2] // Задача 1314. Погоня в метро 10 дек 2015 00:18 Smilodon_am [Obninsk INPE] Re: Any help for Test case 4 [1] // Задача 1314. Погоня в метро 7 дек 2018 20:34 If you have WA test 4, try below test: 1 8 1 2 3 4 5 7 6 1 3 1 6 7 Answer: 5 7 Vladimir Tolkushkin Re: Any help for Test case 4 // Задача 1314. Погоня в метро 6 фев 2022 17:13 I have WA4, tried your test and got the correct answer: 5 7 Do you have another test to check WA4? Abid29 if u have wa in test 3 // Задача 1314. Погоня в метро 20 апр 2021 14:46 try this one input: 3 2 61 62 5 75 20 85 50 61 3 10 20 30 1 5 output: 5 Danica Porobic Can someone give me answer to this testcase? [6] // Задача 1314. Погоня в метро 3 сен 2004 19:17 4 3 75 85 20 2 61 62 5 75 20 85 50 61 3 10 20 30 3 30 20 85 Will answer include 75 or not? Dmitry 'Diman_YES' Kovalioff My AC program's output (+) [5] // Задача 1314. Погоня в метро 3 сен 2004 19:44 50 61 62 85 Danica Porobic Re: My AC program's output (+) // Задача 1314. Погоня в метро 5 сен 2004 15:42 Thanks, I got AC. Comp Re: My AC program's output (+) [3] // Задача 1314. Погоня в метро 2 ноя 2004 16:27 Why 75 does not fall into answer? Denis Koshman Re: My AC program's output (+) [2] // Задача 1314. Погоня в метро 1 авг 2008 05:01 Because no shortest route from 30 to 75 begins with 30,20,85 JerryDream Re: My AC program's output (+) [1] // Задача 1314. Погоня в метро 30 апр 2020 13:32 30->20->85->75 is one. Denis Koshman писал(a) 1 августа 2008 05:01 Because no shortest route from 30 to 75 begins with 30,20,85 Abid29 Re: My AC program's output (+) // Задача 1314. Погоня в метро 20 апр 2021 14:07 30->20->75 is shortest not your one Edited by author 20.04.2021 14:07 Edited by author 20.04.2021 14:07 Maxim Kiryushin I think testset for this problem isn't right [2] // Задача 1314. Погоня в метро 1 фев 2005 00:46 My AC program give answer 3 for a following test: 2 4 1 2 3 4 4 1 2 5 4 3 1 2 3 But I think answer must be: 3 4 Am I right? Samsonov Alex [SESC USU] Re: I think testset for this problem isn't right // Задача 1314. Погоня в метро 17 июн 2005 12:44 Yes. I think you are lucky you got AC. JerryDream Re: I think testset for this problem isn't right // Задача 1314. Погоня в метро 30 апр 2020 13:46 NO! Maxim Kiryushin писал(a) 1 февраля 2005 00:46 My AC program give answer 3 for a following test: 2 4 1 2 3 4 4 1 2 5 4 3 1 2 3 But I think answer must be: 3 4 Am I right? Failed Peter What does this sentence mean? [5] // Задача 1314. Погоня в метро 20 апр 2004 15:52 the length of a route is determined by the number of spans only But what's span?! tbtbtb Re: What does this sentence mean? // Задача 1314. Погоня в метро 20 апр 2004 16:31 span of nodes, I think. A. Mironenko Re: What does this sentence mean? [3] // Задача 1314. Погоня в метро 20 апр 2004 16:46 Read following few words - definition of span is there Failed Peter Re: What does this sentence mean? [2] // Задача 1314. Погоня в метро 21 апр 2004 13:09 (in the subway, a span is a tunnel between two adjacent stations). but i still don't know... Thadeu Russo - UAM Re: What does this sentence mean? // Задача 1314. Погоня в метро 21 апр 2004 22:51 Spans are edges... JerryDream Re: What does this sentence mean? // Задача 1314. Погоня в метро 30 апр 2020 13:37 Span are edges!(I have no word to say~~~) Failed Peter писал(a) 21 апреля 2004 13:09 (in the subway, a span is a tunnel between two adjacent stations). but i still don't know... Smilodon_am [Obninsk INPE] To admins: incorrect 'Compilation Error' verdict with Visual C++ 2017 compiler // Задача 1314. Погоня в метро 4 дек 2018 01:57 Hello. I have received strange 'Compilation Error' verdict for my solution on the 1314 task under Microsoft Visual C++ 2017 compiler. Compilation log is as follows: ///////////////////////////////////////// lg1vr1-w2nnli(24): error C2062: type 'float' unexpected lg1vr1-w2nnli(84): warning C4244: 'argument': conversion from 'float' to 'const int', possible loss of data lg1vr1-w2nnli(94): warning C4018: '<': signed/unsigned mismatch ///////////////////////////////////////// Lines 23 and 24 of my code are: ///////////////////////////////////////// const int MAX_STATION_ID = 32767L; const int INFINITY = 10L * MAX_STATION_ID; ///////////////////////////////////////// Commits with CE are 8162255, 8162250, 8162248. But there is successful (Accepted) commit 8162257 (the same code as 8162255) under G++7.1 commit. Could you check if the CE message was correct or not? Best regards. Edited by author 04.12.2018 02:01 MOPDOBOPOT (USU) Test question [1] // Задача 1314. Погоня в метро 1 авг 2012 23:42 Need help, WA9! 2 2 1 2 2 3 4 1 1 Is this test possible or not? lallala Re: Test question // Задача 1314. Погоня в метро 22 фев 2016 20:07 my ac prog says 1 2 Felix_Mate How solve this problem faster 0.1 sec? (I got AC) // Задача 1314. Погоня в метро 4 сен 2015 19:45 Danica Porobic WA on #3, can someone give me some tests or some hints? [3] // Задача 1314. Погоня в метро 2 сен 2004 02:27 If someone wants to try to debug my code or give me a hint or help me some other way, send me a mail on dporobic@eunet.yu Danica Porobic Hint (+) [2] // Задача 1314. Погоня в метро 5 сен 2004 15:44 Detail that made my WA #3 to AC : If the line is defined as follows: 3 1 2 3 then spans are 1-2 and 2-3, and not 1-3!!! Line aren't cycles.... AlexF Re: Hint (+) [1] // Задача 1314. Погоня в метро 4 сен 2006 11:40 When I had WA#3, this test helped: 1 1 1 1 1 The right answer is 1 Srihari Seshadri Re: Hint (+) // Задача 1314. Погоня в метро 5 апр 2011 00:55 That isn't a valid test case, though, because the K >= 2. You cannot have a line with only one station. Crescent Moon WA10 // Задача 1314. Погоня в метро 8 ноя 2008 11:25 Anyone had WA10? I can't understand :( I do BFS twice, and I think it's correct algorithm Edited by author 08.11.2008 11:27 Sa Lang Hae Need explanation [1] // Задача 1314. Погоня в метро 26 окт 2004 17:27 if there is a route like below: 3 1 2 3 Can I go from station 3 to station 1 directly? I mean, is the route a circle? Denis Koshman Re: Need explanation // Задача 1314. Погоня в метро 1 авг 2008 05:11 No. Tim Green any hints? [7] // Задача 1314. Погоня в метро 19 апр 2004 13:39 Wendell Re: any hints? [2] // Задача 1314. Погоня в метро 20 апр 2004 15:17 Bellman-Ford Alone alone ! Re: any hints? [1] // Задача 1314. Погоня в метро 22 апр 2004 14:11 I used two SSSP algo (BFS + DFS) to solve the problem. Can it be done with only one ? Thadeu Russo - UAM Re: any hints? // Задача 1314. Погоня в метро 22 апр 2004 20:42 how to determinate the shortest route??? Why in the test input the criminal goes to 85 and not to 10 or 75???? test i got wa test 3 [1] // Задача 1314. Погоня в метро 20 апр 2004 15:22 twotowers.bin Re: i got wa test 3 // Задача 1314. Погоня в метро 21 апр 2004 00:39 I too Edited by author 21.04.2004 00:39 Maigo Akisame (maigoakisame@yahoo.com.cn) Just 2 BFSs. [1] // Задача 1314. Погоня в метро 28 окт 2004 08:34 First do BFS with the first node in the criminal's route. Save the result in the array d1. Do another BFS with the last node in the criminal's route, and save the result in the array d2. For any node i, if d1[i]-d2[i]=m-1, then i is an answer. The graph is always connected. Denis Koshman Re: Just 2 BFSs. // Задача 1314. Погоня в метро 1 авг 2008 05:05 I build BFS traversal tree by giving priorities to points on the route (i.e. advance them first). Children of the last route node gain privelege for the rest of traversal (if you process nodes in the order they were first visited, this condition is automatic because they will be added prior to any other nodes during last privileged propagation). After BFS tree is ready, nodes reachable from last node on the route inside that tree form the answer. Edited by author 01.08.2008 05:09 Artem Fursenko Give me more tests, please!!!! (WA#2) [1] // Задача 1314. Погоня в метро 17 авг 2007 23:28 My program works correct with ALL tests, that were above. But there is WA2 on check. Vladislav Foordak [Streamline] Re: Give me more tests, please!!!! (WA#2) // Задача 1314. Погоня в метро 4 дек 2007 18:03 oh.. try to use Floyd-Uorshell's algoritm.. its may to help you.
|