oj.uz

답안 #931531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931531 2024-02-22T02:46:02 Z AnasAAF Foehn Phenomena (JOI17_foehn_phenomena) C++17
0 / 100
 54 ms 27484 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define float double
#define ld long double

int N = 2e5+10;
int n, S, T, Q;
vector<int>v(N);
vector<ll>tree(4*N);
vector<ll>lazy(4*N);

void update(int node, int l, int r, int ql, int qr, int val){
    //cout<<node<<" "<<l<<" "<<r<<" "<<ql<<" "<<qr<<" "<<val<<endl;
    if(lazy[node]!=0){
        tree[node]+=lazy[node]*(r-l+1);
        if(l!=r){
            lazy[node*2]+=lazy[node];
            lazy[node*2+1]+=lazy[node];
        }
        lazy[node]=0;
    }
    if(ql>r || qr<l)return;
    if(ql<=l && qr>=r){
        tree[node]+=(val*(r-l+1));
        //cout<<"BINGO"<<endl;
        if(l!=r){
            lazy[node*2]+=val;
            lazy[node*2+1]+=val;
        }
        return;
    }
    int mid = (l+r)/2;
    update(node*2, l, mid, ql, qr, val);
    update(node*2+1, mid+1, r, ql, qr, val);
}

int get(int node, int l, int r, int ind){
    if(lazy[node]!=0){
        tree[node]+=lazy[node]*(r-l+1);
        if(l!=r){
            lazy[node*2]+=lazy[node];
            lazy[node*2+1]+=lazy[node];
        }
        lazy[node]=0;
    }
    if(l==r)return tree[node];
    int mid = (l+r)/2;
    if(ind<=mid)get(node*2, l, mid, ind);
    else get(node*2+1, mid+1, r, ind);
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n>>Q>>S>>T;
    for(int i=0;i<=n;i++)cin>>v[i];
    int nxp2 = (1<<(int)ceil(log2(double(N))));
    for(int i=0;i<=n;i++){
        update(1, 0, nxp2, i, i, v[i]);
    }
    ll ans(0);
    for(int i=0;i<n;i++){
        if(v[i]<v[i+1])ans-=(v[i+1]-v[i])*S;
        else ans+=(v[i]-v[i+1])*T;
    }
    while(Q--){
        int l, r, x;cin>>l>>r>>x;
        int bl = get(1, 0, nxp2, l-1);
        int al = get(1, 0, nxp2, l);
        int br, ar;
        br = get(1, 0, nxp2, r);
        if(r!=n)ar = get(1, 0, nxp2, r+1);

        if(bl<al)ans+=(al-bl)*S;
        else ans-=(bl-al)*T;
        if(r!=n){
            if(br<ar)ans+=(ar-br)*S;
            else ans-=(br-ar)*T;
        }

        update(1, 0, nxp2, l, r, x);
        //for(int i=0;i<=n;i++)cout<<get(1, 0, nxp2, i)<<" ";
        //cout<<endl;

        bl = get(1, 0, nxp2, l-1);
        al = get(1, 0, nxp2, l);
        br = get(1, 0, nxp2, r);
        if(r!=n)ar = get(1, 0, nxp2, r+1);
        if(bl<al)ans-=(al-bl)*S;
        else ans+=(bl-al)*T;
        if(r!=n){
            if(br<ar)ans-=(ar-br)*S;
            else ans+=(br-ar)*T;
        }
        cout<<ans<<endl;
    }

    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int get(int, int, int, int)':
foehn_phenomena.cpp:52:1: warning: control reaches end of non-void function [-Wreturn-type]
   52 | }
      | ^
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:79:26: warning: 'ar' may be used uninitialized in this function [-Wmaybe-uninitialized]
   79 |             else ans-=(br-ar)*T;
      |                       ~~~^~~~

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 27484 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 54 ms 27472 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 13 ms 27484 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -