oj.uz

Submission #641576

# Submission time Handle Problem Language Result Execution time Memory
641576 2022-09-17T04:50:21 Z makanhulia Zagrade (COI20_zagrade) C++17
14 / 100
 3000 ms 5448 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
int main() 
{
    cin.tie(0); ios_base::sync_with_stdio(0);

    int n, q;
    cin >> n >> q;

    vector<int> ans(n, -1);
    set<int> s;
    s.insert(0);
    for(int i = 1; i < n; i++) {
        if(ans[i] != -1) continue;
        // cout << "Masuk " << i << '\n';
        while(!s.empty()) {
            int l = *s.rbegin(), r = i;
            if(l >= 0 && r < n) {
                cout << "? " << l + 1 << " " << r + 1 << endl;
                int x; cin >> x;
                if(x) {
                    ans[l] = 1;
                    ans[r] = 0;
                    s.erase(l);
                    i++;
                } else {
                    s.insert(r);
                    break;
                }
            } else {
                break;
            }
        }
        if(s.empty() && ans[i] == -1) s.insert(i);
    }

    for(int i = 0; i < n; i++) {
        if(ans[i] != -1) {
            int l = i - 1, r = i + 1;
            while(l >= 0 && ans[l] != -1) l--;
            while(r < n && ans[r] != -1) r++;
            if(l < 0 || r >= n) continue;
            while(l >= 0) {
                ans[l--] = 0;
                ans[r++] = 1;
            }
        }
    }

    bool all = 1;
    for(int i = 0; i < n; i++) {
        all &= ans[i] == -1;
    }

    if(all) {
        int l = n / 2 - 1, r = n / 2;
        while(l >= 0) {
            ans[l--] = 0;
            ans[r++] = 1;
        }
    }

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

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 4 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 208 KB Output is correct
6 Correct 14 ms 208 KB Output is correct
7 Correct 10 ms 336 KB Output is correct
8 Correct 7 ms 208 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 10 ms 348 KB Output is correct
3 Runtime error 11 ms 452 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 208 KB Output is correct
2 Execution timed out 3093 ms 592 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 671 ms 5448 KB Output is correct
3 Runtime error 2864 ms 2992 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -