oj.uz

Submission #1003810

# Submission time Handle Problem Language Result Execution time Memory
1003810 2024-06-20T18:09:03 Z mariaclara Zagrade (COI20_zagrade) C++17
0 / 100
 577 ms 1352 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e5+5;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define fr first
#define sc second

int n, q;
string ans;
int main() {

    cin >> n >> q;

    for(int i = 1; i <= n; i++) ans += '.';

    stack<int> fila;
    fila.push(1);

    for(int i = 2; i <= n; i++) {
        int x = fila.top(), aux;
        assert(1 <= x and x <= n);
        cout << "? " << x << " " << i << endl;
        cout.flush();
        cin >> aux;
        
        if(aux) {
            fila.pop();
            ans[x-1] = '(';
            ans[i-1] = ')';
            continue;
        }

        fila.push(i);
    }

    int s = sz(fila);
    for(int i = 1; i <= s; i++) {
        assert(fila.top() >= 1 and fila.top() <= n);
        if(i <= s/2) ans[fila.top()-1] = '(';
        else ans[fila.top()-1] = ')';
        fila.pop();
    }

    cout << "! " << ans << endl;
    cout.flush();
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 0 ms 344 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Runtime error 1 ms 344 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 1 ms 856 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 577 ms 1352 KB Output is correct
3 Runtime error 1 ms 856 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -