Submission #1152459

#TimeUsernameProblemLanguageResultExecution timeMemory
1152459YSH2020Zagrade (COI20_zagrade)C++20
0 / 100
120 ms808 KiB
#include <bits/stdc++.h> using namespace std; int ans[100005]; void solve(int s, int e) { ans[s] = 0; ans[e] = 1; if (e-s < 3) return; int last = s; for (int i = s+1; i <= e; i += 2) { cout << "? " << last+1 << ' ' << i+1 << '\n'; int x; cin >> x; if (x == 1) { solve(last+1, i-1); last = i+1; } } } int main() { int n, q; cin >> n >> q; //suppose this is a valid bracket sequence. solve(0, n-1); cout << "! "; 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...