# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1177545 | LmaoLmao | Race (IOI11_race) | C++17 | 298 ms | 34332 KiB |
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using aa = array<int,3>;
const int INF = 1e9;
int s[200005];
bool del[200005];
vector<ii> adj[200005];
int mp[1000005];
int d,k,ans;
int dfs(int u,int p) {
s[u]=1;
for(ii v:adj[u]) {
if(del[v.fi] || v.fi==p) continue;
s[u]+=dfs(v.fi,u);
}
return s[u];
}
int citron(int u,int p,int sz) {
for(ii v:adj[u]) {
if(del[v.fi] || v.fi==p) continue;
if(s[v.fi]*2>sz) return citron(v.fi,u,sz);
}
# | 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... |