# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641577 | kebine | Zagrade (COI20_zagrade) | C++17 | 927 ms | 3056 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);
}
int x = 0;
for(int i = 0; i < n; i++) x += ans[i] == -1;
x /= 2;
while(!s.empty()) s.erase(s.begin());
bool ok = 0;
for(int i = 0; i < n; i++) {
if(ans[i] != -1) continue;
if(s.size() >= x) ok = 1;
if(!ok) s.insert(i);
if(ok) {
cout << *s.rbegin() << '\n';
ans[*s.rbegin()] = 0;
ans[i] = 1;
s.erase(*s.rbegin());
}
}
cout << "! ";
for(int i = 0; i < n; i++) {
assert(ans[i] != -1);
if(ans[i]) cout << '(';
else cout << ')';
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |