oj.uz

Submission #308119

# Submission time Handle Problem Language Result Execution time Memory
308119 2020-09-30T04:24:41 Z ansol4328 Pyramid Base (IOI08_pyramid_base) C++14
70 / 100
 5000 ms 43372 KB 
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF=1e18;

struct SegTree{
    vector<ll> tree, lazy;
    int base;
    SegTree(int a){
        base=1;
        while(base<a) base<<=1;
        tree.resize(base*2+2);
        lazy.resize(base*2+2);
        base--;
    }
    void setup(int a){
        base=1;
        while(base<a) base<<=1;
        for(int i=1 ; i<base*2 ; i++) tree[i]=lazy[i]=0;
        for(int i=base+a ; i<base*2 ; i++) tree[i]=INF;
        for(int i=base-1 ; i>=1 ; i--) tree[i]=min(tree[i*2],tree[i*2+1]);
        base--;
        
    }
    void propagate(int ns, int nf, int num){
        if(lazy[num]!=0){
            if(ns<nf){
                lazy[num*2]+=lazy[num];
                lazy[num*2+1]+=lazy[num];
            }
            tree[num]+=lazy[num];
            lazy[num]=0;
        }
    }
    ll query(int ns=1, int nf=-1, int num=1){
        if(nf==-1) nf=base+1;
        propagate(ns,nf,num);
        return tree[num];
    }
    void add_value(ll val, int st, int fn, int ns=1, int nf=-1, int num=1){
        if(nf==-1) nf=base+1;
        propagate(ns,nf,num);
        if(ns>fn || nf<st) return;
        if(st<=ns && nf<=fn){
            lazy[num]+=val;
            propagate(ns,nf,num);
            return;
        }
        int mid=(ns+nf)>>1;
        add_value(val,st,fn,ns,mid,num*2);
        add_value(val,st,fn,mid+1,nf,num*2+1);
        tree[num]=min(tree[num*2],tree[num*2+1]);
    }
};

struct A{
    int x1, y1, x2, y2, c;
    A(){}
    A(int t1, int t2, int t3, int t4, int t5) : x1(t1), y1(t2), x2(t3), y2(t4), c(t5) {}
};

bool cmp(const A &lhs, const A &rhs){
    return lhs.y1==rhs.y1 ? lhs.y2<rhs.y2 : lhs.y1<rhs.y1;
}

int m, n, p;
ll b;
A ob[400005];
SegTree T(1000005);

bool pos(int w)
{
    T.setup(m-w+1);
    priority_queue<P,vector<P>,greater<P> > PQ;
    int idx=1, st, fn, k;
    for(int sy=1, fy=w ; fy<=n ; sy++, fy++){
        while(!PQ.empty() && PQ.top().first<sy){
            k=PQ.top().second; PQ.pop();
            st=max(1,ob[k].x1-w+1);
            fn=min(m-w+1,ob[k].x2);
            T.add_value(-ob[k].c,st,fn);
        }
        while(idx<=p && ob[idx].y1>=sy && ob[idx].y1<=fy){
            st=max(1,ob[idx].x1-w+1);
            fn=min(m-w+1,ob[idx].x2);
            T.add_value(ob[idx].c,st,fn);
            PQ.push(P(ob[idx].y2,idx));
            idx++;
        }
        if(T.query()<=b) return true;
    }
    return false;
}

int main()
{
    scanf("%d %d",&m,&n);
    scanf("%lld",&b);
    scanf("%d",&p);
    for(int i=1 ; i<=p ; i++){
        scanf("%d %d %d %d %d",&ob[i].x1,&ob[i].y1,&ob[i].x2,&ob[i].y2,&ob[i].c);
    }
    sort(ob+1,ob+1+p,cmp);
    int st=1, fn=min(m,n), mid, ans=0;
    while(st<=fn){
        mid=(st+fn)>>1;
        if(pos(mid)) st=mid+1, ans=mid;
        else fn=mid-1;
    }
    printf("%d",ans);
    return 0;
}

Compilation message

pyramid_base.cpp: In function 'int main()':
pyramid_base.cpp:99:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   99 |     scanf("%d %d",&m,&n);
      |     ~~~~~^~~~~~~~~~~~~~~
pyramid_base.cpp:100:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  100 |     scanf("%lld",&b);
      |     ~~~~~^~~~~~~~~~~
pyramid_base.cpp:101:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  101 |     scanf("%d",&p);
      |     ~~~~~^~~~~~~~~
pyramid_base.cpp:103:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  103 |         scanf("%d %d %d %d %d",&ob[i].x1,&ob[i].y1,&ob[i].x2,&ob[i].y2,&ob[i].c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33152 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33152 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33152 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 33228 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 33152 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 33152 KB Output is correct
2 Correct 260 ms 33272 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 33368 KB Output is correct
2 Correct 117 ms 33152 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 33408 KB Output is correct
2 Correct 70 ms 33408 KB Output is correct
3 Correct 88 ms 33280 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 33528 KB Output is correct
2 Correct 528 ms 33720 KB Output is correct
3 Correct 441 ms 33692 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 33840 KB Output is correct
2 Correct 327 ms 34088 KB Output is correct
3 Correct 52 ms 33784 KB Output is correct
4 Correct 1280 ms 33912 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 870 ms 34152 KB Output is correct
2 Correct 1620 ms 34040 KB Output is correct
3 Correct 377 ms 34144 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 612 ms 34524 KB Output is correct
2 Correct 2250 ms 34288 KB Output is correct
3 Correct 1964 ms 34220 KB Output is correct
4 Correct 2192 ms 34216 KB Output is correct
5 Correct 2045 ms 34192 KB Output is correct
6 Correct 255 ms 34364 KB Output is correct

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5076 ms 38384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5072 ms 41580 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5075 ms 43372 KB Time limit exceeded
2 Halted 0 ms 0 KB -