# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
917591 | PotatoMan | Zagrade (COI20_zagrade) | C++14 | 502 ms | 1708 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 inf INT_MAX
#define longlonginf LONG_LONG_MAX
#define mod 998244353
#define MAXN 200005
#define pii pair<ll,ll>
#define ll long long
#define deb(x) cerr<<"[ "<<#x<<" = "<<x<<" ]";
#define yes() cout<<"YES\n";
#define no() cout<<"NO\n";
using namespace std;
ll n,k,m,q,cur,z;
ll ans = 0;
string subtask;
void solve(){
cin>>n>>q;
ll rem = n/2;
stack<int> s;
string res = string(n,'.');
for(int i = 1 ; i <= n ; i++){
if( s.empty() ) {
s.push(i);
continue;
}
cout<<"? "<<s.top()<<" "<<i<<endl;
cin>>k;
if(k){
res[s.top()-1] = '(';
# | 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... |