Submission #976839

#	Time	Username	Problem	Language	Result	Execution time	Memory
976839		efedmrlr	Zagrade (COI20_zagrade)	C++17	14 / 100	540 ms	600 KiB

zagrade

#include <bits/stdc++.h>

#define lli long long int
#define ld long double
#define pb push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)

using namespace std;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

const int N = 1e5 + 5;
const int INF = 1e9 + 500;
vector<char> res(N);
int n, q;
bool query(int l, int r) {
    cout << "? " << l << " " << r << endl;
    bool x;
    cin >> x;
    return x;
}
void answer() {
    cout << "! ";
    for(int i = 1; i <= n; i++) {
        cout << res[i];
    }
    cout << endl;
}
void sol_sub(int l, int r) {
    if(l + 1 > r) return;
    if(l + 1 == r) {
        res[l] = '(';
        res[r] = ')';
        return;
    }
    bool x = query(l + 1, r - 1);
    if(x) {
        res[l] = '(';
        res[r] = ')';
        sol_sub(l + 1, r - 1);
        return;
    }
    for(int nr = l + 1; nr < r; nr+=2) {
        x = query(l, nr);
        if(x) {
            sol_sub(l, nr);
            sol_sub(nr + 1, r);
            return;
        }
    } 
}

void solve() {
    cin >> n >> q;

    sol_sub(1, n);
    answer();
}


signed main() { 
    fastio();
    solve();
}

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