Submission #1267283

#TimeUsernameProblemLanguageResultExecution timeMemory
1267283zulmuwZagrade (COI20_zagrade)C++20
0 / 100
0 ms408 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int n, q; signed main() { cin >> n >> q; vector<int> ans(n+1, -1); int found = 0; for (int i=1; i<n; ++i) { cout << "? " << i << " " << i+1 << endl; int res; cin >> res; if (res) { ans[i] = 1; ans[i+1] = 0; found += 2; } } // cout << "found " << found << "\n"; int cnt = 1; for (int i=1; i<=n; ++i) { if (ans[i] != -1) continue; if (cnt <= (n - found)/2) { ans[i] = 1; // cout << cnt << " " << (n-found)/2 << "\n\n\n"; } else { ans[i] = 0; } cnt++; } for (int i = 1; i <= n; ++i) { if (ans[i] == 1) cout << "("; else 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...