oj.uz

Submission #390967

# Submission time Handle Problem Language Result Execution time Memory
390967 2021-04-17T12:57:11 Z IloveN Pyramid Base (IOI08_pyramid_base) C++14
70 / 100
 5000 ms 102612 KB 
#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(),vr.end()
#define vi vector<int>
#define vll vector<ll>
#define ui unsigned int
const int N=1e6+10;

struct segment_tree
{
    int it[N*4],lazy[N*4];
    int n;

    void down(int id)
    {
        int x=lazy[id];
        lazy[id]=0;
        it[id*2]+=x;
        lazy[id*2]+=x;
        it[id*2+1]+=x;
        lazy[id*2+1]+=x;
    }

    void update(int id,int l,int r,int u,int v,int x)
    {
        if (l>v || r<u) return;
        if (u<=l && r<=v)
        {
            it[id]+=x;
            lazy[id]+=x;
            return;
        }
        down(id);
        int mid=(l+r)/2;
        update(id*2,l,mid,u,v,x);
        update(id*2+1,mid+1,r,u,v,x);
        it[id]=min(it[id*2],it[id*2+1]);
    }

    void init(int x)
    {
        n=x;
        memset(it,0,sizeof(it));
        memset(lazy,0,sizeof(lazy));
    }

    void upd(int u,int v,int x) { update(1,1,n,u,v,x);}

    ll get() { return it[1];}
} seg;

struct obs{int x1,x2,y1,y2,c;};
obs a[N];
int n,m,B,p;

struct event{int l,r,x;};
vector<event> vt[N];

bool check(int l)
{
    for (int i=1;i<=m;i++) vt[i].clear();
    for (int i=1;i<=p;i++)
    {
        int x1=max(a[i].x1-l+1,1);
        int y1=max(a[i].y1-l+1,1);
        int x2=min(a[i].x2,m-l+1);
        int y2=min(a[i].y2,n-l+1);
        if (x1>x2 || y1>y2) continue;
        int c=a[i].c;
        vt[x1].pb({y1,y2,c});
        vt[x2+1].pb({y1,y2,-c});
    }
    seg.init(n-l+1);
    for (int i=1;i<=m-l+1;i++)
    {
        for (event e : vt[i]) seg.upd(e.l,e.r,e.x);
        if (seg.get()<=B) return true;
    }
    return false;
}

int main()
{
    //freopen("ss.inp","r",stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>m>>n>>B>>p;
    for (int i=1;i<=p;i++) cin>>a[i].x1>>a[i].y1>>a[i].x2>>a[i].y2>>a[i].c,a[i].c=min(a[i].c,B+1);
    int l=1,r=min(m,n),ans=0;
    while (l<=r)
    {
        int mid=(l+r)/2;
        if (check(mid)) ans=mid,l=mid+1;
        else r=mid-1;
    }
    cout<<ans;
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 54988 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 55040 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 55176 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 55300 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 55424 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 55564 KB Output is correct
2 Correct 261 ms 55592 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 55700 KB Output is correct
2 Correct 177 ms 55444 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 56260 KB Output is correct
2 Correct 129 ms 55748 KB Output is correct
3 Correct 123 ms 55832 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 58688 KB Output is correct
2 Correct 447 ms 58500 KB Output is correct
3 Correct 374 ms 58884 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 62940 KB Output is correct
2 Correct 137 ms 60028 KB Output is correct
3 Correct 243 ms 57764 KB Output is correct
4 Correct 727 ms 65200 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 711 ms 65588 KB Output is correct
2 Correct 1324 ms 67072 KB Output is correct
3 Correct 268 ms 62980 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 501 ms 65888 KB Output is correct
2 Correct 1740 ms 69308 KB Output is correct
3 Correct 1587 ms 68984 KB Output is correct
4 Correct 1778 ms 69500 KB Output is correct
5 Correct 1747 ms 69316 KB Output is correct
6 Correct 213 ms 63972 KB Output is correct

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5102 ms 91696 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 5098 ms 96172 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 5107 ms 102612 KB Time limit exceeded
2 Halted 0 ms 0 KB -