# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
917494 | coding_snorlax | Swapping Cities (APIO20_swap) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// 題目等價一張N點M邊的帶邊權連通圖,有Q個詢問,給x,y,求至少有一個路徑+多一邊且通過x,y的最小邊權是多少