Submission #72039083

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N=500100,INF=2e18,MOD=998244353;
int t,n,k,x,y,z,m,h,j,u,cnt,mi,tt,rr,mx,res,ans,ll,q;
int a[N],b[N],c[N];
signed main(){
    cin>>n;
    vector<int>aa(n+5);
    vector<int>bb(n+5);
    vector<int>cc(n+5);
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        cin>>b[i];
    }
    for(int i=1;i<=n;i++){
        cin>>c[i];
    }
    for(int i=1;i<=n;i++){
        aa[i]=aa[i-1]+a[i];
    }
    for(int i=1;i<=n;i++){
        bb[i]=bb[i-1]+b[i];
    }
    for(int i=1;i<=n;i++){
        cc[i]=cc[i-1]+c[i];
    }
    vector<int>f1(n+5);
    vector<int>f2(n+5);
    for(int i=1;i<=n-1;i++){
        f1[i]=f1[i-1]+a[i]-b[i];
        f2[i]=f2[i-1]+b[i]-c[i];
    }
    res=-INF;
    for(int i=1;i<=n;i++){
        ans+=c[i];
    }
    tt=0;
    mx=-INF;
    for(int i=2;i<n;i++){
        mx=max(mx,f1[i-1]);
        tt=mx+f2[i];
        res=max(tt,res);
    }
    ans+=res;
    cout<<ans;




}

Submission Info

Submission Time
Task D - Tail of Snake
User mengqing
Language C++23 (GCC 15.2.0)
Score 400
Code Size 1072 Byte
Status AC
Exec Time 184 ms
Memory 22096 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 38
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3404 KiB
sample01.txt AC 1 ms 3596 KiB
sample02.txt AC 1 ms 3596 KiB
testcase00.txt AC 1 ms 3624 KiB
testcase01.txt AC 1 ms 3496 KiB
testcase02.txt AC 1 ms 3556 KiB
testcase03.txt AC 147 ms 21996 KiB
testcase04.txt AC 147 ms 22096 KiB
testcase05.txt AC 152 ms 22084 KiB
testcase06.txt AC 146 ms 22068 KiB
testcase07.txt AC 146 ms 21996 KiB
testcase08.txt AC 147 ms 21960 KiB
testcase09.txt AC 165 ms 22068 KiB
testcase10.txt AC 165 ms 22096 KiB
testcase11.txt AC 165 ms 21960 KiB
testcase12.txt AC 146 ms 22092 KiB
testcase13.txt AC 146 ms 22072 KiB
testcase14.txt AC 146 ms 22080 KiB
testcase15.txt AC 120 ms 22072 KiB
testcase16.txt AC 121 ms 21960 KiB
testcase17.txt AC 61 ms 9424 KiB
testcase18.txt AC 163 ms 20048 KiB
testcase19.txt AC 184 ms 22072 KiB
testcase20.txt AC 129 ms 16444 KiB
testcase21.txt AC 108 ms 14300 KiB
testcase22.txt AC 184 ms 22076 KiB
testcase23.txt AC 28 ms 6148 KiB
testcase24.txt AC 134 ms 16840 KiB
testcase25.txt AC 184 ms 22096 KiB
testcase26.txt AC 104 ms 16824 KiB
testcase27.txt AC 128 ms 19996 KiB
testcase28.txt AC 143 ms 22072 KiB
testcase29.txt AC 97 ms 15964 KiB
testcase30.txt AC 102 ms 16732 KiB
testcase31.txt AC 143 ms 22068 KiB
testcase32.txt AC 136 ms 21196 KiB
testcase33.txt AC 117 ms 18636 KiB
testcase34.txt AC 143 ms 22068 KiB