# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1157365 | nh0902 | Hard route (IZhO17_road) | C++20 | 1 ms | 2632 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 10;
int n, k;
vector<int> g[N];
int pa[N];
long long d_pa[N];
pair<int, long long> md[N][3];
long long ans;
long long cur_d;
int root;
void dfs(int u, int p) {
pa[u] = p;
for (int i = 0; i < 3; i ++) md[u][i] = {u, 0};
for (int v : g[u]) if (v != p) {
dfs(v, u);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |