# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
221460 | patrikpavic2 | Capital City (JOI20_capital_city) | C++17 | 1273 ms | 37216 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 <cstdio>
#include <vector>
#include <queue>
#define PB push_back
using namespace std;
const int N = 2e5 + 500;
int sub[N], uzeo[N], C[N], cnt[N], zabr[N], par[N], centr[N], kol[N], uk[N];
int fin = N, n;
vector < int > moji, koji[N], v[N];
void dfs(int x, int lst){
sub[x] = 1; moji.PB(x);
par[x] = lst;
for(int y : v[x]){
if(centr[y] || lst == y) continue;
dfs(y, x); sub[x] += sub[y];
}
}
int nadi(int x){
dfs(x, x);
int nn = (int)moji.size();
int dos = x;
for(int y : moji){
if(2 * sub[y] >= nn && sub[y] < sub[dos])
dos = y;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |