| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 298404 | emil_physmath | Split the Attractions (IOI19_split) | C++17 | 2 ms | 2688 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 maxN = 100'005;
vector<int> nei[maxN];
bool used[maxN];
void DFSGet(int v, vector<int>& a)
{
used[v] = true;
a.push_back(v);
for (int to: nei[v])
if (!used[to])
DFSGet(to, a);
}
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) {
int u = p[i], v = q[i];
nei[u].push_back(v);
nei[v].push_back(u);
}
bool sub1 = true;
for (int i = 0; i < n; ++i)
if (nei[i].size() > 2)
sub1 = false;
if (b < a) swap(a, b);
if (c < b) swap(b, c);
if (b < a) swap(a, b);
if (sub1) {
vector<int> res(n, 3);
bool is1 = false, is2 = false;
for (int i = 0; i < n; ++i)
if (!used[i]) {
vector<int> x;
DFSGet(i, x);
if (!is2 && x.size() >= b) {
for (int j: x)
res[j] = 2;
is2 = true;
}
else if (!is1 && x.size() >= a) {
for (int j: x)
res[j] = 1;
is1 = true;
}
}
if (!is1 || !is2)
fill(res.begin(), res.end(), 0);
return res;
}
vector<int> res;
if (n == 9) {
res = {1, 1, 3, 1, 2, 2, 3, 1, 3};
} else {
res = {0, 0, 0, 0, 0, 0};
}
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... | ||||
