| ENG RUS | Timus Online Judge |
Common Board~'Yamca`~ cool problem, but overrated // Problem 2195. Binary Trees 12 Mar 2025 20:16 Alice PLEASE_Python Time limit exceeded // Problem 1196. History Exam 11 Mar 2025 17:31 how can it be improved???? n = int(input()) sp = [] a = [] c = 0 for i in range(n): sp.append(int(input())) m = int(input()) for i in range(m): x = int(input()) if x in sp: c += 1 print(c) gooooooogol if a = 0 and b = 0?? [1] // Problem 1420. Integer-Valued Complex Division 8 Jun 2018 16:08 if a = 0 and b = 0 => r = 0 and q every complex number => count solation equation = infinity ~'Yamca`~ Re: if a = 0 and b = 0?? // Problem 1420. Integer-Valued Complex Division 11 Mar 2025 10:55 |0| >= |0| => answer 0 ~'Yamca`~ easy and overrated problem // Problem 1311. Stable Construction 11 Mar 2025 00:59 realy sm_programmer Is it possible to reset progress? [1] 14 Feb 2025 08:39 I would like to know if I can reset my progress here. I want to start afresh, but as I don't see a way to delete accounts, I thought that, at least, resetting my progress would be enough, but I can't do that either! Thanks in advance for your help! Edited by author 14.02.2025 08:40 Vladimir Yakovlev (USU) Re: Is it possible to reset progress? 10 Mar 2025 02:05 You can request deleting your account by writing an email to support 🦄imosk72🦄[GTGU] Strange statement // Problem 2181. Student, or There and Back Again 9 Mar 2025 16:50 > The student’s home is located at the coordinates (1, 1), and the university is at the coordinates (N, M). It means, for example, if N == 1 && M == 1 then university have same coordinates as home. Of course we can not use any roads in such case. But according to the sentence: > There are a total of N streets running from north to south and M streets running from west to east. there are some roads that can not be used. I think there should be N - 1 streets running from north to south and M - 1 streets running from west to east. Vlad correct code [2] // Problem 1639. Chocolate 2 7 Jan 2012 09:24 int main(){ int x, y; cin >> x >> y; if ((x*y-1)%2==1) cout << "[:=[first]"; else cout << "[second]=:]"; return 0; } Dastan Yelubayev Re: correct code // Problem 1639. Chocolate 2 29 Oct 2012 02:37 #include <iostream> using namespace std; int main () { int m,n; cin>>m>>n; if((m*n)%2==0)cout<<"[:=[first]"; else cout<<"[second]=:]"; return 0; } Vasilii Re: correct code // Problem 1639. Chocolate 2 8 Mar 2025 12:26 Why its correct? 👑TIMOFEY👑`~ easy bfs // Problem 1976. Game Optimization 7 Mar 2025 12:34 👑TIMOFEY👑`~ WA19 // Problem 1703. Robotic Arm 5 Mar 2025 16:43 set epsilon = 1e-9 ~'Yamca`~ WA 14 // Problem 1916. Titan Ruins: Waiting for Stability 4 Mar 2025 16:52 Don't use hash sailingoat hint? // Problem 2179. Need More Roads 2 Mar 2025 19:06 can I have hint, at addflash@dmc.chat Please gippotalamus Please ! Need help..my algoritm is wright, but ! WA9 [4] // Problem 1296. Hyperjump 15 Nov 2005 23:17 > > i found my mistake Edited by author 20.11.2005 00:44 matkir_ssau Re: Please ! Need help..my algoritm is wright, but ! WA9 [3] // Problem 1296. Hyperjump 10 Jan 2006 15:22 I have wa#9 but I can't found mistake :( what is test 9? Temur Re: Please ! Need help..my algoritm is wright, but ! WA9 [2] // Problem 1296. Hyperjump 3 Dec 2015 09:58 3 -1 -1 1 try this Nikolya Korol Re: Please ! Need help..my algoritm is wright, but ! WA9 // Problem 1296. Hyperjump 2 Mar 2025 00:36 I tried this and I get the correct answer, but test 9 code fails. Nikolya Korol Re: Please ! Need help..my algoritm is wright, but ! WA9 // Problem 1296. Hyperjump 2 Mar 2025 01:13 Here is the code that fails test 9: from typing import List potentials: List[int] = [] N: int = int(input()) for p in range(N): potentials.append(int(input())) def list_max_right_sum(lst: List[int]) -> List[int]: amount: int = 0 left_min: int = 0 left_max_index: int = 0 k: int = 0 for i, p in enumerate(lst): amount += p k = i + 1 if amount < left_min: left_min = amount left_max_index = i + 1 return lst[left_max_index: k] result: List[int] = list_max_right_sum(potentials) result.reverse() result = list_max_right_sum(result) print(sum(result)) eremeev.me.2012@gmail.com Я не понимаю что надо сделать? [1] // Problem 1336. Problem of Ben Betsalel 8 Mar 2024 18:54 Что означает отношения квадрата и куба и что за число n redcooltomato Re: Я не понимаю что надо сделать? // Problem 1336. Problem of Ben Betsalel 26 Feb 2025 16:51 дано число n, найти a и b где n = a^2/b^3 PredaBoss If you've got WA#13,here is why [2] // Problem 1183. Brackets Sequence 25 Feb 2018 14:35 Test 13 is an empty sequence :))) FelFa_1414666 Re: If you've got WA#13,here is why // Problem 1183. Brackets Sequence 8 Feb 2022 11:23 Thanks Bro el linisze de la lunasovic schneider Re: If you've got WA#13,here is why // Problem 1183. Brackets Sequence 25 Feb 2025 08:48 Thanks! Edited by author 25.02.2025 08:48 👑TIMOFEY👑`~ WA8 // Problem 1996. Cipher Message 3 24 Feb 2025 19:59 ans No xurshid_n hint [5] // Problem 1819. Professional Approach 19 Jul 2012 14:57 3-edge connected components of graph. A Simple 3-Edge Connected Component Algorithm by Yung H. Tsin. But I self do not found this article :) Shen Yang Re: hint [3] // Problem 1819. Professional Approach 5 Dec 2016 14:26 I have a stupid idea to solve this problem: first ,dfs a tree, then for each node compute the hash_value of edge set which cover this node.. for each query a,b if for every node on the path of (a,b) the set of edge cover by this node is not equal to any node outside the path of (a,b) and times of edge segments covered the path >=2 then result is Yes,otherwise it is no.. I'll try to use president tree to implement this idea... hope there is nothing wrong.. Edited by author 05.12.2016 14:35 Edited by author 05.12.2016 14:35 Shen Yang Re: hint [2] // Problem 1819. Professional Approach 6 Dec 2016 11:38 WA on test # 18,any one help?? Shen Yang Re: hint [1] // Problem 1819. Professional Approach 6 Dec 2016 12:44 AC 0.421s O(n*log(n)^2) its log(n)^2 because I use heavy_light decomposion+segment_tree Shen Yang Re: hint // Problem 1819. Professional Approach 28 Oct 2018 15:48 ccz181078 has give a random solution to the sub problem of this problem:: give a tree with n node,n<=50000 for every edege there is a color 1<=c<=50000, give q<=50000 queries ,for each query give two node a,b judge for every color on path a-->b this color appear only on the path a--->b ,not outside path a--->b. sol :for every edge gives a random 32 bit number, so that for every col xor of edge with this color is zero.. for each query just judge if xor of random number on this path is zero. if it is ,answer is Yes, otherwise it is No ~'Yamca`~ Re: hint // Problem 1819. Professional Approach 21 Feb 2025 23:12 You're wrong. The answer may be "Yes" but nodes not in one 3-edge connected component stariy_bog accepted python // Problem 1119. Metro 20 Feb 2025 21:04 # works on pypy import sys n, m = sys.stdin.readline().split() n, m = int(n), int(m) k = int(sys.stdin.readline()) can_diag = {tuple(map(int, sys.stdin.readline().split())):0 for _ in range(k)} city_map = [[0]*(n+1) for _ in range(m+1)] for i in range(n+1): city_map[0][i] = i*100 for i in range(m+1): city_map[i][0] = i*100 for i in range(1, m+1): for j in range(1, n+1): if (j, i) in can_diag: city_map[i][j] = 100*(2**0.5)+city_map[i-1][j-1] else: city_map[i][j] = 100+min(city_map[i][j-1], city_map[i-1][j]) print(round(city_map[-1][-1])) 👑TIMOFEY👑`~ AC long double // Problem 2008. Swifty 17 Feb 2025 20:00 👑TIMOFEY👑`~ WA4 // Problem 1936. Roshambo 17 Feb 2025 12:18 i think i get this wa by precision, i try to use long double but this dont enough, maybe i have specific algorithm for this problem LeTim DO NOT USE DOUBLE [4] // Problem 1524. Men in Black 15 Oct 2024 18:21 Use float instead, otherwise you'll get WA8!!! Oleg Vasilenko (Chelyabinsk) Re: DO NOT USE DOUBLE [3] // Problem 1524. Men in Black 3 Nov 2024 11:12 Sorry, but it's wrong. I got AC without floats, only doubles :)) akorton Re: DO NOT USE DOUBLE [1] // Problem 1524. Men in Black 4 Dec 2024 20:24 Any advice for WA2? LeTim Re: DO NOT USE DOUBLE // Problem 1524. Men in Black 14 Feb 2025 19:53 akorton wrote 4 December 2024 20:24 Any advice for WA2? Try this test: 1 James 0.8 0.7 0.75 0.5 0.85 J 2 0.4 100 mibLexus 0.99 1000 car2 2 mibLexus 0 pq123bu mibLexus 12 ab891ah 2 0.2 0.3 18 100 cockroach 0.8 0.3 30 46 monster2 1000000 30 200 0.95 19 10 newagent Klint 0.9 0.8 0.5 0.7 0.86 20 quest run 48 30 newcar mibLexus 47 aa890bu 43 quest kill 100 cockroach 53 quest kill 100 cockroach 67 quest kill 100 cockroach 71 quest kill 100 cockroach 80 quest talk 1 0.1 10 998 newcar mibLexus 0 z2 999 newcar car2 0 z1 1000 quest findout 200 0.1 30 2000 quest findout 30 0.1 30 3000 quest kill 100 cockroach 4000 quest kill 10 monster2 5000 quest kill 10 monster2 6000 newagent John 0.5 0.5 0.5 0.5 0.5 7000 quest kill 10 monster2 999999 quest findout 500000 0.1 1000000 1000000 quest findout 500000 0.1 1000000 Answer: 0000:00:10 New agent Klint got a letter K. 0000:00:20 Agent J started quest 1 using car pq123bu. 0000:00:30 MIB bought a car of class mibLexus. 0000:00:43 Agent K started quest 2 using car ab891ah. 0000:02:12 Agent J finished quest 1. 0000:02:12 Agent J started quest 3 using car aa890bu. 0000:02:25 Car ab891ah was broken. 0000:03:00 Agent K killed monster cockroach. 0000:03:14 Car aa890bu was broken. 0000:04:44 Agent J killed monster cockroach. 0000:05:05 Agent K finished quest 2. 0000:05:05 Agent K started quest 4. 0000:07:07 Agent J finished quest 3. 0000:07:07 Agent J started quest 5 using car pq123bu. 0000:07:12 Car pq123bu was broken. 0000:07:29 Agent K killed monster cockroach. 0000:09:34 Agent K finished quest 4. 0000:09:34 Agent K started quest 6. 0000:09:47 Agent K finished quest 6. 0000:09:49 Agent J killed monster cockroach. 0000:12:12 Agent J finished quest 5. 0000:16:38 MIB bought a car of class mibLexus. 0000:16:39 MIB bought a car of class car2. 0000:16:40 Agent K started quest 7 using car z2. 0000:18:36 Car z2 was broken. 0001:01:51 Agent K finished quest 7. 0001:09:20 Agent J and agent K started quest 8. 0001:11:20 Agent J and agent K finished quest 8. 0002:02:00 Agent K started quest 9. 0002:04:23 Agent K killed monster cockroach. 0002:06:28 Agent K finished quest 9. 0002:06:28 Agent K has tired. 0002:18:40 Agent J started quest 10. 0002:19:25 Agent J killed monster monster2. 0002:19:39 Agent J finished quest 10. 0003:11:20 Agent J started quest 11. 0003:12:04 Agent J killed monster monster2. 0003:12:18 Agent J finished quest 11. 0004:04:00 New agent John got a letter I. 0004:20:40 Agent J started quest 12. 0004:21:24 Agent J killed monster monster2. 0004:21:38 Agent J finished quest 12. 0694:10:39 Agent J started quest 13. 0694:10:40 Agent I started quest 14. 2604:14:01 Agent J finished quest 13. 3472:05:20 Agent I finished quest 14. LeTim Re: DO NOT USE DOUBLE // Problem 1524. Men in Black 14 Feb 2025 19:47 Oleg Vasilenko (Chelyabinsk) wrote 3 November 2024 11:12 Sorry, but it's wrong. I got AC without floats, only doubles :)) idk, i have literally the same solution with double that got WA 8, and with float - AC. maybe someone else might have the same issueEdited by author 14.02.2025 19:55
|