# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970299 | tset | Race (IOI11_race) | C++14 | 338 ms | 41932 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 "race.h"
#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9+42;
#define pii pair<int, int>
int nbNodes, requestedSum;
vector<vector<pii>> voisinDe;
vector<int> profSubtree;
vector<bool> interdit;
int lenSubTree;
int dfs(int nde, int ansc)
{
int ans = 1;
for(pii iV : voisinDe[nde])
{
if(!interdit[iV.first] && iV.first != ansc)
{
ans += dfs(iV.first, nde);
}
}
profSubtree[nde] = ans;
return ans;
}
int getCentroid(int nde, int ansc)
# | 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... |