Common Board| Show all threads Hide all threads Show all messages Hide all messages | | WA35 | 👑TIMOFEY👑`~ | 1393. Average Common Prefix | 8 Feb 2025 15:16 | 1 | WA35 👑TIMOFEY👑`~ 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 | | hint plz | sailingoat | 2178. Vadim and Sudoku: Renban | 8 Feb 2025 08:06 | 1 | | | WA #8 | dmitrmax | 1018. Binary Apple Tree | 5 Feb 2025 14:36 | 2 | WA #8 dmitrmax 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... 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 | | avoid tle | 👑TIMOFEY👑`~ | 2110. Remove or Maximize | 4 Feb 2025 20:36 | 1 | add the time cutoff to speed up | | My solution finally accepted! Some tests for your help | magicdranton | 1011. Conductors | 2 Feb 2025 20:25 | 2 | 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 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. | | Little hint | Hououin`~`Kyouma | 2150. 4B and Zoo | 30 Jan 2025 19:15 | 1 | Random is not needed, just think about the bruteforce and the moments when you can't find a pair or three for a student. | | Aho Carasick | sailingoat | 1269. Obscene Words Filter | 29 Jan 2025 22:36 | 1 | if MLE, avoid next[100001][256] and use a "flatmap" datastructure instead. (just store key-value pairs in dynamic array) | | If you have WA12 | Denis Koshman | 1269. Obscene Words Filter | 29 Jan 2025 22:34 | 2 | Try this test: 2 abc b 1 abc Correct answer: 1 1 | | Wa 26 | Hououin`~`Kyouma | 2192. My Grandfather | 29 Jan 2025 15:11 | 1 | Wa 26 Hououin`~`Kyouma 29 Jan 2025 15:11 | | Hint for WA12 | denxxjkee | 1074. Very Short Problem | 28 Jan 2025 22:38 | 2 | For WA12 try this: 9126492316491641269352615215701236589213658621356281376589216562319562396592381659862195621281E-190 100 # Output must be: 0.0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009126 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" | | Пояснение по условию | Роман Спиркин | 1820. Ural Steaks | 28 Jan 2025 21:34 | 3 | Не совсем понял тестовый пример 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 Представь вот мы сначала жарим две котлеты с одной стороны, первую меняем на третью, а вторую переворачиваем. Жарим еще минуту и теперь у нас есть одна готовая котлета и две наполовину готовые, и дожариваем их еще минуту. Вот и получается всего три минуты. | | Wa 4 | Hououin`~`Kyouma | 2183. Good Mood | 28 Jan 2025 21:19 | 3 | Wa 4 Hououin`~`Kyouma 27 Jan 2025 12:32 Re: Wa 4 Combatcook [YarSU] 🐸 27 Jan 2025 19:06 "It is guaranteed that there exists at least one a_i < 0" So your test is incorrect Re: Wa 4 Hououin`~`Kyouma 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 | | Wrong tests? | andreyDagger`~ | 2181. Student, or There and Back Again | 28 Jan 2025 19:01 | 6 | It seems like in test 7 n=300, m=300, k=0. Answer is obviously 709227659, but it gives WA. 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). 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 Admins, any decision about this problem? Is test 7 correct? 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 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 | | TO ADMINS | andreyDagger`~ | 1000. A+B Problem | 26 Jan 2025 15:07 | 3 | 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"; } 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. 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 | | To Admins: Please, update Go(lang) compiler! | Aleksei Chernenkov | | 26 Jan 2025 11:32 | 1 | 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 | | Think simpler | sailingoat | 2199. Company Question | 24 Jan 2025 19:32 | 1 | Persistent segment tree is NOT NEEDED! | | Help WA44 | sailingoat | 2199. Company Question | 24 Jan 2025 19:04 | 1 | | | To admins: extending Python guide | Yury_Semenov | | 24 Jan 2025 05:13 | 2 | 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. Thanks for pointing this out. I added this information to the Guide. | | To admins: Weak tests in problem 1514 | ixiolirion | 1514. National Park | 22 Jan 2025 05:08 | 2 | 8 0 0 10 0 5 10 15 10 16 11 166674 0 166675 10 1000000 0 My ACed program gives 32.3606797749979, but it should be 22.459574579560357. Your test added. 4 authors lost accepted solutions after the rejudge. Thanks! | | No tests when commission rate = 100? | v3n1v1c11v1c1 | 1283. Dwarf | 22 Jan 2025 04:44 | 2 | My two programs produce different results when initial gold > bad gold and commission rate is 100. 1. 10816824 2. 10816938 In fact, the commission rate is never 100 in the tests. I changed the problem statements to reflect that. I decided not to add such tests because it would affect a significant number of accepted solutions with a particular algorithm where this matters, while the solutions using other algorithms would stay unaffected. |
|
|