Submission #314772

# Submission time Handle Problem Language Result Execution time Memory
314772 2020-10-21T06:59:50 Z apostoldaniel854 Zagrade (COI20_zagrade) C++14
71 / 100
1082 ms 888 KB
#include <bits/stdc++.h>

using namespace std;

bool ask (int a, int b) {
    cout << "? " << a << " " << b << endl;
    int ans;
    cin >> ans;
    return ans;
}

int main () {
    int n, Q;
    cin >> n >> Q;
    vector <int> unpaired (1, 1);
    vector <char> sol (n + 1);
    for (int i = 2; i <= n; i++) {
        if (unpaired.size () && ask (unpaired.back (), i)) {
            sol[unpaired.back ()] = '(';
            sol[i] = ')';
            unpaired.pop_back ();
        }
        else {
            unpaired.push_back (i);
        }
    }
    int sz = unpaired.size ();
    for (int i = 0; i < sz / 2; i++)
        sol[unpaired[i]] = '(';
    for (int i = sz / 2 + 1; i < sz; i++)
        sol[unpaired[i]] = ')';
    cout << "! ";
    for (int i = 1; i <= n; i++)
        cout << sol[i];
    cout << endl;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 9 ms 256 KB Output is correct
4 Correct 11 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 8 ms 256 KB Output is correct
7 Correct 9 ms 256 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Mismatch at position 1. Expected ), found (
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 437 ms 384 KB Output is correct
3 Correct 865 ms 384 KB Output is correct
4 Correct 773 ms 384 KB Output is correct
5 Correct 1082 ms 384 KB Output is correct
6 Correct 925 ms 384 KB Output is correct
7 Correct 842 ms 888 KB Output is correct
8 Correct 977 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Mismatch at position 1. Expected ), found (
2 Halted 0 ms 0 KB -