# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672595 | Hacv16 | Dreaming (IOI13_dreaming) | C++17 | 100 ms | 61232 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>
#include"dreaming.h"
using namespace std;
const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;
#define fr first
#define sc second
int mxdiam, dist[MAX], pai[MAX], seen[MAX];
vector<pair<int, int>> adj[MAX];
int mx, id;
void dfs(int u, int p, int d, bool f){
seen[u] = true;
mxdiam = max(d, mxdiam);
if(d > mx) mx = d, id = u;
if(f) pai[u] = p, dist[u] = d;
for(auto e : adj[u]){
int v = e.fr, w = e.sc;
if(v == p) continue;
dfs(v, u, d + w, f);
}
}
int getRadius(int 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |