# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
780618 | 2023-07-12T10:51:30 Z | andecaandeci | Zagrade (COI20_zagrade) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; ll n,q; char ans[100005]; int main(){ cin>>n>>q; for (int i=1;i<=100005;i++) ans[i]=' '; ans[1]='('; ans[n]=')'; ll lo=2,hi=n-1; while(lo<=hi){ cout<<">>> ? "<<lo-1<<" "<<lo<<endl; fflush(stdout); ll x; cin>>x; if (x==1) { if (ans[lo]==' ') ans[lo]=')'; if (ans[lo+1]==' ') ans[lo+1]='('; lo+=2; } else{ if (ans[lo]==' ') ans[lo]='('; lo+=1; } cout<<">>> ? "<<hi<<" "<<hi+1<<endl; cin>>x; fflush(stdout); if (x==1){ if (ans[hi]==' ') ans[hi]='('; if (ans[hi-1]==' ') ans[hi-1]=')'; hi-=2; } else{ if (ans[hi]==' ') ans[hi]=')'; hi-=1; } } cout<<">>> ! "<< for (int i=1;i<=n;i++){ cout<<ans[i]; } }