oj.uz

Submission #557724

# Submission time Handle Problem Language Result Execution time Memory
557724 2022-05-06T01:02:51 Z Yazan_Alattar Zagrade (COI20_zagrade) C++14
0 / 100
 1 ms 208 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 = 1007;
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 vist[M];

void solve(int l, int r){
    if(l > r) return;
    ans[l] = '(';
    ans[r] = ')';
    ++l; --r;

    for(int i = l + 1; i <= r; ++i){
        cout << "? " << l << " " << i << endl;
        bool ret; cin >> ret;
        cout.flush();

        if(ret){
            solve(l, i);
            if(i + 1 < r) solve(i + 1, r);
        }
    }
    return;
}

int main(){
//    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> q;
    ++q;
    while(q--){
        cout << "? 1 1\n";
        cout.flush();
        int ret;
        cin >> ret;
    }
    cout << "! ()";
//    solve(0, n + 1);

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

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -