Submission #796521

#TimeUsernameProblemLanguageResultExecution timeMemory
796521vjudge1Split the Attractions (IOI19_split)C++17
0 / 100
777 ms1048576 KiB
#include "split.h" #include "bits/stdc++.h" using namespace std; #define vi vector<int> const int mxn=1e5+5; vector<int> adj[mxn]; void dfs(int u, int pa, vi &ord){ ord.push_back(u); for(int v: adj[u]) if(v!=pa) dfs(v,u,ord); } 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; vi ord; dfs(u,-1,ord); 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...