Submission #1071298

#TimeUsernameProblemLanguageResultExecution timeMemory
1071298Faisal_SaqibBeech Tree (IOI23_beechtree)C++17
14 / 100
2099 ms23792 KiB
#include <bits/stdc++.h> using namespace std; const int N1=2e5+100; int n,m,p[N1],c[N1],cnt[N1]; vector<int> sub[N1],ma[N1]; void dfs(int x) { sub[x].clear(); for(int&y:ma[x]) { dfs(y); for(int&l:sub[y])sub[x].push_back(l); sub[x].push_back(y); } } std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C) { n=N,m=M; bool subtask=1; for(int i=0;i<n;i++)p[i]=P[i],c[i]=C[i],ma[i].clear(),subtask=(subtask&((p[i]==(i-1)))); if(subtask) { vector<int> b(n); map<int,int> cntp; for(int i=n-1;i>=0;i--) { cntp[c[i]]++; if(cntp.size()==1) { b[i]=1; } else if(cntp.size()==2 and min(cntp[c[i]],n-cntp[c[i]])==1) { b[i]=1; } else{ b[i]=0; } } return b; } else { for(int i=1;i<n;i++)ma[p[i]].push_back(i); dfs(0); vector<int> b; for(int i=0;i<n;i++) { sort(begin(sub[i]),end(sub[i])); int sz=sub[i].size(); bool good=1; do { good=1; for(int j=0;j<=500;j++) cnt[j]=0; for(int j=0;j<sz;j++) { int v=sub[i][j]; int rp=-1; if(cnt[c[v]]>0)rp=sub[i][cnt[c[v]]-1]; else{rp=i;} if(p[v]!=rp) { good=0; break; } cnt[c[v]]++; } if(good)break; }while(next_permutation(begin(sub[i]),end(sub[i]))); b.push_back(good); } return b; } }
#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...
#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...