oj.uz

Submission #73994

# Submission time Handle Problem Language Result Execution time Memory
73994 2018-08-29T14:34:10 Z edisonhello Teams (IOI15_teams) C++14
77 / 100
 4000 ms 445908 KB 
// #include"teams.h"
#include<bits/stdc++.h>
#pragma GCC optimize("no-stack-protector")
#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,tune=native")
using namespace std;

struct node{
    node *l,*r;
    int v;
    node():l(0),r(0),v(0){}
} *root[500005],pool[500005*35];

node *gn(node *ref=0){
    static int ptr=-1; ++ptr;
    if(ref){
        pool[ptr].l=ref->l;
        pool[ptr].r=ref->r;
        pool[ptr].v=ref->v;
    }
    return &pool[ptr];
}

int n;
pair<int,int> p[500005];

#define mid ((l+r)>>1)
void build(node *now,int l,int r){
    if(l==r)return;
    build(now->l=gn(),l,mid);
    build(now->r=gn(),mid+1,r);
}

void modify(node *now,int l,int r,int x){
    ++now->v;
    if(l==r){ return; }
    if(x<=mid)modify(now->l=gn(now->l),l,mid,x);
    else modify(now->r=gn(now->r),mid+1,r,x);
}

int query(node *nl,node *nr,int l,int r,int ql,int qr){
    if(r<ql || qr<l)return 0;
    // cout<<"query range "<<l<<" to "<<r<<" cur v: "<<nl->v<<" and "<<nr->v<<endl;
    if(ql<=l&&r<=qr)return nr->v-nl->v;
    return query(nl->l,nr->l,l,mid,ql,qr)+query(nl->r,nr->r,mid+1,r,ql,qr);
}

void init(int _n,int _a[],int _b[]){
    n=_n; 
    for(int i=0;i<n;++i)p[i+1]={_a[i],_b[i]};
    sort(p+1,p+n+1);
    build(root[0]=gn(),1,n);
    int ptr=1;
    for(int i=1;i<=n;++i){
        root[i]=gn(root[i-1]);
        while(ptr<=n && p[ptr].first<=i)modify(root[i]=gn(root[i]),1,n,p[ptr].second),++ptr;
    }
}

namespace naive{
struct node{
    node *l,*r;
    int sz,pri,val;
    int lz(){ return l?l->sz:0; }
    int rz(){ return r?r->sz:0; }
    void pull(){ sz=lz()+rz()+1; }
    node(int v=0):l(0),r(0),sz(1),pri(rand()),val(v){}
} *root,pool[500005];

int _ptr;
node *gnode(int v){
    pool[_ptr].l=0;
    pool[_ptr].r=0;
    pool[_ptr].sz=1;
    pool[_ptr].val=v;
    return &pool[_ptr++];
}

node *merge(node *a,node *b){
    if(!a)return b; if(!b)return a;
    if(a->pri>b->pri){
        a->r=merge(a->r,b);
        a->pull();
        return a;
    }
    else{
        b->l=merge(a,b->l);
        b->pull();
        return b;
    }
}

void split_val(node *now,int val,node *&a,node *&b){
    if(!now){ a=b=0; return; }
    if(now->val<=val){
        a=now;
        split_val(now->r,val,a->r,b);
        a->pull();
    }
    else{
        b=now;
        split_val(now->l,val,a,b->l);
        b->pull();
    }
}

void split_sz(node *now,int sz,node *&a,node *&b){
    if(!now){ a=b=0; return; }
    if(now->lz()>=sz){
        b=now;
        split_sz(now->l,sz,a,b->l);
        b->pull();
    }
    else{
        a=now;
        split_sz(now->r,sz-1-now->lz(),a->r,b);
        a->pull();
    }
}

int solve(int m,int k[]){
    _ptr=0;
    int ptr=1;
    for(int i=0;i<m;++i){
        while(ptr<=n && p[ptr].first<=k[i]){
            node *a,*b;
            split_val(root,p[ptr].second,a,b);
            root=merge(merge(a,gnode(p[ptr].second)),b);
            ++ptr;
        }
        node *a,*b;
        split_val(root,k[i]-1,a,b);
        if(!b || b->sz<k[i]){
            root=0;
            return 0;
        }
        node *c,*d;
        split_sz(b,k[i],c,d);
        root=d;
    }
    return 1;
}

}

#define BOUND 440
int dp[BOUND+4];
int can(int m,int k[]){
    sort(k,k+m);
    // return naive::solve(m,k);
    if(m>BOUND)return naive::solve(m,k);
    else{
        memset(dp,0x3f,sizeof(dp));
        for(int i=0;i<m;++i){
            int mn=9897788;
            for(int j=0;j<=i;++j){
                if(j==0)mn=query(root[0],root[k[i]],1,n,k[i],n);
                else mn=min(mn,dp[j-1]+query(root[k[j-1]],root[k[i]],1,n,k[i],n));
                // cout<<"j: "<<j<<" , mn: "<<mn<<endl;
            }
            dp[i]=mn-k[i];
            // cout<<"at "<<i<<" , dp: "<<dp[i]<<endl;
            if(dp[i]<0)return 0;
        }
        return 1;
    }
}

