oj.uz

Submission #577106

# Submission time Handle Problem Language Result Execution time Memory
577106 2022-06-14T05:39:03 Z zaneyu Zagrade (COI20_zagrade) C++14
100 / 100
 915 ms 1080 KB 
/*input
2
1 2
0 1
4
1
1 2
1 
2 3
3
2
4
0
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
int mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
int query(int l,int r){
    cout<<"? "<<l+1<<' '<<r+1<<endl;
    int x;
    cin>>x;
    return x;
}
int32_t main(){
    int n,q;
    cin>>n>>q;
    vector<int> v;
    string ans(n,'(');
    REP(i,n){
        if(!sz(v)){
            v.pb(i);
            continue;
        }
        if(query(v.back(),i)){
            ans[v.back()]='(';
            ans[i]=')';
            v.pop_back();
        }
        else{
            v.pb(i);
        }
    }
    REP(i,sz(v)/2) ans[v[i]]=')';
    REP(i,sz(v)/2) ans[v[i+sz(v)/2]]='(';
    cout<<"! "<<ans<<endl;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 10 ms 208 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 8 ms 296 KB Output is correct
8 Correct 8 ms 208 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 9 ms 300 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Correct 9 ms 208 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 8 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 468 ms 376 KB Output is correct
3 Correct 741 ms 372 KB Output is correct
4 Correct 721 ms 392 KB Output is correct
5 Correct 692 ms 384 KB Output is correct
6 Correct 915 ms 380 KB Output is correct
7 Correct 618 ms 868 KB Output is correct
8 Correct 813 ms 384 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 542 ms 1080 KB Output is correct
3 Correct 541 ms 800 KB Output is correct
4 Correct 709 ms 896 KB Output is correct
5 Correct 778 ms 744 KB Output is correct
6 Correct 839 ms 860 KB Output is correct
7 Correct 714 ms 636 KB Output is correct
8 Correct 844 ms 380 KB Output is correct