# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
697257 | Hacv16 | Race (IOI11_race) | C++17 | 351 ms | 51640 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;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fr first
#define sc second
typedef long long ll;
const int MAX = 1e6 + 15;
const int INF = 0x3f3f3f3f;
int n, k, ans, sub[MAX], f[MAX];
vector<pair<int, int>> adj[MAX], update;
vector<int> fixupdate;
bool removed[MAX];
void dfsInit(int u, int p){
sub[u] = 1;
for(auto e : adj[u]){
if(e.fr == p || removed[e.fr]) continue;
dfsInit(e.fr, u);
sub[u] += sub[e.fr];
}
}
int findCentroid(ll u, ll p, ll sz){
for(auto e : adj[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... |