# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
559788 | A_D | Zagrade (COI20_zagrade) | C++14 | 982 ms | 276 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>
#define int long long
#define ii pair<int,int>
#define F first
#define S second
using namespace std;
void solve()
{
int n,q;
cin>>n>>q;
string s(n,'0');
int h=n;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j+=2){
if(i>=n||j>=n){
cout<<"! "<<s<<endl;
return;
}
cout<<"? "<<i+1<<" "<<j+1<<endl;
int x;
cin>>x;
if(x==1){
h-=2;
s[i]='(';
s[j]=')';
}
}
}
cout<<"! "<<s<<endl;
return;
h/=2;
for(int i=0;i<n;i++){
if(s[i]=='0'){
if(h>0){
s[i]=')';
}
else{
s[i]='(';
}
h--;
}
}
cout<<"! "<<s<<endl;
}
main()
{
/*
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//*/
int t=1;
// cin>>t;
while(t--){
solve();
}
}
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... |