# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823114 | vjudge1 | Split the Attractions (IOI19_split) | C++17 | 76 ms | 15680 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 "split.h"
using namespace std;
const int N = 1e5 + 10;
vector<int> g[N];
vector<bool> vis;
vector<int> ord;
void bamboo(int s) {
vis[s] = 1;
ord.push_back(s);
for(int to : g[s]) {
if(vis[to]) continue;
bamboo(to);
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
int m = (int)p.size();
for(int i = 0; i < m; i++) {
g[p[i]].push_back(q[i]);
g[q[i]].push_back(p[i]);
}
bool isFirst = 1;
for(int i = 0; i < n; i++)
isFirst &= ((int)g[i].size() <= 2);
if(isFirst) {
vector<int> res(n);
int root = 0;
while(root < n - 1 && (int)g[root].size() == 2)
root++;
vis.assign(n, false);
bamboo(root);
for(int i = 0; i < a; i++)
res[ord[i]] = 1;
for(int i = a; i < a + b; i++)
res[ord[i]] = 2;
for(int i = a + b; i < a + b + c; i++)
res[ord[i]] = 3;
return res;
}
}
Compilation message (stderr)
# | 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... |