Submission #773709

#TimeUsernameProblemLanguageResultExecution timeMemory
773709vjudge1Zagrade (COI20_zagrade)C++17
0 / 100
1 ms208 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY 10000000005
#define mod 1000000007
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
char dizi[100005];
vector <int> q;
bool kes[100005];

int sor(int x,int y){
    cout<<"? "<<x<<" "<<y<<" ";
    cout<<'\n';
    int m;cin>>m;
    cout<<'\n';
    return m;
}

int32_t main(){
    faster
    int n,k;cin>>n>>k;
    dizi[1]='(';
    q.push_back(1);
    for(int i=2;i<=n;i++){
        if(q.size() && sor(q.back(),i)){
            dizi[i]=')';
            kes[i]=1;
            q.pop_back();
        }
        else{
            dizi[i]='(';
            q.push_back(i);
        }
    }
    int gec=q.size()/2;
    for(int i=0;i<=gec-1;i++){
        dizi[q[i]]=')';
    }
    cout<<"! ";
    for(int i=1;i<=n;i++)cout<<dizi[i]<<" ";
    cout<<'\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...