Submission #796530

#TimeUsernameProblemLanguageResultExecution timeMemory
796530vjudge1Split the Attractions (IOI19_split)C++17
18 / 100
65 ms15628 KiB
#include "split.h" #include "bits/stdc++.h" using namespace std; #define vi vector<int> const int mxn=1e5+5; vector<int> adj[mxn]; vi ord; vector<bool> vis; void dfs(int u){ vis[u]=true; ord.push_back(u); for(int v: adj[u]) if(!vis[v]) dfs(v); } vi find_split(int n, int a, int b, int c, vi p, vi q) { int m=(int)p.size(); for(int i=0;i<m;i++) adj[p[i]].push_back(q[i]),adj[q[i]].push_back(p[i]); int u=0; for(int i=0;i<n;i++) if(adj[i].size()==1) u=i; vis.assign(n,false); dfs(u); if((int)ord.size()!=n) return vi (n,0); vector<int> res(n); for(int i=0;i<n;i++){ for(;i<a;i++) res[ord[i]]=1; for(;i<a+b;i++) res[ord[i]]=2; for(;i<a+b+c;i++) res[ord[i]]=3; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...