Submission

(P---P)(------------PPP)

Score: 0

User: xdding

Problemset: Nostalgia v2

Language: cpp

Time: 0.075 second

Submitted On: 2025-01-23 15:15:51

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define t3 tuple<int,int,int>
using namespace std;
const int mxn=1e5+5;
ll t[4*mxn]{0},lz[4*mxn]{0};
void push(int i,int l,int r){
    t[i]+=lz[i];
    if(l<r)lz[2*i]+=lz[i],lz[2*i+1]+=lz[i];
    lz[i]=0;
}
void update(int i,int l,int r,int tl,int tr,ll v){
    push(i,l,r);
    if(r<tl||l>tr)return;
    if(r<=tr&&l>=tl){
        lz[i]+=v;push(i,l,r);return;
    }int m=(l+r)>>1;
    update(2*i,l,m,tl,tr,v);update(2*i+1,m+1,r,tl,tr,v);
    t[i]=min(t[2*i],t[2*i+1]);
}
void upd(int i,int l,int r,int idx,ll v){
    push(i,l,r);
    if(r<idx||l>idx)return;
    if(l==r)return void(t[i]=v);
    int m=(l+r)>>1;
    upd(2*i,l,m,idx,v);upd(2*i+1,m+1,r,idx,v);
    t[i]=min(t[2*i],t[2*i+1]);
}
ll a[mxn],b[mxn];
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;ll rs=0;
    for(int i=1;i<=n;i++)cin>>a[i],rs-=a[i];
    for(int i=1;i<=n;i++)cin>>b[i],rs+=a[i];
    for(int i=1;i<=n-1;i++)update(1,1,n,i+1,n,b[i]-a[i]);
    upd(1,1,n,1,rs);int cnt=0;if(t[1]>=0)cnt++;
    for(int i=2;i<=n;i++){
        update(1,1,n,1,n,a[i-1]-b[i-1]);
        upd(1,1,n,i,rs);
        if(t[1]>=0)cnt++;
    }cout<<cnt;
}