# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258357 | Nightlight | Split the Attractions (IOI19_split) | C++14 | 160 ms | 16760 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>
#define pii pair<int, int>
#define pib pair<int, bool>
#define mp make_pair
using namespace std;
vector<int> adj[200005];
vector<int> ans;
int N, rt, M;
pii id[5];
int cnt[5];
int sz[100005], par[100005];
int ch;
int col[100005], vis[100005];
bool found;
void DFS(int u) {
sz[u] = 1;
vis[u] = 1;
for(int v : adj[u]) {
if(vis[v]) continue;
DFS(v);
sz[u] += sz[v];
}
}
void cent() {
DFS(0);
int u = 0, now = N / 2, nxt;
# | 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... |