# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641596 | 2022-09-17T06:25:17 Z | gun_gan | Zagrade (COI20_zagrade) | C++17 | 889 ms | 5400 KB |
#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; 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) { 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Correct | 5 ms | 208 KB | Output is correct |
3 | Correct | 9 ms | 208 KB | Output is correct |
4 | Correct | 10 ms | 208 KB | Output is correct |
5 | Correct | 4 ms | 208 KB | Output is correct |
6 | Correct | 8 ms | 324 KB | Output is correct |
7 | Correct | 4 ms | 316 KB | Output is correct |
8 | Correct | 9 ms | 208 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 9 ms | 328 KB | Output is correct |
3 | Correct | 6 ms | 320 KB | Output is correct |
4 | Correct | 11 ms | 336 KB | Output is correct |
5 | Correct | 10 ms | 324 KB | Output is correct |
6 | Correct | 9 ms | 328 KB | Output is correct |
7 | Correct | 8 ms | 208 KB | Output is correct |
8 | Correct | 8 ms | 208 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 387 ms | 700 KB | Output is correct |
3 | Correct | 850 ms | 720 KB | Output is correct |
4 | Correct | 760 ms | 720 KB | Output is correct |
5 | Correct | 715 ms | 704 KB | Output is correct |
6 | Correct | 879 ms | 704 KB | Output is correct |
7 | Correct | 810 ms | 3248 KB | Output is correct |
8 | Correct | 806 ms | 704 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 611 ms | 5400 KB | Output is correct |
3 | Correct | 874 ms | 1664 KB | Output is correct |
4 | Correct | 839 ms | 3076 KB | Output is correct |
5 | Correct | 750 ms | 1556 KB | Output is correct |
6 | Correct | 889 ms | 3096 KB | Output is correct |
7 | Correct | 651 ms | 2320 KB | Output is correct |
8 | Correct | 679 ms | 836 KB | Output is correct |