답안 #557800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557800 2022-05-06T04:24:57 Z Yazan_Alattar Zagrade (COI20_zagrade) C++14
71 / 100
742 ms 932 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 = 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;

vector <int> v;
char ans[M];
int n, q;

int ask(int l, int r){
    cout << "? " << l << " " << r << endl;
    cout.flush();

    int ret; cin >> ret;
    return ret;
}


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

    for(int i = 1; i <= n; ++i){
        if(v.empty() || !ask(v.back(), i)) v.pb(i), ans[i] = '(';
        else v.pop_back(), ans[i] = ')';
    }

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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 10 ms 208 KB Output is correct
5 Correct 11 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 11 ms 308 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Mismatch at position 1. Expected ), found (
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 294 ms 448 KB Output is correct
3 Correct 742 ms 624 KB Output is correct
4 Correct 674 ms 628 KB Output is correct
5 Correct 697 ms 676 KB Output is correct
6 Correct 603 ms 636 KB Output is correct
7 Correct 643 ms 932 KB Output is correct
8 Correct 685 ms 584 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 208 KB Mismatch at position 1. Expected ), found (
2 Halted 0 ms 0 KB -