Hey Codeforces and friends! I ran into a problem with one of the recent challenges. the submission: https://mirror.codeforces.com/contest/1693/submission/263004780. I would really appreciate some help in figuring it out. Also, please excuse my poor English! seems no one is answering LMAO
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 02:22:15 (k1).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been updated by maria_foro (previous revision, new revision, compare).
bruh!! go solve some problems your level my friend(just kidding). I think the issue is in the dijkstra implementation bcs it uses O(N^2) , i am not sure but this might be the issue
The fact of the matter is that it's passing test 6, with 13e4 vertices and 2e5 edges and test 5 with 2e5 vertices and 2e5 edges, but it's getting a time limit on test 7 which is like this: 2 200000 1 2 2 1 1 2... I was trying to find some endless loops or something but I didn't make it
Auto comment: topic has been updated by maria_foro (previous revision, new revision, compare).