|
|
Common BoardCheck your "strong connected components" code 89 2 12 apr 17 21 jun 2 8.4874959390 22.5720084367 ----- 15.7 3 1 apr 13 21 dec 8 12 oct 17 70.5459180884 19.4871801373 10.3882860539 ----- -71 3 25 feb 5 3 aug 15 6 oct 10 3.6840008337 0.0000000000 22.5788661148 ----- 13.5 6 1 jan 15 1 mar 15 1 may 15 1 jul 15 1 sep 15 1 nov 15 33.5814351330 41.8302148985 44.0959307671 47.1958719101 46.8042204476 34.9899114970 ----- * deleted * Edited by moderator 23.07.2022 20:33 We need a ranking for the least amount of code. I think It doesn't matter. Algorithm is important! Thanx a lot! I didn't know how to read all lines from console! Edited by author 17.07.2022 17:39 почему именно stable_sort? c++ простой sort нельзя? c++ Because bubble sort (described in "Notes" chapter) is stable можно, почему нет? Заходит на AC Thanks, with stable_sort everything works. 1 1 1 1 3 100 1 0 100 1 1 0 1 0 answer: 1 0 27 5 O-O-O-O-O-O-O O-O-O-O-O-O-O |\ \| | | |/| |\| | | |/ /| O-O O O O O O-O O O O O O-O |/ / /| |\ \| |/ /| |\ \ \| O-O-O-O-O-O-O O-O-O-O-O-O-O Answer: Just a picture Edited by author 20.06.2023 20:06 Anti-hash tests are added. Please choose mod = 2^64 and strange p in case of being hacked. Maybe you can find out why you are wrong in this test if you WA on 7. 3 4 aaaa aaaa aaaa answer: 3 1 1 1 2 (or other correct coordinates) sorry for my bad English by the way, use 123 and 1789 in hashing will pass. Why output is 2 , I think it should be 22 , because the worm started from the first sheet of vol 1 and goes until last sheet of vol 2 . so it's path is 10+1+1+10 = 22 No comments if "NO COMMENTS" why you write this? information - Zero You should know, that answer "No comments" is identical to "Read the problem statement" You could have written explanation or something instead of writing no comments. Its like making fun of the guy, like jewish do. Try to put two books in a bookshelf, and see the reason for no comments :D what answer will be for test like this: 10 1 3 1 zero? >what answer will be for test like this: >10 1 3 1 Answer is 34. No for the case 10 1 3 1 Answer is 12 No for the case 10 1 3 1 Answer is 12 No. You are wrong. My ACed solusion also gave 34. Even if you solve it by hand it is the same result. Because books are [from first ][][ to last] There are 4 symbols of [ and ] that are book covers. So, three books and 4 covers of the books that worm had gnawed. You seem to be an anti-Semite! Jewish are not guilty of your stupidity Are there no moderators here? Hateful comments should be instantly removed and the idiots who post them should be temporarily or permanently banned! Think of the reputation of this otherwise great site! Ok, the problem statement doesn't clarify that this book is an LTR language (left to right, e.g. English) book.Shuch a crucial info shouldn't be left to the assumptions of the reader. Предусмотрена ли функция удаления аккаунта? Каким образом это можно сделать? The following changes have been made to the problem: - The checking program strictly checks that the initial formatting is preserved, for example it rejects outputs with additional empty lines before or after the text. - Missing limitations added to the problem statements: - The words in the text to correct are no longer than 16 characters. - The lines in the text to correct are no longer than 80 characters. - The cumulative length of all lines doesn't exceed 10000 characters. - New tests have been added. - Time limit has been reduced to 0.5 sec. - All solutions have been rejudged. 44% of authors have lost their accepted solutions. 1. Input: 7122 2119 2. Input: 7122 2120 My AC program outputs next: > 1. Input: 7122 2119 Output: 4923 > 2. Input: 7122 2120 Output: 2501 > 1. Input: 7122 2119 5003 > 2. Input: 7122 2120 2501 > 1. Input: 7122 2119 5003 > 2. Input: 7122 2120 2501 I'm too ! List of posible solutions (I think) 7122 2119 Base 5003 12119 => 2119 Base 2966 21190 => 2119 Base 2965 21192 => 2119 Base 2964 21194 => 2119 Base 2963 21196 => 2119 Base 2962 21198 => 2119 (1) Base 423 16354 => 54 (2) Why 1 or 2 dont can be solutions?, there is something I am not seeing? Edited by author 08.07.2022 19:57 почему если сначала for k.. for (i=n-1; i >= 0; i--) inc() то ва12 а если for(i = n-1; i >=0; i--) for k... inc() то АС? надеюсь кто-нибудь понял.. Edited by author 08.07.2022 14:59 Can be solved using two DFS calls and tree rerooting in O(N) while maintaining a DP array where DP[node] = sum for all paths from node to all the nodes in its subtree (considering 1 as the initial root). Tree rerooting can be used to calculate the sum for all nodes. Why is there such a big difference between these two compilers and how do I know if I have solved this problem, it just feels like I wrote really dirty code and it somehow worked. i dont have any idea why wa5.. Edited by author 02.07.2022 22:06 g++ 9.2 - mle 7 visual c++ - AC 2 11 12 aaaa bb ccc ddddddddddd eeeeeeee ff jjjjj hhhh iiiii jjjjjjjjjj kk lll Correct answer: 4 2 11 10 aaaa bb ccc ddddddddddd eeeeeeee ff jjjjj hhhh iiiii jjjjjjjjjj Correct answer: 3 2 100 12 aaaa bb ccc ddddddddddd eeeeeeee ff jjjjj hhhh iiiii jjjjjjjjjj kk lll Correct answer: 1 1 11 12 aaaa bb ccc ddddddddddd eeeeeeee ff jjjjj hhhh iiiii jjjjjjjjjj kk lll Correct answer: 7 2 13 8 aaaa bb ccccc ddddddddddddd eeeeeeee ffff jjjjj hhhhhhh Correct answer: 2 1 1 1 a Correct answer: 1 I have correct answer at all tests, but i got WA #4 i have similar problem with the WA#4 anyone can help me??? If you have WA#4, then you didn't count last partially filled line. I have correct answer at all tests, but i got WA #5... Can anyone help me? try 2 3 4 aaa aaa aaa aaa CA-2 Before I found this testcasei got WA5 then i found my mistake with this test and got AC. Good luck! Thanks!I find my mistake in last test. Maybe it will help you, try this test: 3 6 5 aaaaaa bbb cc dddd ee Correct answer is 2, after recovering this mistake I get trought WA#4 |
|
|