# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
589442 | Soumya1 | Split the Attractions (IOI19_split) | C++17 | 81 ms | 12716 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;
const int mxN = 1e5 + 5;
vector<int> ad[mxN];
bool vis[mxN];
int B;
vector<int> s1;
void dfs(int u) {
vis[u] = true;
if (s1.size() == B) return;
s1.push_back(u);
for (int v : ad[u]) {
if (vis[v]) continue;
dfs(v);
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
for (int i = 0; i < p.size(); i++) {
ad[p[i]].push_back(q[i]);
ad[q[i]].push_back(p[i]);
}
if (a == 1) {
vector<int> ans(n, 3);
B = b;
dfs(1);
for (int i : s1) ans[i] = 2;
for (int i = 0; i < n; i++) {
if (ans[i] == 3) {
ans[i] = 1;
break;
}
}
return ans;
} else {
int start = 0;
vector<int> deg(n);
for (int i : p) deg[i]++;
for (int i : q) deg[i]++;
for (int i = 0; i < n; i++) {
if (deg[i] == 1) start = i;
}
vector<int> ans(n);
int cur = 0;
while (!ans[start]) {
cur++;
if (cur <= a) ans[start] = 1;
else if (cur <= a + b) ans[start] = 2;
else ans[start] = 3;
for (int to : ad[start]) {
if (!ans[to]) start = to;
}
}
return ans;
}
return {};
}
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... |