oj.uz

Submission #795024

# Submission time Handle Problem Language Result Execution time Memory
795024 2023-07-27T05:21:06 Z PoonYaPat Sjeckanje (COCI21_sjeckanje) C++14
110 / 110
 977 ms 45880 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll s[1<<19][3][3],c[200005],lz[1<<19];
int n,q;

void merge(int a, int b, int res) {
    for (int i=0; i<3; ++i) {
        for (int j=0; j<3; ++j) {
            s[res][i][j]=-1e15;
            for (int k=0; k<3; ++k) s[res][i][j]=max(s[res][i][j],s[a][i][k]+s[b][2-k][j]);

            if (i!=1) s[res][i][j]=max(s[res][i][j],s[b][i][j]);
            if (j!=1) s[res][i][j]=max(s[res][i][j],s[a][i][j]);
        }
    }
}

void push(int l, int r, int idx) {
    if (lz[idx]==-1e16) return;
    if (l!=r) {
        for (int i=0; i<3; ++i) {
            for (int j=0; j<3; ++j) {
                if (i==0) s[idx][i][j]-=lz[idx];
                if (i==2) s[idx][i][j]+=lz[idx];
                if (j==0) s[idx][i][j]-=lz[idx];
                if (j==2) s[idx][i][j]+=lz[idx];
            }
        }

        if (lz[2*idx]==-1e16) lz[2*idx]=lz[idx];
        else lz[2*idx]+=lz[idx];

        if (lz[2*idx+1]==-1e16) lz[2*idx+1]=lz[idx];
        else lz[2*idx+1]+=lz[idx];

        lz[idx]=-1e16;

    } else {
        c[l]+=lz[idx];

        s[idx][0][0]=-1e15;
        s[idx][0][1]=-c[l];
        s[idx][0][2]=-1e15;
        s[idx][1][0]=-c[l];
        s[idx][1][1]=0;
        s[idx][1][2]=c[l];
        s[idx][2][0]=-1e15;
        s[idx][2][1]=c[l];
        s[idx][2][2]=-1e15;

        lz[idx]=-1e16;
    }
}

void build(int l, int r, int idx) {
    if (l==r) {
        push(l,r,idx);
    } else {
        int mid=(l+r)/2;
        build(l,mid,2*idx);
        build(mid+1,r,2*idx+1);
        merge(2*idx,2*idx+1,idx);
    }
}

void update(int l, int r, int idx, int x, int y, ll val) {
    push(l,r,idx);
    if (x>r || y<l) return;

    if (x<=l && r<=y) {
        lz[idx]=val;
        push(l,r,idx);
    } else {
        int mid=(l+r)/2;
        update(l,mid,2*idx,x,y,val);
        update(mid+1,r,2*idx+1,x,y,val);
        merge(2*idx,2*idx+1,idx);
    }
}


int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    for (int i=0; i<(1<<19); ++i) for (int j=0; j<3; ++j) for (int k=0; k<3; ++k) s[i][j][k]=-1e15;
    for (int i=0; i<(1<<19); ++i) lz[i]=-1e16;

    cin>>n>>q;
    for (int i=1; i<=n; ++i) {
        int x; cin>>x;
        update(1,n,1,i,i,x);
    }

    while (q--) {
        int l,r; ll val;
        cin>>l>>r>>val;
        update(1,n,1,l,r,val);
        cout<<s[1][1][1]<<"\n";
    }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 41300 KB Output is correct
2 Correct 17 ms 41332 KB Output is correct
3 Correct 17 ms 41284 KB Output is correct
4 Correct 17 ms 41268 KB Output is correct
5 Correct 17 ms 41272 KB Output is correct
6 Correct 17 ms 41296 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 41300 KB Output is correct
2 Correct 17 ms 41332 KB Output is correct
3 Correct 17 ms 41284 KB Output is correct
4 Correct 17 ms 41268 KB Output is correct
5 Correct 17 ms 41272 KB Output is correct
6 Correct 17 ms 41296 KB Output is correct
7 Correct 28 ms 41360 KB Output is correct
8 Correct 27 ms 41448 KB Output is correct
9 Correct 24 ms 41320 KB Output is correct
10 Correct 24 ms 41336 KB Output is correct
11 Correct 24 ms 41404 KB Output is correct
12 Correct 24 ms 41340 KB Output is correct

Subtask #3
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 41300 KB Output is correct
2 Correct 17 ms 41332 KB Output is correct
3 Correct 17 ms 41284 KB Output is correct
4 Correct 17 ms 41268 KB Output is correct
5 Correct 17 ms 41272 KB Output is correct
6 Correct 17 ms 41296 KB Output is correct
7 Correct 28 ms 41360 KB Output is correct
8 Correct 27 ms 41448 KB Output is correct
9 Correct 24 ms 41320 KB Output is correct
10 Correct 24 ms 41336 KB Output is correct
11 Correct 24 ms 41404 KB Output is correct
12 Correct 24 ms 41340 KB Output is correct
13 Correct 897 ms 45688 KB Output is correct
14 Correct 897 ms 45748 KB Output is correct
15 Correct 880 ms 45720 KB Output is correct
16 Correct 902 ms 45760 KB Output is correct
17 Correct 954 ms 45636 KB Output is correct
18 Correct 977 ms 45880 KB Output is correct