| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 329573 | GioChkhaidze | Zagrade (COI20_zagrade) | C++14 | 5 ms | 384 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;
const int N=1e5+5;
char f[N];
int n,x,pr[N],nx[N];
main () {
cin>>n;
for (int i=0; i<=n+1; i++)
nx[i]=i+1,pr[i]=i-1;
int l=1,r=2,L,R,ans=n;
while (r<=n) {
cout<<"? "<<l<<" "<<r<<endl;
cin>>x;
--ans;
if (x) {
f[l]='(',f[r]=')';
if (1<=pr[l]) {
L=pr[l],R=nx[r];
nx[L]=R,pr[R]=L;
l=L,r=R;
}
else {
L=nx[r],R=nx[nx[r]];
pr[L]=pr[l];
l=L,r=R;
}
}
else {
L=r,R=nx[r];
l=L,r=R;
}
}
for (int i=1; i<=n; i++) {
if (f[i]!='(' && f[i]!=')') {
if (ans>0) f[i]=')',--ans;
else f[i]='(';
}
}
cout<<"! ";
for (int i=1; i<=n; i++)
cout<<f[i];
cout<<endl;
}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... | ||||
