# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1022651 | HappyCapybara | Split the Attractions (IOI19_split) | C++17 | 51 ms | 11852 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;
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q){
int m = p.size();
vector<vector<int>> g(n);
for (int i=0; i<m; i++){
g[p[i]].push_back(q[i]);
g[q[i]].push_back(p[i]);
}
vector<int> res(n, 3);
if (a > 1){
int now;
for (int i=0; i<n; i++){
if (g[i].size() == 1) now = i;
}
int i = 0;
int prev = -1;
while (i < a+b){
if (i < a) res[now] = 1;
else res[now] = 2;
i++;
if (g[now][0] != prev){
prev = now;
now = g[prev][0];
}
else {
if (g[now].size() == 1) break;
prev = now;
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... |