Submission #1289852

#TimeUsernameProblemLanguageResultExecution timeMemory
1289852enzyICC (CEOI16_icc)C++20
0 / 100
3 ms596 KiB
#include<bits/stdc++.h> #include"icc.h" using namespace std; const int maxn=110; const int maxk=7; vector<int>v[maxn]; int faz_query(int x, int y, vector<int>a, vector<int>b){ int A[x], B[y]; for(int i=0;i<x;i++) A[i]=a[i]; for(int i=0;i<y;i++) B[i]=b[i]; return query(x,y,A,B); } int find(vector<int> a, vector<int> b){ int id=0; for(int k=0;k<maxk;k++){ vector<int>aux; for(int j=0;j<a.size();j++) if(j&(1<<k)) aux.push_back(a[j]); if(aux.size()&&faz_query(aux.size(),b.size(),aux,b)) id+=(1<<k); } return a[id]; } void run(int n){ for(int i=1;i<=n;i++) v[i].push_back(i); for(int i=1;i<n;i++){ vector<int>a, b; int at=__lg(n-i+1); for(int k=0;k<maxk;k++){ a.clear(); b.clear(); for(int j=1;j<=n-i+1;j++){ if(j&(1<<k)) for(int x : v[j]) a.push_back(x); else for(int x : v[j]) b.push_back(x); } if(k==maxk-1) break; if(a.size()&&b.size()&&faz_query(a.size(),b.size(),a,b)) break; } int u=find(a,b), w=find(b,a), repu, repw; setRoad(u,w); for(int i=1;i<=n-i+1;i++){ for(int x : v[i]){ if(x==u) repu=i; if(x==w) repw=i; } } if(repu>repw) swap(repu,repw); for(int x : v[repw]) v[repu].push_back(repw); v[repw].clear(); for(int x : v[n-i+1]) v[repw].push_back(x); v[n-i+1].clear(); } }
#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...