→ Virtual participation
Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.
→ Practice?
Want to solve the contest problems after the official contest ends? Just register for practice and you will be able to submit solutions.
→ Status filter
→ Contest materials
Problem D - Lexicographically Minimal Shortest Path
Contest status
| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 166220478 | Jul/30/2022 14:39 | sary | D - Lexicographically Minimal Shortest Path | Java 11 | Accepted | 732 ms | 34800 KB |
| 191660978 | Feb/02/2023 08:40 | Harek | D - Lexicographically Minimal Shortest Path | C++20 (GCC 11-64) | Accepted | 171 ms | 14100 KB |
Sort by:
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/24/2026 16:17:38 (n2).
Desktop version, switch to mobile version.
Supported by
