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
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).