# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520718 | peti1234 | Split the Attractions (IOI19_split) | C++17 | 70 ms | 12572 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>
using namespace std;
int n, m, db[4];
vector<int> valasz, el[100000];
void dfs(int a, int ert) {
if (!db[ert]) return;
valasz[a]=ert;
db[ert]--;
for (auto x:el[a]) {
if (!valasz[x]) {
dfs(x, ert);
}
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
int m=p.size();
db[1]=a, db[2]=b, db[3]=c;
for (int i=0; i<m; i++) {
int x=p[i], y=q[i];
el[x].push_back(y), el[y].push_back(x);
}
valasz.resize(n);
// 2
if (a==1) {
dfs(0, 2);
for (int i=0; i<n; i++) {
if (!valasz[i]) {
if (db[1]) {
valasz[i]=1;
db[1]--;
} else {
valasz[i]=3;
db[3]--;
}
}
}
return valasz;
}
// 1
for (int i=0; i<n; i++) {
if (el[i].size()==1) {
if (db[1]) {
dfs(i, 1);
} else {
dfs(i, 2);
}
}
for (int i=0; i<n; i++) {
if (!valasz[i]) {
valasz[i]=3;
db[3]--;
}
}
return valasz;
}
}
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... |