답안 #1015873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015873 2024-07-07T00:30:00 Z 12345678 Zagrade (COI20_zagrade) C++17
14 / 100
712 ms 1360 KB
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;

int n, res[nx], x, q;

int query(int l, int r)
{
    cout<<"? "<<l<<' '<<r<<'\n';
    fflush(stdout);
    cin>>x;
    return x;
}
void solve(int l, int r)
{
    if (r<l) return;
    if (r==l+1) return res[l]=1, void();
    for (int i=l+1; i<r; i++) if (((i-l+1)%2)==0&&query(l, i)) return solve(l, i), solve(i+1, r), void();
    res[l]=1;
    solve(l+1, r-1);
}

int main()
{
    cin>>n>>q;
    solve(1, n);
    cout<<"! ";
    for (int i=1; i<=n;i ++) cout<<(res[i]?'(':')');
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 21 ms 440 KB Output is correct
4 Correct 25 ms 344 KB Output is correct
5 Correct 42 ms 432 KB Output is correct
6 Correct 57 ms 344 KB Output is correct
7 Correct 712 ms 344 KB Output is correct
8 Correct 33 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Mismatch at position 1. Expected ), found (
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 257 ms 1360 KB Output is correct
3 Runtime error 576 ms 420 KB Execution killed with signal 13
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Mismatch at position 1. Expected ), found (
2 Halted 0 ms 0 KB -