#ifdef WEAK
int l[500005],r[500005];
int main(){
    int n; cin>>n;
    for(int i=0;i<n;++i)cin>>l[i]>>r[i];
    init(n,l,r);
    int m; cin>>m; while(m--){
        int k; cin>>k;
        int *a=new int[k];
        for(int i=0;i<k;++i)cin>>a[i];
        cout<<can(k,a)<<endl;
    }
}
#endif

Compilation message

teams.cpp: In function 'naive::node* naive::merge(naive::node*, naive::node*)':
teams.cpp:79:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if(!a)return b; if(!b)return a;
     ^~
teams.cpp:79:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
     if(!a)return b; if(!b)return a;
                     ^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 427000 KB Output is correct
2 Correct 399 ms 427264 KB Output is correct
3 Correct 346 ms 427268 KB Output is correct
4 Correct 361 ms 427268 KB Output is correct
5 Correct 354 ms 427268 KB Output is correct
6 Correct 325 ms 427268 KB Output is correct
7 Correct 387 ms 427268 KB Output is correct
8 Correct 370 ms 427268 KB Output is correct
9 Correct 387 ms 427268 KB Output is correct
10 Correct 341 ms 427268 KB Output is correct
11 Correct 361 ms 427268 KB Output is correct
12 Correct 398 ms 427268 KB Output is correct
13 Correct 371 ms 427320 KB Output is correct
14 Correct 393 ms 427320 KB Output is correct
15 Correct 395 ms 427320 KB Output is correct
16 Correct 381 ms 427328 KB Output is correct
17 Correct 404 ms 427328 KB Output is correct
18 Correct 364 ms 427328 KB Output is correct
19 Correct 386 ms 427328 KB Output is correct
20 Correct 381 ms 427340 KB Output is correct
21 Correct 364 ms 427340 KB Output is correct
22 Correct 372 ms 427340 KB Output is correct
23 Correct 346 ms 427372 KB Output is correct
24 Correct 340 ms 427372 KB Output is correct
25 Correct 340 ms 427372 KB Output is correct
26 Correct 372 ms 427372 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 435 ms 429520 KB Output is correct
2 Correct 428 ms 429816 KB Output is correct
3 Correct 412 ms 429816 KB Output is correct
4 Correct 428 ms 430060 KB Output is correct
5 Correct 389 ms 430060 KB Output is correct
6 Correct 370 ms 430060 KB Output is correct
7 Correct 376 ms 430060 KB Output is correct
8 Correct 428 ms 430060 KB Output is correct
9 Correct 434 ms 430060 KB Output is correct
10 Correct 386 ms 430060 KB Output is correct
11 Correct 449 ms 430060 KB Output is correct
12 Correct 403 ms 430060 KB Output is correct
13 Correct 391 ms 430060 KB Output is correct
14 Correct 422 ms 430060 KB Output is correct
15 Correct 428 ms 430060 KB Output is correct
16 Correct 441 ms 430060 KB Output is correct
17 Correct 380 ms 430060 KB Output is correct
18 Correct 395 ms 430060 KB Output is correct

Subtask #3
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 430084 KB Output is correct
2 Correct 455 ms 430084 KB Output is correct
3 Correct 613 ms 432928 KB Output is correct
4 Correct 446 ms 432928 KB Output is correct
5 Correct 2158 ms 432928 KB Output is correct
6 Correct 1905 ms 432928 KB Output is correct
7 Correct 424 ms 432928 KB Output is correct
8 Correct 1290 ms 432928 KB Output is correct
9 Correct 435 ms 432928 KB Output is correct
10 Correct 465 ms 432928 KB Output is correct
11 Correct 1478 ms 432928 KB Output is correct
12 Correct 1699 ms 432928 KB Output is correct
13 Correct 806 ms 432928 KB Output is correct
14 Correct 702 ms 432928 KB Output is correct
15 Correct 465 ms 432928 KB Output is correct
16 Correct 541 ms 432928 KB Output is correct
17 Correct 671 ms 432928 KB Output is correct
18 Correct 611 ms 432928 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1063 ms 439848 KB Output is correct
2 Correct 1016 ms 439980 KB Output is correct
3 Correct 1815 ms 445908 KB Output is correct
4 Correct 939 ms 445908 KB Output is correct
5 Execution timed out 4066 ms 445908 KB Time limit exceeded
6 Halted 0 ms 0 KB -