# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527735 | KindaNameless | Race (IOI11_race) | C++14 | 959 ms | 39176 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<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<deque>
#include<cmath>
#include<map>
#include<set>
using namespace std;
#define ll long long
struct centroid_tree{
vector<vector<pair<int, int>>> adj;
vector<bool> vis;
vector<int> par, sz;
vector<ll> cnt;
map<int, int> paths;
int N, K, answer;
void init(int _N, int len){
int N = _N; K = len;
adj = vector<vector<pair<int, int>>>(N+2, vector<pair<int, int>>());
vis = vector<bool>(N+2);
par = vector<int>(N+2);
sz = vector<int>(N+2);
# | 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... |