| Show all threads Hide all threads Show all messages Hide all messages |
| how to easily solve this problem | 👑TIMOFEY👑`~ | 1759. Long-Livers | 30 Aug 2023 10:49 | 1 |
|
| C# and out of memory | Pavel | 1510. Order | 29 Aug 2023 01:29 | 3 |
If you are using C# and running out of memory somewhere at test 36 think how to gracefully call the GC because the heap is full of strings u read from console. Thanks a lot. I thought that I need to use some other algorithm, because I just created a dictionary with the bill key and value counter++ then did sorting through the Linq and it's definitely inefficient, but in I still succeeded. I inserted a GC.Collect() for every 1000 iterations of reading and I passed all the tests.
Edited by author 24.10.2021 18:54 Thank you, i get tired of this problem <3 |
| OMG I GOT AC | 👑TIMOFEY👑 | 1546. Japanese Sorting | 28 Aug 2023 16:36 | 1 |
try to figure out how sorting in Japanese differs from regular sorting, there really isn’t such a big difference, but there will also be one trick with which you will need to suffer |
| WA33 | 👑TIMOFEY👑 | 2074. Timus problems classifier | 28 Aug 2023 14:54 | 1 |
WA33 👑TIMOFEY👑 28 Aug 2023 14:54 u can have some problems with fourth condition, like convert char to string or something like this
20. vector
1241 |
| RE 32 | 👑TIMOFEY👑 | 2074. Timus problems classifier | 28 Aug 2023 14:41 | 1 |
RE 32 👑TIMOFEY👑 28 Aug 2023 14:41 ```
Topic id is a sequence <number>.<number>. ... <number>. All numbers are integers from a segment [1, 20] and have no leading zeroes. All topic id’s are unique.
```
try test:
1. graphs
1022
1065
2. geometry
1020
2.1. idea
1130
2.2. technique
1111 1065
1265
2.2.1. convex hull
1271
3. dynamic programming
1244
20. vector |
| wa7 | 👑TIMOFEY👑 | 1378. Artificial Intelligence | 26 Aug 2023 17:11 | 1 |
wa7 👑TIMOFEY👑 26 Aug 2023 17:11 the sides of the square may not be parallel to the sides of the field |
| WA5 | 👑TIMOFEY👑 | 1468. Fraction | 26 Aug 2023 15:29 | 1 |
WA5 👑TIMOFEY👑 26 Aug 2023 15:29 you put the first parenthesis (in the wrong place |
| TLE3 | 👑TIMOFEY👑 | 1468. Fraction | 26 Aug 2023 15:28 | 1 |
TLE3 👑TIMOFEY👑 26 Aug 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 |
| WA2 | 👑TIMOFEY👑 | 1468. Fraction | 26 Aug 2023 15:27 | 1 |
WA2 👑TIMOFEY👑 26 Aug 2023 15:27 do not be smart in the code, do not add many characters at once, try to think step by step |
| TLE 10 | 👑TIMOFEY👑 | 1486. Equal Squares | 26 Aug 2023 08:45 | 1 |
TLE 10 👑TIMOFEY👑 26 Aug 2023 08:45 use sort instead of map or unordered_map, its around 10 times faster |
| AC at last! | iceswanX | 1033. Labyrinth | 24 Aug 2023 14:22 | 5 |
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. I also got WA because of it.
I thought that upper left is
entrance and bottom right is
exit! Oh, god! You guys are so smart! I ran into the same trap and got AC following your hints.
Thanks a lot! Yeah I thought same thing! 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!) |
| I have a test and an AC (greedy) program, that gives WA on my test | vnikulin | 1182. Team Them Up! | 22 Aug 2023 20:06 | 6 |
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 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. 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. 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 |
| If you are confused about problem description, there are 2 extra clarifications | yamininja19 | 1876. Centipede's Morning | 22 Aug 2023 07:37 | 1 |
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 |
| WA 4, WA 7, WA 13 | 👑TIMOFEY👑 | 2171. Two Progressions 2 | 21 Aug 2023 22:03 | 1 |
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 |
| TLE 42 | 👑TIMOFEY👑 | 2171. Two Progressions 2 | 21 Aug 2023 22:02 | 1 |
TLE 42 👑TIMOFEY👑 21 Aug 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 |
| WA 39 | 👑TIMOFEY👑 | 2171. Two Progressions 2 | 21 Aug 2023 21:58 | 1 |
WA 39 👑TIMOFEY👑 21 Aug 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 |
| WA 39 | 👑TIMOFEY👑 | 2171. Two Progressions 2 | 21 Aug 2023 21:58 | 1 |
WA 39 👑TIMOFEY👑 21 Aug 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 |
| TLE 38 | 👑TIMOFEY👑 | 2171. Two Progressions 2 | 21 Aug 2023 20:46 | 1 |
TLE 38 👑TIMOFEY👑 21 Aug 2023 20:46 |
| Why Restricted Function ???????????!!!!!!!!!!!!!!!!!!!!! | Ramkrushna Pradhan | 1837. Isenbaev's Number | 20 Aug 2023 18:31 | 2 |
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" 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 |
| Hint (understand problem correctly) | Keworker | 1128. Partition into Groups | 19 Aug 2023 12:27 | 1 |
The graph is not oriented graph. It makes solution easier.
Edited by author 19.08.2023 12:29 |
