제출 #557722

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
557722		Yazan_Alattar	Zagrade (COI20_zagrade)	C++14	0 / 100	1485 ms	288 KiB

zagrade

#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 = 1007;
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;
bool vist[M];

void solve(int l, int r){
    if(l > r) return;
    ans[l] = '(';
    ans[r] = ')';
    ++l; --r;

    for(int i = l + 1; i <= r; ++i){
        cout << "? " << l << " " << i << endl;
        bool ret; cin >> ret;

        if(ret){
            solve(l, i);
            if(i + 1 < r) solve(i + 1, r);
        }
    }
    return;
}

int main(){
//    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> q;
    solve(0, n + 1);

    cout << "! ";
    for(int i = 1; i <= n; ++i) cout << ans[i];
    cout << endl;
    return 0;
}

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