Submission #1841921


Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for(LL i=0;i<(LL)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long
#define pii pair<LL,LL>
#define pll pair<LL,LL>

using namespace std;

struct SegmentTree{

    LL n;
    vector<LL> data;
    vector<LL> num;
    vector<LL> minusmax;
    vector<LL> plusmin;

    SegmentTree(LL _n){
        n = 2;
        while(n<_n)n*=2;
        data.resize(2*n-1, INT_MIN);
        num.resize(2*n-1, 0);
        minusmax.resize(2*n-1, INT_MIN);
        plusmin.resize(2*n-1, INT_MAX);
    }

    void set(LL pos, LL x){
        pos += n-1;
        data[pos]=x;
        if(x > 0){
            num[pos] = 1;
            plusmin[pos] = x;
            minusmax[pos] = INT_MIN;
        }else{
            num[pos]=0;
            minusmax[pos] = x;
            plusmin[pos] = INT_MAX;
        }
        while(pos > 0){
            pos = (pos-1)/2;
            data[pos] = (max(0LL, data[2*pos +1]) + max(0LL, data[2*pos +2]));
            num[pos] = num[2*pos +1] + num[2*pos + 2];
            minusmax[pos] = max(minusmax[2*pos + 1], minusmax[2*pos + 2]);
            plusmin[pos] = min(plusmin[2*pos + 1], plusmin[2*pos + 2]);
        }
    }

    LL getSum(LL l, LL r, LL a=0, LL b=-1, LL pos=0){
        if(b<0)b=n;
        if(l>=b || r <= a)return 0;
        if(l<=a && r <= b)return max(0LL,data[pos]);
        return getSum(l, r, a, (a+b)/2, pos*2+1) + getSum(l, r, (a+b)/2, b, pos*2+2);
    }
    LL getNum(LL l,LL r, LL a=0, LL b=-1, LL pos=0){
        if(b<0)b=n;
        if(l>=b || r <= a)return 0;
        if(l<=a && r <= b)return num[pos];
        return getNum(l, r, a, (a+b)/2, pos*2+1) + getNum(l, r, (a+b)/2, b, pos*2+2);
    }
    LL getMinusMax(LL l,LL r,LL a=0, LL b=-1, LL pos=0){
        if(b<0)b=n;
        if(l>=b || r <= a)return INT_MIN;
        if(l<=a && r <= b)return minusmax[pos];
        return max(getMinusMax(l, r, a, (a+b)/2, pos*2+1) ,getMinusMax(l, r, (a+b)/2, b, pos*2+2));
    }
    LL getPlusMin(LL l,LL r,LL a=0, LL b=-1, LL pos=0){
        if(b<0)b=n;
        if(l>=b || r <= a)return INT_MAX;
        if(l<=a && r <= b)return plusmin[pos];
        return min(getPlusMin(l, r, a, (a+b)/2, pos*2+1) ,getPlusMin(l, r, (a+b)/2, b, pos*2+2));
    }

    void printData(){
        cout<<endl;
        REP(i,n)cout<<n-1+i<<" "<<data[n-1+i]<<endl;
        cout<<endl;
    }
};


int main(){

    LL N,Q;cin>>N>>Q;
    LL ans=0;
    LL a[2*N], b[2*N];

    REP(i,2*N)cin>>a[i];
    REP(i,2*N)cin>>b[i];

    if(N==1){
        while(Q--){
            LL p,x,y;cin>>p>>x>>y;
            a[--p]=x;
            ans = a[0]+a[1];
            cout<<ans<<endl;
        }
    }else{
        REP(i,2*N)ans += a[i];
        SegmentTree st(2*N-2);
        REP(i,2*N-2)st.set(i, b[i+1]-a[i+1]);

        while(Q--){
            LL p,x,y;cin>>p>>x>>y;
            ans -= a[--p];
            a[p]=x;
            b[p]=y;
            ans += a[p];
            if(p != 0 && p != 2*N-1)st.set(p-1, y-x);

            LL res = ans + st.getSum(0,2*N-2);
            if(st.getNum(0,2*N-2)%2==1){
                res = max(res - st.getPlusMin(0,2*N-2), res + st.getMinusMax(0,2*N-2));
            }


            cout<<res<<endl;

        }
    }
    return 0;
}

Submission Info

Submission Time
Task C - Paired Parentheses
User inmir
Language C++14 (GCC 5.4.1)
Score 700
Code Size 3332 Byte
Status AC
Exec Time 491 ms
Memory 21248 KB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 200 / 200 300 / 300 200 / 200
Status
AC × 2
AC × 14
AC × 15
AC × 43
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
Subtask1 00_example_01.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt, s1_08.txt, s1_09.txt, s1_10.txt, s1_11.txt, s1_12.txt, s1_13.txt
Subtask2 s2_14.txt, s2_15.txt, s2_16.txt, s2_17.txt, s2_18.txt, s2_19.txt, s2_20.txt, s2_21.txt, s2_22.txt, s2_23.txt, s2_24.txt, s2_25.txt, s2_26.txt, s2_27.txt, s2_28.txt
All 00_example_01.txt, 00_example_02.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s1_07.txt, s1_08.txt, s1_09.txt, s1_10.txt, s1_11.txt, s1_12.txt, s1_13.txt, s2_14.txt, s2_15.txt, s2_16.txt, s2_17.txt, s2_18.txt, s2_19.txt, s2_20.txt, s2_21.txt, s2_22.txt, s2_23.txt, s2_24.txt, s2_25.txt, s2_26.txt, s2_27.txt, s2_28.txt, s3_29.txt, s3_30.txt, s3_31.txt, s3_32.txt, s3_33.txt, s3_34.txt, s3_35.txt, s3_36.txt, s3_37.txt, s3_38.txt, s3_39.txt, s3_40.txt, s3_41.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
s1_01.txt AC 1 ms 256 KB
s1_02.txt AC 1 ms 256 KB
s1_03.txt AC 1 ms 256 KB
s1_04.txt AC 1 ms 256 KB
s1_05.txt AC 1 ms 256 KB
s1_06.txt AC 1 ms 256 KB
s1_07.txt AC 1 ms 256 KB
s1_08.txt AC 1 ms 256 KB
s1_09.txt AC 1 ms 256 KB
s1_10.txt AC 1 ms 256 KB
s1_11.txt AC 1 ms 256 KB
s1_12.txt AC 1 ms 256 KB
s1_13.txt AC 1 ms 256 KB
s2_14.txt AC 8 ms 1408 KB
s2_15.txt AC 9 ms 1408 KB
s2_16.txt AC 105 ms 18816 KB
s2_17.txt AC 85 ms 10240 KB
s2_18.txt AC 148 ms 19712 KB
s2_19.txt AC 149 ms 19712 KB
s2_20.txt AC 150 ms 19712 KB
s2_21.txt AC 150 ms 19712 KB
s2_22.txt AC 8 ms 1408 KB
s2_23.txt AC 9 ms 1408 KB
s2_24.txt AC 8 ms 1408 KB
s2_25.txt AC 196 ms 19712 KB
s2_26.txt AC 194 ms 19712 KB
s2_27.txt AC 193 ms 19712 KB
s2_28.txt AC 194 ms 19712 KB
s3_29.txt AC 163 ms 10496 KB
s3_30.txt AC 244 ms 6144 KB
s3_31.txt AC 131 ms 19200 KB
s3_32.txt AC 402 ms 20352 KB
s3_33.txt AC 167 ms 10368 KB
s3_34.txt AC 463 ms 21248 KB
s3_35.txt AC 471 ms 21248 KB
s3_36.txt AC 491 ms 21248 KB
s3_37.txt AC 490 ms 21248 KB
s3_38.txt AC 491 ms 21248 KB
s3_39.txt AC 491 ms 21248 KB
s3_40.txt AC 248 ms 1024 KB
s3_41.txt AC 244 ms 1024 KB