| ENG RUS | Timus Online Judge |
Discussion of Problem 1362. Classmates 2>>> i dont know why wa3.. [2] // Problem 1362. Classmates 2 27 Oct 2021 07:30 >>> Re: i dont know why wa3.. [1] // Problem 1362. Classmates 2 27 Oct 2021 07:35 help pls >>> Re: i dont know why wa3.. // Problem 1362. Classmates 2 27 Oct 2021 08:09 окей это было связано с тем как я неверно пытался сделать корнем узел тани Pio WA#10! Help me please!!! [3] // Problem 1362. Classmates 2 27 Aug 2005 04:58 Piratek-(akaDK) Re: WA#10! Help me please!!! // Problem 1362. Classmates 2 8 Jul 2008 21:15 I also have WA10/ Help Someone! Vadim Re: WA#10! Help me please!!! [1] // Problem 1362. Classmates 2 9 May 2012 19:39 I m too :\ Chahat agrawal Re: WA#10! Help me please!!! // Problem 1362. Classmates 2 12 Nov 2019 00:15 9 8 2 0 4 3 0 0 5 6 0 0 0 0 9 0 7 0 1 correct answer 4 Arm some Test Please !!! [1] // Problem 1362. Classmates 2 17 Sep 2006 19:10 some Test Please !!! Chahat agrawal Re: some Test Please !!! // Problem 1362. Classmates 2 12 Nov 2019 00:15 9 8 2 0 4 3 0 0 5 6 0 0 0 0 9 0 7 0 1 correct answer 4 Pavlik Optimization [7] // Problem 1362. Classmates 2 30 Sep 2008 14:39 I accepted 0.39(5kb). I use template veckor class(C++) to store list of employees. But I don't know how make my program faster :( Edited by author 30.09.2008 14:40 Pavlik Re: Optimization [6] // Problem 1362. Classmates 2 30 Sep 2008 14:47 Edited by author 30.09.2008 14:51 Vedernikoff Sergey (HSE: EconomicsForever!) Re: Optimization [5] // Problem 1362. Classmates 2 2 Oct 2008 00:46 Don't use vectors - these are VERY slow structures (as, by the way, all STL components). Rewrite with usual arrays - and, I think, speed of your code will increase several times... hoan Re: Optimization // Problem 1362. Classmates 2 6 Dec 2010 23:01 i use vector too, i think if i got use array memory limit have exceeded. Vlad Re: Optimization [3] // Problem 1362. Classmates 2 31 Mar 2011 19:45 Vedernikoff Sergey (HSE: EconomicsForever!) wrote 2 October 2008 00:46 Don't use vectors - these are VERY slow structures (as, by the way, all STL components). Rewrite with usual arrays - and, I think, speed of your code will increase several times... This statement is just wrong.Vedernikoff 'Goryinyich' Sergey (HSE: АОП) Re: Optimization [2] // Problem 1362. Classmates 2 31 Mar 2011 19:49 In which part? For any STL component I can write much faster analog. Vlad Re: Optimization [1] // Problem 1362. Classmates 2 2 Apr 2011 01:53 Well, I was refering only to vectors. Of course you can make sets/maps/other stuff faster. But the underlying structure of a vector is the same array. E.g. vector<int> is just a {array pointer, size, reserved mem}. I've heard this myth about vectors being slow several times, that's exactly why I've done some real testing of it - absolutely no difference, especially if you give the size beforehand (which you have to do in case of arrays). Actually, if you use an iterator to iterate through your vector, it can sometimes actually be faster for different reasons. The only difference may come from using multidimensional (i.e. nested) vectors - in that case, indeed, there can be some performance differences, but still, saying "VERY slow structures" is an extreme exaggeration... remember, you said "increase several times" :). Edited by author 02.04.2011 02:12 pmartynov Re: Optimization // Problem 1362. Classmates 2 19 Apr 2015 22:03 vector<bool> is slow. l@mho Accepted 0.39s :D [1] // Problem 1362. Classmates 2 6 Oct 2007 04:50 i accepted :D netman Re: Accepted 0.39s :D // Problem 1362. Classmates 2 11 May 2013 17:15 Congratulations! I accepted too : ) It's easy task Edited by author 11.05.2013 17:15 Edited by author 11.05.2013 17:15 Berezhko German Not correct // Problem 1362. Classmates 2 19 Sep 2012 16:33 "...Она сразу же позвонила своей начальнице, затем своей подруге Лене, находящейся у неё в подчинении, потом Кате и Маше...". In my solution she can call friends, and then her boss. And solution, when she at first call the boss and then friends, get WA4. armenia1993 WA on test 17 // Problem 1362. Classmates 2 21 May 2012 11:45 What the 17 test? why WA? armenia1993@mail.ru int charact(int v) { used[v] = true; vector<int> dp; for (int i=0; i<g[v].size(); ++i) { int to = g[v][i]; if (!used[to]) dp.push_back(charact(to)); } if (dp.size() == 0) return 0; sort(dp.begin(), dp.end()); for (int i=dp.size(); i>0;--i) dp[i-1] += dp.size() - i + 1; return *max_element(dp.begin(), dp.end()); } Denis Astanin (KPI) what is the third test? [1] // Problem 1362. Classmates 2 2 Jun 2011 15:27 Alexey Dergunov [Samara SAU] Re: what is the third test? // Problem 1362. Classmates 2 4 May 2012 12:32 If you enumerate vertices from 0, be sure that you decrease root's number before calling DFS. Smilodon_am [Obninsk INPE] To admin: Weak tests [1] // Problem 1362. Classmates 2 22 Aug 2011 13:24 My AC (accepted) program (numbers of submits: 3740606 or 2776983) has BIG Time Limit at home on this test: 100000 2 3 [...] 99999 100000 0 0 [... number "0" repeatedly 99999 times] 0 1 This test may be got by this simple program (on Pascal): var I, N: Longint; begin N := 100000; Writeln(N); for I := 2 to N do Write(I, ' '); Writeln('0'); for I := 2 to N do Writeln('0'); Write('1'); end. Please, add this test and its analogs to test base. Edited by author 22.08.2011 13:52 Vladimir Yakovlev (USU) Re: To admin: Weak tests // Problem 1362. Classmates 2 1 Sep 2011 15:34 Your test is added. 26 authors lost AC after rejudge. Thank you! l@mho Tanya alway calls her boss first? right? [2] // Problem 1362. Classmates 2 5 Oct 2007 15:03 hoan Re: Tanya alway calls her boss first? right? [1] // Problem 1362. Classmates 2 6 Dec 2010 23:02 no. Vlad Re: Tanya alway calls her boss first? right? // Problem 1362. Classmates 2 31 Mar 2011 19:18 This is not very well formulated. First, the problem statement says "She called her boss immediately, then her friend...", implying that she must call her boss first, even if that's not optimal. What about other employees? Must they also call their bosses before any subordinates? hoan O(N) exist??? // Problem 1362. Classmates 2 6 Dec 2010 23:03 i use O(nlogn) and got AC, if you use O(N) for this problem, plz tell your algo to me. sorry for my poor english. ILTK! How the hell to avoid MLE? [4] // Problem 1362. Classmates 2 25 Apr 2005 20:09 Krayev Alexey(PSU#2) Re: How the hell to avoid MLE? [1] // Problem 1362. Classmates 2 26 Apr 2005 19:01 You can do all you want but never, never use dynamic structures!!!! Dimat Dont belive him!!! // Problem 1362. Classmates 2 4 May 2005 21:02 Vladimir Yakovlev (USU) Memory Limit is 10 MB now // Problem 1362. Classmates 2 27 Apr 2005 11:03 Alex Tolstov Re: How the hell to avoid MLE? // Problem 1362. Classmates 2 7 Feb 2009 03:14 MLE=16M I think, it's not correct. My Java solution gets MLE20, but the same solution, used C++ gets AC with 8M of memory. Yu Yuanming some hint [4] // Problem 1362. Classmates 2 14 May 2005 17:19 The method is something like DP + greedy... Einstein Chen(einstein[underline]csm[at]hotmail[dot]com) Re: some hint [3] // Problem 1362. Classmates 2 29 May 2005 10:34 yeah! 0.078s 2406 KB Andrey Veselovskiy Re: some hint [2] // Problem 1362. Classmates 2 26 Oct 2006 16:19 Is this greedy right? : 1. Make Tanya a root. 2. Every employee call to his children in descending order of c[i], where c[i] is the number of descendants of the ith vertex. I got WA on test 10. Edited by author 26.10.2006 17:17 Sergey A. Weiss Re: some hint [1] // Problem 1362. Classmates 2 5 Jun 2007 20:07 Your idea about making Tanya a root is very good. I've used it and got AC. (Thank you! :-)) But second point of your idea is definitely wrong. Analyse the following test and you'll get your AC: 14 2 9 0 3 4 0 5 6 0 7 8 0 0 0 0 0 10 0 11 0 12 0 13 0 14 0 0 1 Piratek-(akaDK) Re: some hint // Problem 1362. Classmates 2 8 Jul 2008 15:45 Answer 6, My Algo give. I use Greedy Heap + BFS. WA10. First idea - Tanya Root, second Idea - when we count i- root time we use best times of his sons in the descending order. I think it correct but mistake&! l@mho No subject // Problem 1362. Classmates 2 5 Oct 2007 15:58 some tests please!!!!!!!!! {AESC USU} Evgeny Kurpilyanskij please. Help me!! I have WA#4 // Problem 1362. Classmates 2 12 Mar 2007 18:21 I think my algo is right(DP) but I have WA#4. Anyone gives me some tests or hint. P.S. Sorry my English. vgu What the ....??? // Problem 1362. Classmates 2 7 Oct 2005 15:29 Is Tanya calling her Boss at first or not??? mahbubul HOW TO SOLVE IT? [1] // Problem 1362. Classmates 2 27 Apr 2005 01:20 ANY CLUE? Dilyan Re: HOW TO SOLVE IT? // Problem 1362. Classmates 2 17 Jul 2005 21:11 use dp from HELL TIME LIMIT AT 17 test // Problem 1362. Classmates 2 27 Apr 2005 22:15 I do the best I can to avoid this time limit --> but I can't Tell me what shall I do ????
|