# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
840635 | arbuzick | Closing Time (IOI23_closing) | C++17 | 1087 ms | 666256 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.
#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 2e5 + 5;
constexpr long long inf = (long long)(1e18) + 7;
vector<pair<int, int>> g[maxn];
long long dist_x[maxn], dist_y[maxn];
int prv[maxn];
vector<int> path;
void dfs(int v, long long* dist) {
for (auto [u, c] : g[v]) {
if (u != prv[v]) {
prv[u] = v;
dist[u] = dist[v] + c;
dfs(u, dist);
}
}
}
void calc_dist(int x, int y) {
prv[x] = x;
dfs(x, dist_x);
prv[y] = y;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |