oj.uz

Submission #557801

# Submission time Handle Problem Language Result Execution time Memory
557801 2022-05-06T04:26:12 Z Yazan_Alattar Zagrade (COI20_zagrade) C++14
71 / 100
 726 ms 948 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;

    int rem = n / 2;
    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] = ')', --rem;
    }

    cout << "! ";
    for(int i = 1; i <= n; ++i){
        if(ans[i]) cout << ans[i];
        else if(rem) cout << ')', --rem;
        else cout << '(';
    }
    cout << endl;
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 3 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 9 ms 208 KB Output is correct
5 Correct 9 ms 256 KB Output is correct
6 Correct 8 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Mismatch at position 1. Expected ), found (
2 Halted 0 ms 0 KB -

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 299 ms 428 KB Output is correct
3 Correct 593 ms 432 KB Output is correct
4 Correct 726 ms 436 KB Output is correct
5 Correct 724 ms 464 KB Output is correct
6 Correct 719 ms 596 KB Output is correct
7 Correct 680 ms 948 KB Output is correct
8 Correct 655 ms 420 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Mismatch at position 1. Expected ), found (
2 Halted 0 ms 0 KB -