Submission #557737

#TimeUsernameProblemLanguageResultExecution timeMemory
557737Yazan_AlattarZagrade (COI20_zagrade)C++14
14 / 100
1094 ms460 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 500007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

char ans[M];
int n, q;

int main(){
//    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cout.flush();

    cin >> n >> q;
    int rem = n / 2;
    for(int i = 1; i <= n; ++i) if(!ans[i]){
        bool ok = 0;
        for(int j = i + 1; j <= n; j += 2) if(!ans[j]){
            cout << "? " << i << " " << j << endl;
            cout.flush();
            cin >> ok;

            if(ok){
                ans[i] = '(';
                ans[j] = ')';
                --rem;
                break;
            }
        }
        if(!ok){
            if(rem) --rem, ans[i] = ')';
            else ans[i] = '(';
        }
    }

    cout << "! ";
    for(int i = 1; i <= n; ++i) cout << ans[i];
    cout << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...