Submission #641575

#TimeUsernameProblemLanguageResultExecution timeMemory
641575devariaotaZagrade (COI20_zagrade)C++17
71 / 100
881 ms5484 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { cin.tie(0); ios_base::sync_with_stdio(0); int n, q; cin >> n >> q; vector<int> ans(n, -1); set<int> s; s.insert(0); for(int i = 1; i < n; i++) { if(ans[i] != -1) continue; // cout << "Masuk " << i << '\n'; while(!s.empty()) { int l = *s.rbegin(), r = i; if(l >= 0 && r < n) { cout << "? " << l + 1 << " " << r + 1 << endl; int x; cin >> x; if(x) { ans[l] = 1; ans[r] = 0; s.erase(l); i++; } else { s.insert(r); break; } } else { break; } } if(s.empty() && ans[i] == -1) s.insert(i); } for(int i = 0; i < n; i++) { int j = i; while(j < n && ans[j] == -1) j++; int l = (i + j) / 2 - 1, r = (i + j) / 2; while(l >= 0 && ans[l] == -1) { ans[l] = 0, ans[r] = 1; l--, r++; } } cout << "! "; for(int i = 0; i < n; i++) { assert(ans[i] != -1); if(ans[i]) 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...