| ENG RUS | Timus Online Judge |
Обсуждение задачи 1463. Радость населению!Denis Koshman If you get WA6 [1] // Задача 1463. Радость населению! 14 авг 2008 23:06 Read problem statement more closely. The graph can be disconnected. Ade Re: If you get WA6 // Задача 1463. Радость населению! 11 мар 2023 15:22 Denis Koshman писал(a) 14 августа 2008 23:06 Read problem statement more closely. The graph can be disconnected. Really helped me a lot. >>> Почему надо запускаться от всех узлов? // Задача 1463. Радость населению! 8 ноя 2021 22:53 я выбрал корнем вершину 1 и запускал в int main() дфс от этой вершины. Прошло 24 теста и упало на 25, но затем я запустился от всех вершин с условием if(!used[i]) dfs(i) и прошло. я не понял почему.. >>> help wa 25 / wa 6 // Задача 1463. Радость населению! 8 ноя 2021 16:59 Dart MirzMan C++ Edition (Mirzoyan Alexey, Rybinsk SAAT) if you have WA9... (+) [1] // Задача 1463. Радость населению! 23 май 2007 21:03 4 0 0 0 0 0 Edited by author 23.05.2007 21:03 allenite Re: if you have WA9... (+) // Задача 1463. Радость населению! 21 сен 2018 00:05 thanks, buddy it helped me Ashiqul Islam Test 54 // Задача 1463. Радость населению! 2 сен 2017 16:19 What may be the test 54 ?? Felix_Mate No subject // Задача 1463. Радость населению! 21 ноя 2015 16:13 Edited by author 29.08.2016 21:00 Shayan Modiri WA Test 14. [1] // Задача 1463. Радость населению! 24 дек 2014 00:03 I tried all the samples from the discussion and I tried some exception conditions. The program works for all these samples. Do you have any idea what can be wrong? I can share my C++ code. Shayan Modiri Re: WA Test 14. // Задача 1463. Радость населению! 24 дек 2014 00:26 Tried disconnected graphs, individual nodes, just a path, and zero edge and node weights. It works for all of the cases :/ hliu20 WA8, some hints? PLZ [3] // Задача 1463. Радость населению! 28 май 2013 17:48 hliu20 Re: WA8, some hints? PLZ [2] // Задача 1463. Радость населению! 28 май 2013 17:54 can anybody give some cases? what the #8 is? Helder Lima da Rocha Re: WA8, some hints? PLZ [1] // Задача 1463. Радость населению! 19 мар 2014 19:34 9 8 1 5 4 6 10 1 2 2 1 1 2 1 2 3 10 2 4 1 4 5 1 4 6 2 6 7 2 6 8 3 3 9 1 Answer: 39 5 5 4 3 2 9 or 39 5 9 2 3 4 5 Shayan Modiri Re: WA8, some hints? PLZ // Задача 1463. Радость населению! 24 дек 2014 00:05 Answer: 39 5 5 4 2 3 9 or 39 5 9 3 2 4 5 Heng why got WA#43, some hints? PLZ ! // Задача 1463. Радость населению! 9 дек 2013 11:43 Edited by author 09.12.2013 11:44 Raman Gupta how to choose from which town to start? [4] // Задача 1463. Радость населению! 31 мар 2013 00:31 I am getting TLE on test 24. How will you choose from which town to start? Because of this I had to start from every town to find the answer. For each town it took me O(n),so for all the towns it becomes O(n^2), causing TLE. Vedernikoff 'Goryinyich' Sergey (HSE: АОП) Re: how to choose from which town to start? [3] // Задача 1463. Радость населению! 31 мар 2013 01:49 Actually that's the main issue for this problem. If you want a hint - that's it: try to develop some dynamic programming scheme for solution. Raman Gupta Re: how to choose from which town to start? [2] // Задача 1463. Радость населению! 31 мар 2013 21:52 Edited by author 05.04.2013 16:20 Edited by author 05.04.2013 16:20 Raman Gupta Re: how to choose from which town to start? // Задача 1463. Радость населению! 5 апр 2013 16:17 Finally AC! Slight implementation change got me AC!. Raman Gupta Re: how to choose from which town to start? // Задача 1463. Радость населению! 5 апр 2013 16:19 Edited by author 05.04.2013 16:19 Edited by author 05.04.2013 16:19 Pavel Kovalenko Just BFS // Задача 1463. Радость населению! 26 ноя 2010 12:19 No DP! Just 2 BFS for each connected component. Baurzhan if you have wa on test # 3 // Задача 1463. Радость населению! 22 авг 2009 16:53 try this test: 3 2 0 0 1 1 2 1 1 3 1 answer is 3 3 3 1 2 Edited by author 15.01.2010 22:22 Baurzhan please give hint about test # 3 // Задача 1463. Радость населению! 22 авг 2009 16:19 please give hint about test # 3 Baurzhan tell me what's wrong in my idea // Задача 1463. Радость населению! 21 авг 2009 21:11 i decompose graph into connected components (by one dfs) after that i count diameter of each component(by one special_dfs) and refresh global_variable if need. my programm works at all my tests and sample test too. Lebedev_Nicolay[Ivanovo SPU] WA 29!!! [4] // Задача 1463. Радость населению! 29 апр 2009 22:36 What is the test #29? Lebedev_Nicolay[Ivanovo SPU] Re: WA 29!!! [3] // Задача 1463. Радость населению! 30 апр 2009 02:21 Can anybody give me test for WA #29??? Lebedev_Nicolay[Ivanovo SPU] Re: WA 29!!! [2] // Задача 1463. Радость населению! 30 апр 2009 18:26 Will anybody answer my question??? Fyodor Menshikov Re: WA 29!!! [1] // Задача 1463. Радость населению! 2 май 2009 14:10 Lebedev_Nicolay[Ivanovo SPU] писал(a) 30 апреля 2009 18:26 Will anybody answer my question??? Maybe in year or two. Forum is not for instant answers. It is rather knowledge base. There is no answer to your question in the base yet. Maybe answer will appear but 99% that _you_ will first find the bug and post yourself test for the bug here than someone get wa29 and post test for it. Lebedev_Nicolay[Ivanovo SPU] Re: WA 29!!! // Задача 1463. Радость населению! 6 июл 2009 00:14 At last, I've solved it)))) If you have WA29 try this test: 8 6 1 2 5 4 1 2 1 6 1 2 1 2 3 1 2 4 1 5 6 1 6 7 1 6 8 1 Answer is : 13 3 3 2 4 Lebedev_Nicolay[Ivanovo SPU] Who have solved #1463 - help me. // Задача 1463. Радость населению! 6 май 2009 00:30 I have WA #29. At first i thought that it is simple overflow, but it is not right. Anton [SUrSU] WA #7 [2] // Задача 1463. Радость населению! 12 окт 2006 01:35 What about this test? Levenets Re: WA #7 [1] // Задача 1463. Радость населению! 16 фев 2008 23:28 maybe there isolated node? some like this 3 1 100 50 10 2 3 10 Denis Koshman Re: WA #7 // Задача 1463. Радость населению! 14 авг 2008 23:01 Edited by author 14.08.2008 23:02 EarthShaker To Admins // Задача 1463. Радость населению! 12 мар 2008 17:56 I have tried for many times but always WA#29 Could you please tell me why? Lion question [1] // Задача 1463. Радость населению! 8 дек 2006 13:27 As I understood there is vertex with number "0" and what is happiness of town "0" ? Tbilisi SU: Eldar Bogdanov Re: question // Задача 1463. Радость населению! 8 дек 2006 13:49 I believe you've got the problem statement wrong, vertexes are numbered from 1 to N, so there is no town with number 0. Alexander Prudaev How many edges in this graph? K<? [1] // Задача 1463. Радость населению! 24 ноя 2006 22:48 autors must add this restriction in Statement of the problem [SPbSU ITMO] WiNGeR Re: How many edges in this graph? K<? // Задача 1463. Радость населению! 25 ноя 2006 00:01 K is bounded by this condition: "It turned out that if Petrovich can fly (using one or several flights) from town i to town j, then there is exactly one way to do this"
|