# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20984 | gs14004 | Zagrade (COI17_zagrade) | C++11 | 1479 ms | 44600 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;
typedef long long lint;
typedef pair<int, int> pi;
int n;
char a[300005];
int sz[300005], msz[300005], vis[300005];
vector<int> gph[300005];
vector<int> dfn;
void dfs(int x, int p){
dfn.push_back(x);
sz[x] = 1;
msz[x] = 0;
for(auto &i : gph[x]){
if(vis[i] || i == p) continue;
dfs(i, x);
msz[x] = max(msz[x], sz[i]);
sz[x] += sz[i];
}
}
int get_center(int x){
dfn.clear();
dfs(x, -1);
int cur = 1e9;
int ret = -1;
for(auto &i : dfn){
int w = max(msz[i], (int)dfn.size() - sz[i]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |