| ENG RUS | Timus Online Judge |
Общий форум👑TIMOFEY👑 TLE3 // Задача 1468. Дробь 26 авг 2023 15:28 try to remove all the crutches that you wrote in your code, which are very convenient, but at the same time only slow down your code 👑TIMOFEY👑 WA2 // Задача 1468. Дробь 26 авг 2023 15:27 do not be smart in the code, do not add many characters at once, try to think step by step 👑TIMOFEY👑 TLE 10 // Задача 1486. Одинаковые квадраты 26 авг 2023 08:45 use sort instead of map or unordered_map, its around 10 times faster iceswanX AC at last! [4] // Задача 1033. Лабиринт 3 мар 2005 09:05 i got WA because i don't realize that from the upper left to the bottom right there is no guarantee that they are connected. Daniel Re: AC at last! [3] // Задача 1033. Лабиринт 29 дек 2005 19:04 I also got WA because of it. I thought that upper left is entrance and bottom right is exit! AlainDelon Re: AC at last! // Задача 1033. Лабиринт 2 дек 2007 20:12 Oh, god! You guys are so smart! I ran into the same trap and got AC following your hints. Thanks a lot! Я крыса которая съест тебя! Re: AC at last! [1] // Задача 1033. Лабиринт 16 дек 2007 01:02 Yeah I thought same thing! waccub@gmail.com Re: AC at last! // Задача 1033. Лабиринт 24 авг 2023 14:22 I also had the same problem, 2 entrance one is upper left, one is lower right, both are open and no wall, :) (after spending more than 4 hour!) vnikulin I have a test and an AC (greedy) program, that gives WA on my test [5] // Задача 1182. Team Them Up! 28 окт 2005 18:57 Sorry, the test is not small. Now I will give a description of the test. There 5 groups with sizes: (6 1) (5 1) (4 1) (4 1) (4 1). The right answer for this test is 14:14. But the greedy program gives 15:13. I think moderators shall add this test to the test data and many solutions will be rejected. 28 21 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 2 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 2 3 4 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 2 3 4 5 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 22 1 2 3 4 5 6 7 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 9 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 9 10 11 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 23 1 2 3 4 5 6 7 8 9 10 11 12 13 19 20 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 16 17 18 19 20 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 15 17 18 19 20 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 15 16 18 19 20 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 15 16 17 19 20 21 22 23 24 25 26 27 28 0 23 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 24 25 26 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 21 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 22 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 23 24 25 26 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 22 24 25 26 27 28 0 23 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 26 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 27 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 28 0 26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 0 vnikulin Re: I have a test and an AC (greedy) program, that gives WA on my test [2] // Задача 1182. Team Them Up! 30 окт 2005 17:11 up vnikulin Re: I have a test and an AC (greedy) program, that gives WA on my test [1] // Задача 1182. Team Them Up! 12 ноя 2005 18:28 Do judges want to break greedy wrong solutions? Or it is OK that they are accepted? It is strange, that NEERC problem has poor set of tests. Vladimir Yakovlev (USU) Testset won't be altered (-) // Задача 1182. Team Them Up! 13 ноя 2005 00:38 lallala Re: I have a test and an AC (greedy) program, that gives WA on my test [1] // Задача 1182. Team Them Up! 19 фев 2016 19:37 DO NOT MISLEAD OTHERS WITH YOUR WRONG SAMPLE!!! MY AC program says NO SOLUTION! take care of the following nodes 1st group: 1 8 14 19 24! 26 2nd group: 2 3 4 5 6 7 9 10 11 12 13 15 16 17 18 20 21 22 23 24! 25 27 28 when you start deducting from 24 to other non connected with 24 nodes and so on, you will get a contradiction. Mortus Re: I have a test and an AC (greedy) program, that gives WA on my test // Задача 1182. Team Them Up! 22 авг 2023 20:06 My AC prog says 14 24 19 14 9 10 11 12 13 2 3 4 5 6 7 14 1 8 15 16 17 18 20 21 22 23 25 26 27 28 yamininja19 If you are confused about problem description, there are 2 extra clarifications // Задача 1876. Утро сороконожки 22 авг 2023 07:37 1. Centipede waking up from wrong side of bed doesn't matter in this problem. Since the centipede gets the slippers randomly, the problem is asking about the worst case which results in the most time taken. 2. If the centipede finishes all the left slippers, i.e. 40 of them , there are still a-40 left slippers present under the bed. The problem doesn't even mention that after wearing 40 left slippers, these a-40 left slippers will also be thrown taking 2 seconds. Throwing is only mentioned for right slippers. Edited by author 22.08.2023 07:39 Edited by author 22.08.2023 07:42 👑TIMOFEY👑 WA 4, WA 7, WA 13 // Задача 2171. Две прогрессии 2 21 авг 2023 22:03 15 2 1 3 5 2 15 2 4 1 5 1 65 2 42 12 54 69 I think you have problems in formulas, I advise you to carefully read the articles with the theory Edited by author 21.08.2023 22:05 Edited by author 21.08.2023 22:05 👑TIMOFEY👑 TLE 42 // Задача 2171. Две прогрессии 2 21 авг 2023 22:02 Use BINARY SEARCH, AFTER THIS TEST I GOT AC I'M SO GLAD, I'M JUST IN SHOCK. I hope all my tests will help you, I find this task very useful for number theory 👑TIMOFEY👑 WA 39 // Задача 2171. Две прогрессии 2 21 авг 2023 21:58 if you have two progressions, one of which is with a very large step, then you can walk from the beginning of one progression to the beginning of the other 👑TIMOFEY👑 WA 39 // Задача 2171. Две прогрессии 2 21 авг 2023 21:58 if you have two progressions, one of which is with a very large step, then you can walk from the beginning of one progression to the beginning of the other 👑TIMOFEY👑 TLE 38 // Задача 2171. Две прогрессии 2 21 авг 2023 20:46 dont use int128 Ramkrushna Pradhan Why Restricted Function ???????????!!!!!!!!!!!!!!!!!!!!! [1] // Задача 1837. Число Исенбаева 25 янв 2015 22:33 This codes gives correct output in my system but submitting it shows Restricted Function. Plz help... ************************************** import Queue graph={} dic={} to_explore=Queue.Queue() def BFS(root): dic[root]=0 to_explore.put(root) while not to_explore.empty(): tmp=to_explore.get() for i in graph[tmp]: if i not in dic: dic[i]=dic[tmp]+1 to_explore.put(i) n=input() while n: s=raw_input().split() for i in s: if i not in graph: graph[i]=[] for j in s: if j!=i: if j not in graph[i]: graph[i].append(j) else: for j in s: if j!=i: if j not in graph[i]: graph[i].append(j) n-=1 if 'Isenbaev' in graph: BFS('Isenbaev') for i in graph: if i not in dic: dic[i]='undefined' for i in sorted(dic): print i,dic[i] else: for i in sorted(graph): print i,"undefined" VadimBan Re: Why Restricted Function ???????????!!!!!!!!!!!!!!!!!!!!! // Задача 1837. Число Исенбаева 20 авг 2023 18:31 Don`t the queue module starts with lowercase letter? Looks like: from queue(module) import Queue(function) Actually, I have pretty similar code and always have runtime error on the very first test Edited by author 20.08.2023 18:32 Edited by author 20.08.2023 18:32 Keworker Hint (understand problem correctly) // Задача 1128. Деление на группы 19 авг 2023 12:27 The graph is not oriented graph. It makes solution easier. Edited by author 19.08.2023 12:29 Birne Ageev [USU] (Psych up club) What about light velocity? :D [1] // Задача 1475. Курочка-Ряба 17 ноя 2012 01:45 Can be velocity lager than c? Ade Re: What about light velocity? :D // Задача 1475. Курочка-Ряба 19 авг 2023 10:42 Good Point! LoL 👑TIMOFEY👑 easy bfs // Задача 1437. ACM для ГСМ 18 авг 2023 22:39 👑TIMOFEY👑 TLE 4 // Задача 1189. Pairs of Integers 16 авг 2023 21:26 Try to think in terms of mathematics, trying to make accurate judgments theAyconic1 Hint about complexity // Задача 1935. Слёзы утопленников 16 авг 2023 19:06 O(n) solution exists Hikmat Ahmedov Still WA #11 ? [3] // Задача 1930. Машина инженера Ивана 26 янв 2013 00:38 This test helped me to find my bug. I modified dijkstra algo and added direction array. 9 12 7 3 9 3 9 2 1 2 1 3 4 7 4 1 5 1 4 8 5 8 6 5 2 6 1 8 Answer:0 Edited by author 31.01.2013 17:37 raven Re: Still WA #11 ? // Задача 1930. Машина инженера Ивана 4 авг 2013 20:04 Thank you Akshat Shah Re: Still WA #11 ? [1] // Задача 1930. Машина инженера Ивана 5 май 2020 22:28 Thanks a lot! I was maintaining an array how[], which was storing how to get at that node (uphill mode or downhill node). But that failed Test case #11. I modified the code such that I start Dijkstra's algorithm at the destination node (Orlov's city) as the source node and Ivan's city as the target node. I actually interchanged source with end. So now I think my how[] array stores how one should get here. And it passed all test cases! Does this work because we have no limitation on how to start, but rather how we end makes more impact on the solution? I cannot derive a formal proof. Any comments are welcome Mac Phuc Khang Re: Still WA #11 ? // Задача 1930. Машина инженера Ивана 16 авг 2023 16:30 You have to use 2d array to have 2 min costs from s to t with 2 states 0 (up) and 1 (down) (dis[u][0], dis[u][1]), if you just you 1d array and AC, it must be lucky. This is my AC code run in 0.031s: ((const) inf = 1e9, (define) ep = emplace (= push/insert), (define) eb = emplace_back (= push_back), ep and eb both are faster than push and push_back, emplace_front/emplace/emplace_back = push_front/(push/insert)/push_back but faster because it doesn't copy then moves value into array, it pushes directly into array) #pragma GCC optimize( "Ofast" ) #pragma GCC target( "avx2", "sse4.2", "abm", "bmi", "bmi2", "fma", "mmx", "popcnt", "lzcnt" ) #include <bits/stdc++.h> #define endl '\n' #define inf 1e18 #define int long long #define pii pair <int, int> #define vii vector <pii> #define tiii tuple <int, int, int> #define viii vector <tiii> #define ep emplace #define eb emplace_back using namespace std; const int MaxN = 1e4 + 10; int n, m, s, t, f[MaxN][2]; vii a[MaxN]; priority_queue <tiii, viii, greater <tiii>> pq; signed main() { cin.tie(0) -> sync_with_stdio(0); __builtin_ia32_ldmxcsr ( 40896 ); fill(&f[0][0], &f[0][0] + sizeof(f) / sizeof(f[0][0]), inf); cin >> n >> m; for (int u, v, i = 1; i <= m; ++i) { cin >> u >> v; a[u].eb(v, 0); a[v].eb(u, 1); } cin >> s >> t; f[s][0] = f[s][1] = 0; pq.ep(f[s][0], s, 0); pq.ep(f[s][1], s, 1); while (!pq.empty()) { auto [x, u, y] = pq.top(); pq.pop(); if (x > f[u][y]) continue; if (u == t) break; for (auto [v, z] : a[u]) { int w = f[u][y] + (y != z); if (f[v][z] > w) pq.ep(f[v][z] = w, v, z); } } cout << min(f[t][0], f[t][1]) << endl; } if you have any question, you can ask me :)) Vedernikoff 'Goryinyich' Sergey (HSE: АОП) Just disgusting problem statements wording // Задача 2165. Обер-форшнейдер 16 авг 2023 00:11 I'm native Russian language speaker, but I really cannot understand what is required in the problem: "Поскольку Вадим не любит сладкое, в конце он выберет себе самый маленький по площади кусочек, однако он не хочет, чтобы кто-то это заметил. Для этого современному обер-форшнейдеру нужно подобрать такой способ элегантно разделить торт, чтобы часть, которая достанется ему, была наибольшего размера." He doesn't like sweets, so he takes part of minimal size, but he wants to maximize size at the same time. WTF, where is the logic here, what does author want from us - to find maximin over all cuts, or something else? autonomous If you get WA 2 // Задача 1149. Танцы синуса 15 авг 2023 15:07 My program worked correctly on N in 1 to 9, and incorrectly on numbers greater than 9 (error in string concatenation). I kept getting an error on test 2 until I fixed the error. Apparently, in test 2, the input is a number greater than 10. Try this test: in: 11 out: ((((((((((sin(1)+11)sin(1-sin(2))+10)sin(1-sin(2+sin(3)))+9)sin(1-sin(2+sin(3-sin(4))))+8)sin(1-sin(2+sin(3-sin(4+sin(5)))))+7)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6))))))+6)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7)))))))+5)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8))))))))+4)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8+sin(9)))))))))+3)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8+sin(9-sin(10))))))))))+2)sin(1-sin(2+sin(3-sin(4+sin(5-sin(6+sin(7-sin(8+sin(9-sin(10+sin(11)))))))))))+1
|