Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

CSES Path Queries II infinite TLE
Difference between en2 and en3, changed 0 character(s)
Hi. I was implementing my own HLD and I used this problem: [CSES2134-Path Queries II](https://cses.fi/problemset/submit/2134/) in order to practice. But, the thing is, whatever I do it won't stop giving TLE on test case #9. To see if the time difference was huge compared to other solutions, I used [the USACO Guide solution](https://usaco.guide/problems/cses-2134-path-queries-ii/solution), but it also received a TLE verdict. Other codes from GitHub I've tried have the same result. ↵
Is this common for CSES to have such tight time limits or is there something wrong with this particular problem?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English turral 2026-08-15 23:49:23 0 (published)
en2 English turral 2026-08-15 23:49:11 25 Tiny change: 'limits or there is something' -> 'limits or is there something'
en1 English turral 2026-08-15 23:46:55 627 Initial revision (saved to drafts)