# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
106646 | doowey | Race (IOI11_race) | C++14 | 819 ms | 36156 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;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
const int N = (int)2e5 + 9;
const int MX = (int)1e6 + 9;
const int inf = (int)1e9 + 1;
int K;
int bes[MX];
vector<pii> T[N];
bool use[MX];
int subt[N];
int res = inf;
void dfs1(int u, int par){
subt[u] = 1;
for(auto x : T[u]){
if(use[x.fi] || x.fi == par) continue;
dfs1(x.fi, 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... |