Submission #158223

#TimeUsernameProblemLanguageResultExecution timeMemory
158223MvCSplit the Attractions (IOI19_split)C++14
22 / 100
1036 ms1048580 KiB
#include "split.h" #pragma GCC target("avx2") #pragma GCC optimization("O3") #pragma GCC optimization("unroll-loops") #include<bits/stdc++.h> #define rc(x) return cout<<x<<endl,0 #define pb push_back #define mkp make_pair #define in insert #define er erase #define fd find #define fr first #define sc second typedef long long ll; typedef long double ld; const ll INF=0x3f3f3f3f3f3f3f3f; const ll llinf=(1LL<<62); const int inf=(1<<30); const int nmax=1e5+50; const int mod=1e9+7; using namespace std; int sz[nmax],pr[nmax],a[5],n,nd,c1,c2,i,m; vector<int>g[nmax],rs; bitset<nmax>viz; void dfs(int x,int p) { sz[x]=1; pr[x]=p; for(int i=0;i<g[x].size();i++) { int y=g[x][i]; if(y==p)continue; dfs(y,x); sz[x]+=sz[y]; } for(int i=1;i<=3;i++) { for(int j=1;j<=3;j++) { if(i==j)continue; if(a[i]<=sz[x] && sz[x]<=a[i]+a[j]) { nd=x; c1=i; c2=6-i-j; } } } } void col(int x,int c) { if(!a[c])return; rs[x-1]=c; a[c]--; viz[x]=1; for(int i=0;i<g[x].size();i++) { int y=g[x][i]; if(y==pr[x] || viz[y])continue; col(y,c); } } vector<int> find_split(int N,int A,int B,int C,vector<int>P,vector<int>Q) { n=N,a[1]=A,a[2]=B,a[3]=C,m=(int)P.size(); for(i=0;i<m;i++) { P[i]++,Q[i]++; g[P[i]].pb(Q[i]); g[Q[i]].pb(P[i]); } nd=-1; dfs(1,0); for(i=1;i<=n;i++)rs.pb(0); if(nd!=-1) { col(nd,c1); col(1,c2); for(i=0;i<n;i++)if(!rs[i])rs[i]=6-c1-c2; } return rs; }

Compilation message (stderr)

split.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
split.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
 
split.cpp: In function 'void dfs(int, int)':
split.cpp:29:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[x].size();i++)
              ~^~~~~~~~~~~~
split.cpp: In function 'void col(int, int)':
split.cpp:56:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[x].size();i++)
              ~^~~~~~~~~~~~
#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...