oj.uz

답안 #557803

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557803 2022-05-06T04:38:33 Z Yazan_Alattar Zagrade (COI20_zagrade) C++14
100 / 100
 837 ms 924 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);
        else ans[v.back()] = '(', v.pop_back(), ans[i] = ')';
    }

    int rem = v.size() / 2;
    while(rem--) ans[v.back()] = '(', v.pop_back();
    while(v.size()) ans[v.back()] = ')', v.pop_back();

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

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 13 ms 208 KB Output is correct
4 Correct 9 ms 208 KB Output is correct
5 Correct 11 ms 208 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 9 ms 304 KB Output is correct
8 Correct 8 ms 208 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 8 ms 312 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 8 ms 308 KB Output is correct
5 Correct 9 ms 304 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct

Subtask #3
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 318 ms 468 KB Output is correct
3 Correct 775 ms 476 KB Output is correct
4 Correct 794 ms 416 KB Output is correct
5 Correct 746 ms 420 KB Output is correct
6 Correct 837 ms 384 KB Output is correct
7 Correct 606 ms 680 KB Output is correct
8 Correct 760 ms 480 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 722 ms 924 KB Output is correct
3 Correct 786 ms 584 KB Output is correct
4 Correct 730 ms 804 KB Output is correct
5 Correct 819 ms 588 KB Output is correct
6 Correct 603 ms 748 KB Output is correct
7 Correct 659 ms 720 KB Output is correct
8 Correct 653 ms 600 KB Output is correct