Submission #1152397

#TimeUsernameProblemLanguageResultExecution timeMemory
1152397YSH2020Zagrade (COI20_zagrade)C++20
0 / 100
0 ms416 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, q; cin >> n >> q; //suppose this is a valid bracket sequence. int ans[n]; ans[0] = 0; ans[n-1] = 1; int s = 0, e = n-1; //you know s, e is a valid sequence while (e-s > 1) { cout << '?' << s+1 << ' ' << s+2 << '\n'; int x; cin >> x; if (x == 1) { ans[s+1] = 1; ans[s+2] = 0; s += 2; } else { ans[s+1] = 0; ans[e-1] = 1; s++; e--; } } for (int i = 0; i < n; i++) { if (ans[i] == 0) cout << '('; else cout << ')'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...