# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160585 | DanerZein | Split the Attractions (IOI19_split) | C++14 | 121 ms | 13116 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;
typedef vector<int> vi;
vector<vi>G;
vi r;
int vis[100010];
void dfs(int u){
vis[u]=1;
r.push_back(u);
for(int i=0;i<G[u].size();i++){
if(vis[G[u][i]]==0){
dfs(G[u][i]);
}
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
// r.resize(n);
G.resize(n);
for(int i=0;i<p.size();i++){
G[p[i]].push_back(q[i]);
G[q[i]].push_back(p[i]);
}
dfs(0);
vi res;
res.resize(n);
int at=1;
for(int i=0;i<r.size();i++){
// cout<<r[i]<<" ";
res[r[i]]=at;
if(at==1) a--;
if(at==2) b--;
if(at==3) c--;
if(a==0) {at=2;
a=-1;
}
if(b==0) at=3;
}
//cout<<endl;
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... |