# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
204329 | kshitij_sodani | Split the Attractions (IOI19_split) | C++17 | 126 ms | 14196 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 <iostream>
#include <bits/stdc++.h>
using namespace std;
#include <split.h>
#define mp make_pair
#define pb push_back
#define a first
#define b second
vector<int> adj[200001];
vector<int> stac;
int bb;
int vis[200001];
void dfs(int no){
stac.pb(no);
if(stac.size()==bb){
return ;
}
for(int j=0;j<adj[no].size();j++){
if(stac.size()==bb){
return;
}
int nn=adj[no][j];
if(vis[nn]==0){
dfs(nn);
}
}
}
vector<int> find_split(int n,int a,int b,int c,vector<int> p,vector<int> q){
int m=p.size();
bb=b;
memset(vis,0,sizeof(vis));
for(int i=0;i<m;i++){
adj[p[i]].pb(q[i]);
adj[q[i]].pb(p[i]);
}
if(a==1){
dfs(0);
int st=1;
vector<int> ans;
for(int i=0;i<n;i++){
ans.pb(0);
}
for(int j=0;j<b;j++){
ans[stac[j]]=(int)2;
}
for(int i=0;i<n;i++){
if(ans[i]==(int)2){
continue;
}
ans[i]=st;
st=3;
}
return ans;
}
vector<int> aa;
return aa;
}
/*int main(){
return 0;
}*/
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... |