답안 #557731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557731 2022-05-06T01:13:14 Z Yazan_Alattar Zagrade (COI20_zagrade) C++14
0 / 100
1403 ms 332 KB
#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 = 10007;
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 ask(int l, int r){
    if(!q) return 0;
    --q;
    cout << "? " << l << " " << r << endl;
    cout.flush();

    bool ret; cin >> ret;
    return ret;
}

void solve(int l, int r){
    if(l > r) return;
    for(int i = l + 1; i <= r; ++i){
        if(ask(l, i)){
            ans[l] = '(';
            ans[i] = ')';
            solve(l + 1, i - 1);
            solve(i + 1, r);
            break;
        }
    }
    return;
}

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

    cout << "! ";
    for(int i = 1; i <= n; ++i) cout << ans[i];
    cout << endl;
    cout.flush();
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 3 ms 208 KB Output is correct
3 Correct 37 ms 208 KB Output is correct
4 Correct 48 ms 208 KB Output is correct
5 Correct 126 ms 208 KB Output is correct
6 Correct 149 ms 208 KB Output is correct
7 Runtime error 1403 ms 332 KB Execution killed with signal 13
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Mismatch at position 1. Expected ), found
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 208 KB Mismatch at position 2. Expected (, found
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Mismatch at position 1. Expected ), found
2 Halted 0 ms 0 KB -