# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
816994 | vjudge1 | Split the Attractions (IOI19_split) | C++17 | 58 ms | 10316 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;
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
vector<int> res(n);
vector<int> g[n + 2];
for (int i = 0; i < p.size(); i++) {
g[p[i]].push_back(q[i]);
g[q[i]].push_back(p[i]);
}
int st = 0;
for (int i = 0; i < n; i++) {
if (g[i].size() == 1) {
st = i;
break;
}
}
queue<int> qq;
qq.push(st);
int ptr = 0, Left[4] = {a, b, c, 100000};
bool visited[n + 2];
memset(visited, 0, sizeof(visited));
visited[st] = 1;
res[st] = 1;
Left[0]--;
while (qq.size()) {
if (Left[ptr] == 0) ptr++;
int fr = qq.front();
qq.pop();
for (auto x : g[fr]) {
if (!visited[x]) {
visited[x] = 1;
res[x] = ptr + 1;
Left[ptr]--;
if (Left[ptr] == 0) ptr++;
qq.push(x);
}
}
}
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... |