# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970408 | hoangbach | Race (IOI11_race) | C++14 | 0 ms | 0 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.
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define int long long
#define bit(i, j) (i >> j & 1)
#define all(x) (x).begin(),(x).end()
#define se second
#define sz(x) (int)(x).size()
#define pb push_back
const int MAXN = 2e5 + 5;
const int INF = 1e18;
int n, k, ans = INF;
int sz[MAXN], minroad[1000001];
bool del[MAXN];
vector<pair<int, int>> adj[MAXN];
void getsize(int u, int p) {
sz[u] = 1;
for (pair<int, int> v : adj[u]) {
if (v.fi != p && !del[v.fi]) {
getsize(v.fi, u);
sz[u] += sz[v.fi];
}
}