# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145404 | Eae02 | Split the Attractions (IOI19_split) | C++14 | 89 ms | 9392 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 "split.h"
#include <bits/stdc++.h>
using namespace std;
int numNodes;
vector<int> ans;
vector<int> edges1;
vector<int> edges2;
vector<vector<int>> neigh;
vector<int> par;
vector<int> stSize;
void initTree(int n, int p) {
par[n] = p;
stSize[n] = 1;
for (int i = 0; i < (int)neigh[n].size(); i++) {
if (neigh[n][i] != p) {
initTree(neigh[n][i], n);
stSize[n] += stSize[neigh[n][i]];
}
}
}
int remFill;
vector<bool> fillVis;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |