# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386643 | loctildore | Zagrade (COI20_zagrade) | C++14 | 1152 ms | 1428 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;
#define ll long long
#define f first
#define s second
#define x first
#define y second
#define elif else if
//#define endl '\n'
#define all(x) begin(x), end(x)
int n,q;
vector<int> sk;
int arr[100069];
int temp;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n>>q;
sk.push_back(0);
for (int i = 1; i < n; i++) {
cout<<"? "<<*sk.rbegin()+1<<' '<<i+1<<endl;
cin>>temp;
if (temp) {
arr[*sk.rbegin()]=true;
sk.pop_back();
}
else{
sk.push_back(i);
}
}
for (int i = sk.size()/2; i < sk.size(); i++) {
arr[sk[i]]=true;
}
cout<<"! ";
for (int i = 0; i < n; i++) {
cout<<(arr[i]?'(':')');
}
cout<<endl;
return 0;
}
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... |