| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
0
Sure sir! Here is the link to the contest where this problem appeared. This problem was the D. If you want to submit it, just use one of the users that appears in the page without a password. :) |
|
+4
This might help :) The search time for an unordered map is of O(n) in the worst case. |
|
0
Hi everyone! Could someone help me? I tried to solve problem C, but it gives me TLE and my computer runs the first test case in 31 ms. :( This is my submission. |
|
0
The post-contest is working right now :) |
|
+62
Yoo!! Another comment by harrypotter0 |
|
+8
|
|
+5
Is DearMargaret going to have a bad rating change for first time? |
|
+8
Accepted!! :) Yes, I had read it a little bit wrong, you have to apply modulo to the number of paths, not to the distance Thanks Bodo!!! :) |
|
0
A long time ago I found another implementation of Sieve of Eratosthenes, when I was comparing another implementations I found a little bit faster and it worked with some larger numbers. |
|
0
Hi!! Thank you for all your advices :) I tried to implement what you said but i got TLE again :( maybe i need to use another data structure to prevent push the same coordinates. Code: https://ide.geeksforgeeks.org/5tIdijntrN So I tried to make a bfs where you find some store, another bfs to find the other store and another bfs to find the exit, but now it's give me WA and I don't know why :( |
|
0
There is no score distribution?? :o |
