# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706251 | 2023-03-06T07:55:00 Z | vjudge1 | Zagrade (COI20_zagrade) | C++17 | 1 ms | 208 KB |
#include <bits/stdc++.h> #include <array> #define all(v) (v.begin()), (v.end()) #define setall(a, val) for(auto& x : a) x = val #define ll long long clock_t start_time; double get_time() { return (double)(clock() - start_time) / CLOCKS_PER_SEC; } void init() { #ifndef ONLINE_JUDGE: FILE* _ = freopen("in.txt", "r", stdin); start_time = clock(); #endif } const ll MOD = 1e9 + 7; const ll N = 5e3 + 7; const ll M = 1e2 + 7; using namespace std; //#################################################################################### int main() { //ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); srand(time(0)); //init(); int n, q; cin >> n >> q; string s; stack<pair<char, int>> st; for (int i = 0; i < n; i++) { if (st.size()) { cout << "? " << st.top().second + 1 << ' ' << i + 1 << endl; int b; cin >> b; if (b == 1) { s += ')'; st.pop(); } else { s += '('; st.push({ '(', i }); } } else { s += '('; st.push({ '(', i }); } } cout << s << endl; cerr << get_time() << "s" << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Incorrect query () |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Incorrect query (( |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Incorrect query (()) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Incorrect query (((( |
2 | Halted | 0 ms | 0 KB | - |