| ENG RUS | Timus Online Judge |
Общий форумМихаил WA13 [1] // Задача 2141. Саша Вилкин 30 окт 2019 13:02 Give some tests, please Dmitri Belous Re: WA13 // Задача 2141. Саша Вилкин 18 авг 2021 14:56 I hope, the following will help. I've found it using a random generator and a brute force checker. 7 2 -5 -4 -1 -1 -5 5 Answer: 13 198808xc To admin: please fix the problem statement. [1] // Задача 1544. Одноклассники 3 11 окт 2010 00:25 In this problem, all the operations should be done on the SAME computer, but I could NOT understand this from the statement, until I read the forum. This problem is quite easy: simple bruteforce could AC in short time, but I think this bug in statement have made this problem SEEMS hard (only 100+ ACed now). Please, fix it. Walker Re: To admin: please fix the problem statement. // Задача 1544. Одноклассники 3 18 авг 2021 06:36 I think you can do on every computers.But doing on the same computer is the best solution. Maybe. Sorry my bad English.:) Furkat Ahrolov WA #38 // Задача 2102. Миша и криптография 15 авг 2021 16:40 Не подскажете 38-тест? andreyDagger`~ Stupid mistake // Задача 1348. Пусти козла в огород 2 15 авг 2021 11:04 Damn, i used min(xa, xb) <= x_h <= max(xa, xb) and got WA5, then I wrote min(xa, xb) <= x_h && x_h <= max(xa, xb) and got AC springWaltz Nice problem [1] // Задача 1037. Управление памятью 11 авг 2021 23:27 Similar to page scheduling. Used two sets to simulate the process. :) Brian Re: Nice problem // Задача 1037. Управление памятью 14 авг 2021 21:17 NICE VERY NICE springWaltz What is test 9? // Задача 1058. Шоколад 13 авг 2021 17:35 Getting WA #9. My solution is bruteforce after dividing the lines Kurpilyansky Eugene (USU) Help me! I got WA#3 [3] // Задача 1337. Бюрократия 22 окт 2006 12:04 give me some tests thanks. Kurpilyansky Eugene (USU) Re: Help me! I got WA#3 [2] // Задача 1337. Бюрократия 22 окт 2006 12:12 INPUT 1 2 1 0 1 1 0 1 0 OUTPUT 0 is correct? Alex Fetisov Re: Help me! I got WA#3 // Задача 1337. Бюрократия 22 окт 2006 20:41 My AC program says 0 is correct!) Walker Re: Help me! I got WA#3 // Задача 1337. Бюрократия 13 авг 2021 07:18 3Q,I got AC. LaVuna [KHNURE] Simple hint about solution. Make sure you spend at least 3 days on your solution, before seeing this. // Задача 1301. Кубик в лабиринте 13 авг 2021 02:36 The problem can be solved using brute force solution andreyDagger`~ SPOILER. Hint // Задача 1794. Шедевры мировой архитектуры 12 авг 2021 22:37 Make difference array, where dif[i] = i - a[i] eusebiuu If you have WA or TLE on #8 // Задача 1156. Два тура 12 авг 2021 16:40 Try 7 10 1 2 1 3 1 4 5 6 5 7 8 9 8 10 8 11 12 13 12 14 This test changed my solution totally. Hope it helps you:) Al.Cash a question [3] // Задача 1199. Мышка 30 июл 2007 14:58 Can the mouse go under the furniture? I mean, can it's way cross the polygons? Chmel_Tolstiy Re: a question // Задача 1199. Мышка 30 июл 2007 15:10 I didn't solve it. But I think mouse CAN'T cross the polygon. hedrok <ONPU> Odesa Re: a question // Задача 1199. Мышка 22 сен 2009 14:51 If i think that mouse can go under furniture get WA3. If can't, get WA10 at the moment. So probably mouse can't go under furniture. Walker Re: a question // Задача 1199. Мышка 12 авг 2021 06:42 I think it can't. I got WA3 if it can go under the furniture. But I got AC if it can't. Sorry,my English is very bad. andreyDagger`~ Another approach // Задача 1134. Карты 11 авг 2021 18:10 Actually, you can solve it as a graph problem, where numbers 0, 1, ..., n are vertices, which connected like: 0-1, 1-2, ... Zergatul What is correct approach to this problem? // Задача 2127. Определитель графа 9 авг 2021 19:16 I was able to solve it just by computing matrix determinant. Nothing to do with graphs, just taking advantage of matrix sparsity. eusebiuu Some help if you have WA // Задача 1513. Басня о лимоне 8 авг 2021 13:09 WA #3: 1 1 -> 2 WA #5: 2 1 -> 3 WA #7: 5 3 -> 29 WA #8: 6 5 -> 63 WA #9: 5 1 -> 13 Otrebus WA 2 // Задача 1062. Триатлон 7 авг 2021 23:03 This is the case of a particularly small competition! Norbert Nolte starting point a is a station but you go by feet [3] // Задача 1205. На метро или пешком? 8 мар 2013 12:30 If the starting point A is a station but you go by feet, is the station a visited station. For example, what is the solution for the following: 100 101 3 0 0 0 10 1 0 1 2 2 3 0 0 0 0 1 0 Sirko Re: starting point a is a station but you go by feet [1] // Задача 1205. На метро или пешком? 27 мар 2015 22:41 0.0100000 0 Chan Re: starting point a is a station but you go by feet // Задача 1205. На метро или пешком? 14 сен 2015 09:12 0.0100000 1 Walker Re: starting point a is a station but you go by feet // Задача 1205. На метро или пешком? 7 авг 2021 07:43 3Q,I got AC. gaporf If you have TL [2] // Задача 1198. Коррупция 10 окт 2017 23:08 If you have TL on test 21, 49 or 50 you should use gets. I get AC with 0.3 s. PrankMaN Re: If you have TL // Задача 1198. Коррупция 14 июн 2020 20:57 I was getting TL21, but once I've added "ios_base::sync_with_stdio(false)", I got AC Walker Re: If you have TL // Задача 1198. Коррупция 7 авг 2021 06:15 thanks so much. Varduhi Yeghiazaryan WA5. Can anyone help me? [3] // Задача 1096. Таблички с номерами маршрутов 13 сен 2010 22:11 Can you give me any hint or any tests? Thanks in advance. Phan Hoai Nam Re: WA5. Can anyone help me? // Задача 1096. Таблички с номерами маршрутов 3 окт 2010 11:23 I also WA5. When I consider K > 1000, I got AC. Varun Sharma Re: WA5. Can anyone help me? [1] // Задача 1096. Таблички с номерами маршрутов 29 ноя 2010 13:21 The graph is directed i.e. 8 is connected to 5 but 5 is not connected to 8. So that means if the input is 1 8 5 8 5 6 then the answer will be impossible. Edited by author 30.11.2010 02:14 Walker Re: WA5. Can anyone help me? // Задача 1096. Таблички с номерами маршрутов 6 авг 2021 05:29 3Q. Olzhas2dy For those who dont know how to solve it [7] // Задача 1102. Странный диалог 12 июн 2007 19:47 Well, here are some hints: 1. Use DFA. If you do'nt know what it is, visit this page http://en.wikipedia.org/wiki/Deterministic_finite_automaton (pay attention to the table of states) 2. use getc() instead of cin>>ch or cin.getch() or whatever you use (for C++/C only) 3. Try this: 3 outputoutputinputon inputone Edited by author 13.06.2007 17:36 Boris Strandjev Re: For those who dont know how to solve it // Задача 1102. Странный диалог 19 окт 2007 19:47 I would recommend using gets() for all that want to have the whole string at once. It still is fast enough and does not time limit. Entheogen Re: For those who dont know how to solve it [2] // Задача 1102. Странный диалог 14 ноя 2007 05:12 How exactly do you use DFS for this? Can you provide an example of some other problem similar to this which is solvable by DFS? Thank you. Romko [Lviv NU] Re: For those who dont know how to solve it [1] // Задача 1102. Странный диалог 14 ноя 2007 17:52 It's Not DFS problem!!!!! It's DFA(Deterministic finite automaton) problem! Sergey Kazakov Re: For those who dont know how to solve it // Задача 1102. Странный диалог 18 апр 2008 21:08 I solved it with DFS in 0.453 sec. PersonalJesus Re: For those who dont know how to solve it [2] // Задача 1102. Странный диалог 24 июн 2008 21:06 When I was using STL, I always had TL on the first test but I was sure that this is the correct algo. Then I replaced all STL's strings with array of chars and I got ACC 0.078 . OMGWTF ?! Nikita Mogilevets Re: For those who dont know how to solve it [1] // Задача 1102. Странный диалог 11 май 2017 16:41 First test is really large. Something of order 1e6. springWaltz Re: For those who dont know how to solve it // Задача 1102. Странный диалог 5 авг 2021 21:55 Its a simple substring search problem. mdebvisitor@mail.ru WA 7??? // Задача 1118. Нетривиальные числа 4 авг 2021 15:17 I have WA on test 7. What i need to do?
|