Submission #581994

#TimeUsernameProblemLanguageResultExecution timeMemory
581994Abdulmohsen1284Library (JOI18_library)C++14
19 / 100
502 ms368 KiB
#include <cstdio> #include <vector> #include "library.h" #include"bits/stdc++.h" using namespace std; long long s=0; vector <int> em; void rec(long long cur,vector <int> &grp) { long long fr=Query(grp); grp[cur-1]=1; if(fr==Query(grp)) { long long sum=0; grp[cur-1]=0; for(int i=0;i<(int)grp.size();i++) { if(grp[i]==1) sum++; } if(sum==1) { for(int i=0;i<(int)grp.size();i++) { if(grp[i]==1) s=i+1; } return; } if(s==0) Answer(em); vector <int> on=em,tw=em; long long took=0; for(int i=0;took<sum/2;i++) { if(i>=(int)grp.size()) break; if(grp[i]==1) { took++; on[i]=grp[i]; } } for(int i=0;i<(int)grp.size();i++) { if((grp[i]^on[i])==1) tw[i]=1; } for(int i=0;i<(int)on.size();i++) { if(on[i]==1) { rec(cur,on); break; } } for(int i=0;i<(int)tw.size();i++) { if(tw[i]==1) { rec(cur,tw); return; } } } else return; } void Solve(int N) { if(N==1) { em.push_back(1); Answer(em); return; } for(int i=1;i<=N;i++) em.push_back(0); for(int i=1;i<=N;i++) { vector <int> ask=em; for(int j=1;j<=N;j++) { if(i==j) continue; ask[j-1]=1; } long long ans=Query(ask); if(ans==1) { s=i; break; } } vector <int> ret,lef=em; ret.push_back(s); for(int i=1;i<=N;i++) { if(s==i) continue; lef[i-1]=1; } for(int i=1;i<N;i++) { rec(s,lef); ret.push_back(s); lef[s-1]=0; } Answer(ret); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...