| ENG RUS | Timus Online Judge |
Common Boardnotenough I solved :) // Problem 1086. Cryptography 12 Feb 2025 11:23 Time: 0.001 Algorithm: Sieve 👑TIMOFEY👑`~ RE1 g++, AC clang [1] // Problem 1451. Beerhouse Tale 4 Feb 2025 16:45 has anyone encountered the same problem? andreyDagger`~ Re: RE1 g++, AC clang // Problem 1451. Beerhouse Tale 10 Feb 2025 12:51 I had the same problem with long doubles on GCC. https://acm.timus.ru/forum/thread.aspx?id=46508&upd=638540218907482393 👑TIMOFEY👑`~ WA35 // Problem 1393. Average Common Prefix 8 Feb 2025 15:16 if you use suff array, him maybe dont work without adding special sym in the end, because some suff have equal length and then if they equal, they can go in random order, this critical for kasai algorithm sailingoat hint plz // Problem 2178. Vadim and Sudoku: Renban 8 Feb 2025 08:06 so hard dmitrmax WA #8 [1] // Problem 1018. Binary Apple Tree 17 May 2021 10:38 Any thoughts whats in test #8? Solution passes all the tests here on forum and a lot of my tests. Just can't figure out what is wrong... vinipuhi try this // Problem 1018. Binary Apple Tree 5 Feb 2025 14:36 9 5 5 6 21 2 4 21 7 5 20 3 1 10 1 2 1 2 5 1 4 8 22 4 9 23 Ans 77 👑TIMOFEY👑`~ avoid tle // Problem 2110. Remove or Maximize 4 Feb 2025 20:36 add the time cutoff to speed up magicdranton My solution finally accepted! Some tests for your help [1] // Problem 1011. Conductors 8 Feb 2023 14:47 50 50.1 Answer: 501 10 20 Answer: 6 0.05 5.02 Answer: 20 0.05 5 Answer: 21 99.98 99.99 Answer: 5001 25 50 Answer: 3 13 14.1 Answer: 15 92 93.4 Answer: 13 30.2 50.01 Answer: 2 0.01 0.02 Answer: 5001 45.55 45.56 Answer: 90 49.09 50.01 Answer: 2 0.01 99.99 Answer: 2 0.29 0.3 Answer: 334 60 70 Answer: 3 Edited by author 08.02.2023 14:48 Dmi3Molodov Re: My solution finally accepted! Some tests for your help // Problem 1011. Conductors 2 Feb 2025 20:25 Some tests (only in large cities): 5001{ 0.01, 0.02},{49.99,50.00},{50.00,50.01},{99.98,99.99} 3334{ 0.01, 0.03},{99.97,99.99} 2503{25.00,25.01},{33.32,33.33},{66.67,66.68},{74.99,75.00} 2501{ 0.01, 0.04},{24.99,25.00},{49.98,50.00},{50.00,50.02}, {75.00,75.01},{99.96,99.99} 2004{20.00,20.01},{79.99,80.00} 2003{33.34,33.35},{39.99,40.00},{60.00,60.01},{66.65,66.66} 2002{40.00,40.01},{59.99,60.00} 2001{ 0.01, 0.05},{19.99,20.00},{80.00,80.01},{99.95,99.99} 1667{ 0.01, 0.06},{49.97,50.00},{50.00,50.03},{99.94,99.99} 1429{ 0.01, 0.07},{33.31,33.33},{66.67,66.69},{99.93,99.99} 1257{12.49,12.50},{28.56,28.57},{71.43,71.44},{87.50,87.51} 1255{12.50,12.51},{87.49,87.50} 1253{16.67,16.68},{24.98,25.00},{33.34,33.36},{37.50,37.51}, {62.49,62.50},{66.64,66.66},{75.00,75.02},{83.32,83.33} 1251{ 0.01, 0.08},{25.00,25.02},{37.49,37.50},{49.96,50.00}, {50.00,50.04},{62.50,62.51},{74.98,75.00},{99.92,99.99} 1115{42.86,42.87},{57.13,57.14} 1112{ 0.01, 0.09},{99.91,99.99} 1009{10.00,10.01},{11.10,11.11},{88.89,88.90},{89.99,90.00} 1007{14.29,14.30},{29.99,30.00},{70.00,70.01},{85.70,85.71} 1004{20.00,20.02},{79.98,80.00} The answers may be incorrect. Hououin`~`Kyouma Little hint // Problem 2150. 4B and Zoo 30 Jan 2025 19:15 Random is not needed, just think about the bruteforce and the moments when you can't find a pair or three for a student. sailingoat Aho Carasick // Problem 1269. Obscene Words Filter 29 Jan 2025 22:36 if MLE, avoid next[100001][256] and use a "flatmap" datastructure instead. (just store key-value pairs in dynamic array) Denis Koshman If you have WA12 [1] // Problem 1269. Obscene Words Filter 25 Aug 2008 19:08 Try this test: 2 abc b 1 abc Correct answer: 1 1 sailingoat Re: If you have WA12 // Problem 1269. Obscene Words Filter 29 Jan 2025 22:34 THANK YOU SO MUCH ! ! !! Hououin`~`Kyouma Wa 26 // Problem 2192. My Grandfather 29 Jan 2025 15:11 Compare in integers denxxjkee Hint for WA12 [1] // Problem 1074. Very Short Problem 1 May 2024 20:18 For WA12 try this: 9126492316491641269352615215701236589213658621356281376589216562319562396592381659862195621281E-190 100 # Output must be: 0.0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009126 Combatcook [YarSU] 🐸 Re: Hint for WA12 // Problem 1074. Very Short Problem 28 Jan 2025 22:38 Let me add some tests too: 1+ 1 -10.0- 1 My prog passed all tests from topics below but failed these. Output obviously must be "Not a floating point number" Роман Спиркин Пояснение по условию [2] // Problem 1820. Ural Steaks 11 Jun 2023 16:55 Не совсем понял тестовый пример 3 2 то есть 3 котлеты и можно максимум 2 котлеты жарить в моменте вначале положим 2 котлеты с одной стороны потом эти же с другой стороны потом остается 1 котлета мы ее можем пожарить с одной стороны это 1 минута и ее же с другой то есть на нее необходимо 2 минуты значит всего необходимо 4 минуты почему ответ 3 ? как так пожарить Edited by author 11.06.2023 16:57 Edited by author 11.06.2023 16:57 WArden Re: Пояснение по условию [1] // Problem 1820. Ural Steaks 22 Jul 2023 17:07 Представь вот мы сначала жарим две котлеты с одной стороны, первую меняем на третью, а вторую переворачиваем. Жарим еще минуту и теперь у нас есть одна готовая котлета и две наполовину готовые, и дожариваем их еще минуту. Вот и получается всего три минуты. Sasha Re: Пояснение по условию // Problem 1820. Ural Steaks 28 Jan 2025 21:34 Ты нереально крут!!!!!! Hououin`~`Kyouma Wa 4 [2] // Problem 2183. Good Mood 27 Jan 2025 12:32 Input: 1 1 Ans: -1 Combatcook [YarSU] 🐸 Re: Wa 4 [1] // Problem 2183. Good Mood 27 Jan 2025 19:06 "It is guaranteed that there exists at least one a_i < 0" So your test is incorrect Hououin`~`Kyouma Re: Wa 4 // Problem 2183. Good Mood 28 Jan 2025 21:19 You're right. When solving this problem, I made the mistake of not selecting a segment at all and this test helped to find bug. I hope this helps someone. Edited by author 28.01.2025 21:20 andreyDagger`~ Wrong tests? [5] // Problem 2181. Student, or There and Back Again 19 Jan 2025 20:37 It seems like in test 7 n=300, m=300, k=0. Answer is obviously 709227659, but it gives WA. Oleg Vasilenko (Chelyabinsk) Re: Wrong tests? [2] // Problem 2181. Student, or There and Back Again 20 Jan 2025 21:45 I also got answer 709227659 to this testcase. Yes, seems like incorrect tests or incorrect problem statement. Admins, please look at this issue. At least please check test 7. Also please, clarify order of N and M values in input data (if they go in M,N order then correct statement please). P.S. Also the problem is not so difficult as described in post-contest jury solutions. If problem statement is correct, it has got simple O(N*M) dp solution (based on https://en.wikipedia.org/wiki/Lindstr%C3%B6m%E2%80%93Gessel%E2%80%93Viennot_lemma principle). andreyDagger`~ Re: Wrong tests? [1] // Problem 2181. Student, or There and Back Again 21 Jan 2025 02:51 Yeah, jury solution is complicated. Mine solution is a bit different, but still straightforward O(N*M*(N+M)) dp, with simple O(1) transitions from each state Oleg Vasilenko (Chelyabinsk) Re: Wrong tests? // Problem 2181. Student, or There and Back Again 26 Jan 2025 09:18 Admins, any decision about this problem? Is test 7 correct? 🎧 Vadim Barinov \Frez_Fstilus/'``' :) Re: Wrong tests? [1] // Problem 2181. Student, or There and Back Again 28 Jan 2025 02:05 We fixed wrong tests. Original author miswrote 10^9+7 as 10000007 in his code, that generated incorrect tests. We sincerely apologize for such an error Edited by author 28.01.2025 02:06 Oleg Vasilenko (Chelyabinsk) Re: Wrong tests? // Problem 2181. Student, or There and Back Again 28 Jan 2025 19:01 Thanks a lot for solving the issue! Also, what about the original contest results ? ( https://timus.online/monitor.aspx?id=1568 ) Anybody now with correct tests has AC for problem M ? (suppose that such tests were on this contest too). Edited by author 28.01.2025 19:43 andreyDagger`~ TO ADMINS [2] // Problem 1000. A+B Problem 23 Dec 2024 15:22 Why is this code gives Runtime Error? I think it's not a problem to allow participants use exceptions, as long as they are not throwing it out of main: #include <iostream> int main() { int a, b; std::cin >> a >> b; try { throw std::exception(); } catch (...) {} std::cout << a + b << "\n"; } Vladimir Yakovlev (USU) Re: TO ADMINS [1] // Problem 1000. A+B Problem 24 Jan 2025 06:05 For some old C++ compilers it was impossible to determine whether the exception is caught or not. At the same time there are very little practical use cases for using exceptions in C++ solutions. So, there was no reason in trying to fix the issue. I don't know if the modern compilers already made it possible to determine. But even if they do I would still keep this feature disallowed because it takes reasonable effort to verify that a not so popular feature works properly on each new version of each of the C++ compilers. andreyDagger`~ Re: TO ADMINS // Problem 1000. A+B Problem 26 Jan 2025 15:07 Thanks for clarification. I was solving problem 1074 and thought it is a good idea to throw exception if parsing is failed somewhere in the depth of recursion. But yeah, this is the only problem from all of the archive where I wanted to use exceptions Aleksei Chernenkov To Admins: Please, update Go(lang) compiler! 26 Jan 2025 11:32 Hello! The latest update of compilers (in Jan 2024) missed Go(lang). Please, update it! Thank you very much! Edited by author 26.01.2025 11:33 sailingoat Think simpler // Problem 2199. Company Question 24 Jan 2025 19:32 Persistent segment tree is NOT NEEDED! sailingoat Help WA44 // Problem 2199. Company Question 24 Jan 2025 19:04 What is test 44? Yury_Semenov To admins: extending Python guide [1] 4 Dec 2024 17:58 Recent Python versions contain a dangerous pitfall for people who use Python for solving bigint problems: https://docs.python.org/3/library/stdtypes.html#int-max-str-digits In short, converting large integers to string raises an exception unless you explicitly raise the limit with sys.set_int_max_str_digits(1000000). Since Python is quite popular for bigint problems and this pitfall is very easy to miss, especially when you have an older version locally, I suggest mentioning it in the Python guide. Vladimir Yakovlev (USU) Re: To admins: extending Python guide 24 Jan 2025 05:13 Thanks for pointing this out. I added this information to the Guide.
|