# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889411 | vjudge1 | Split the Attractions (IOI19_split) | C++17 | 60 ms | 15184 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;
using vi = vector<int>;
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
vi re(n, 0);
vector<vi> L(n);
for(int i = 0; i < p.size(); ++i) {
L[p[i]].push_back(q[i]);
L[q[i]].push_back(p[i]);
}
if(a == 1) {
vi viz(n, 0);
int nrb = 0;
function<void(int)> dfs = [&](int u) {
viz[u] = 1;
if(nrb < b) {
re[u] = 2;
++nrb;
}
for(auto it : L[u]) {
if(!viz[it])
dfs(it);
}
};
dfs(0);
for(auto &it : re) {
if(!it && a) {
it = 1;
--a;
}
if(!it) it = 3;
}
return re;
}
// if(p.size() == n - 1) {
// vi sz(n, 0), dpa(n, 0);
// function<void(int, int)> dfs = [&](int u, int p) {
// };
// }
return re;
}
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... |