제출 #1134136

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1134136		lopkus	Zagrade (COI20_zagrade)	C++20	100 / 100	227 ms	1056 KiB

zagrade

#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
//#define int long long
int n,q;
char c[1000005];
vector <int> v;
bool b1;
bool query(int l,int r){
    cout<<"? "<<l<<" "<<r<<endl;
    bool b2;
    cin>>b2;
    return b2;
}
int main(){
    cin>>n>>q;
    // v.pb(1\);


    for(int i=1;i<=n;i++){
        v.pb(i);   
        if(v.size()<2){
            continue;
        }
        b1=query(v[v.size()-2],v[v.size()-1]);
        if(b1){
            c[v[v.size()-2]]='(';
            c[v[v.size()-1]]=')';
            v.pop_back();
            v.pop_back();
        }


        
    }
    if(v.size()){
        for(int i=1;i<=v.size();i++){
            if(2*i<=(v.size())){
                c[v[i-1]]=')';
            }else{
                c[v[i-1]]='(';
            }
        }
        cout<<"! ";
        for(int i=1;i<=n;i++){
            cout<<c[i];
        }
        cout<<endl;
    }else{
        cout<<"! ";
        for(int i=1;i<=n;i++){
            cout<<c[i];
        }
        cout<<endl;
    }
}

• Subtask 1: 14 / 14
• Subtask 2: 7 / 7
• Subtask 3: 57 / 57
• Subtask 4: 22 / 22