| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1067903 | pcc | Split the Attractions (IOI19_split) | C++17 | 603 ms | 1048576 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 = 2e5+10;
vector<int> ans;
int N,A,B,C;
vector<int> paths[mxn];
void dfs(int now,int par,int &cnt,int col){
ans[now] = col;
cnt--;
if(!cnt)return;
for(auto nxt:paths[now]){
if(nxt == par)continue;
dfs(nxt,now,cnt,col);
}
return;
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
ans = vector<int>(n,0);
N = n,A = a,B = b,C = c;
for(int i = 0;i<p.size();i++){
int a = p[i],b = q[i];
paths[a].push_back(b);
paths[b].push_back(a);
}
int s = -1,e = -1;
for(int i = 0;i<N;i++){
if(paths[i].size() == 1){
if(s == -1)s = i;
else e = i;
}
}
if(s == -1)s = 0,e = paths[0][0];
dfs(s,e,A,1);
dfs(e,s,B,2);
for(auto &i:ans)if(!i)i = 3;
return ans;
}
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... | ||||
