Submission #705710

#TimeUsernameProblemLanguageResultExecution timeMemory
705710hoangnghiepNizovi (COI14_nizovi)C++14
100 / 100
170 ms336 KiB
#include<bits/stdc++.h> #define int long long #define f first #define s second #define repeat(i,a,b) for(int i=a;i<=b;i++) #define pb push_back #define p push #define pii pair<int,int> #define piii pair<int,pair<int,int>> #define vii vector<vector<int>> #define vi vector<int> //#define DEBUG //#define multipletest //#define interactive using namespace std; const int LIM=5e5; const int mod=1e9+7; const int maxn=20; const int inf=1e9; int n,na,nb,m,x,y,k,t,e,q; int dx[8]={1,-1,0,0,-1,-1,1,1}; int dy[8]={0,0,-1,1,1,-1,1,-1}; char c; string s; int a[LIM+5],factorial[(1<<maxn)+5],inv_fact[(1<<maxn)+5]; bool notprime[LIM+5]; map<int,int> mp; char grid[100+5][100+5]; int power(int a,int b){ if(b==0) return 1; int t=power(a,b/2); t = t * t %mod; if(b%2==1) t = t * a %mod; return t; } bool check(int x,int y){ if(x<=0 || x>n || y<=0 || y>m || grid[x][y]=='T'){ return false; } return true; } class DSU{ int *parent; int *rank; int *tot; public: DSU(int n){ rank=new int[n+5]; parent=new int[n+5]; tot=new int [n+5]; for(int i=0;i<n+5;i++){ parent[i]=i; rank[i]=0; tot[i]=1; } } int find(int i){ if(parent[i]==i){ return i; } return parent[i]=find(parent[i]); } void unite(int u,int v){ int i=find(u); int j=find(v); if(i!=j){ if(rank[i]>rank[j]){ parent[j]=i; tot[i]+=tot[j]; } else if(rank[i]<rank[j]){ parent[i]=j; tot[j]+=tot[i]; } else{ parent[j]=i; rank[i]++; tot[i]+=tot[j]; } } } int total(int u){ return tot[u]; } }; void precal(int n){ factorial[0]=1; inv_fact[0]=1; for (int i = 1; i <n; ++i) { factorial[i] = factorial[i - 1] * i % mod; inv_fact[i] = inv_fact[i - 1] * power(i, mod - 2) % mod; } } int choose(int n,int k){ if(k<0 || k>n) return 0; return factorial[n] * inv_fact[n-k] % mod * inv_fact[k] %mod; } void Sieve(){ notprime[0]=notprime[1]=true; for(int i=2;i<LIM+5;++i){ if(notprime[i]==false){ for(int j=i*i;j<LIM+5;j+=i){ notprime[j]=true; } } } } int ask(int x,int y){ cout<<"cmp "<<x<<" "<<y<<endl; int a; cin>>a; return a; } void reverse(int pos,int la,int lb){ cout<<"reverse "<<pos<<" "<<pos+la+lb-1<<endl; if(la>1){ cout<<"reverse "<<pos+lb<<" "<<pos+la+lb-1<<endl; } if(lb>1){ cout<<"reverse "<<pos<<" "<<pos+lb-1<<endl; } } void testcase(){ } void solve(){ //Sieve(); // precal(); cin>>na>>nb; #ifdef interactive testcase(); #endif vector<int> at(na); for(int i=0;i<na;++i){ int low=1,high=nb; while(low<=high){ int mid=(low+high)>>1; if(ask(i+1,na+mid)>0){ at[i]=mid; low=mid+1; } else{ high=mid-1; } } } int ptr=0; for(int i=0;i<na;++i){ if(ptr<at[i]){ reverse(i+1+ptr,na-i,at[i]-ptr); ptr=at[i]; } } cout<<"end"<<endl; } signed main(){ // freopen(".inp","r",stdin); // freopen(".out","w",stdout); ios_base::sync_with_stdio(false); cin.tie(NULL); int test; test=1; #ifdef multipletest cin>>test; #endif while(test--){ solve(); #ifdef DEBUG cerr << "Runtime is: " << clock() * 1.0 / CLOCKS_PER_SEC << endl; #endif } }
#Verdict Execution timeMemoryGrader output
Fetching results...