# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
594289 | Bench0310 | Race (IOI11_race) | C++17 | 857 ms | 114888 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>
#include "race.h"
using namespace std;
typedef long long ll;
const int N=200000;
const int K=1000000;
vector<array<int,2>> v[N];
int root=-1;
int sz[N];
int c[N][18];
ll d[N][18];
int lvl[N];
bool vis[N];
vector<int> ch[N];
vector<int> st[N];
int best[K+1];
int res=N;
int k;
void chmin(int &a,int b){a=min(a,b);}
void find_sz(int a,int p)
{
sz[a]=1;
for(auto [to,l]:v[a])
{
if(to==p||vis[to]) continue;
find_sz(to,a);
# | 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... |