oj.uz

답안 #931536

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

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

void update(int node, ll l, ll r, ll ql, ll qr, ll 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;
    }
    ll mid = (l+r)/2;
    update(node*2, l, mid, ql, qr, val);
    update(node*2+1, mid+1, r, ql, qr, val);
    return;
}

ll get(int node, ll l, ll r, ll 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)return get(node*2, l, mid, ind);
    else return 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];
    ll nxp2 = (1<<(ll)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--){
        ll l, r, x;cin>>l>>r>>x;
        ll bl = get(1, 0, nxp2, l-1);
        ll al = get(1, 0, nxp2, l);
        ll 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 main()':
foehn_phenomena.cpp:80:26: warning: 'ar' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |             else ans-=(br-ar)*T;
      |                       ~~~^~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 20828 KB Output is correct
2 Correct 7 ms 20828 KB Output is correct
3 Correct 7 ms 20828 KB Output is correct
4 Correct 8 ms 20824 KB Output is correct
5 Correct 7 ms 20828 KB Output is correct
6 Correct 7 ms 20828 KB Output is correct
7 Correct 7 ms 20828 KB Output is correct
8 Correct 7 ms 20828 KB Output is correct
9 Correct 7 ms 20828 KB Output is correct
10 Correct 7 ms 20828 KB Output is correct
11 Correct 8 ms 20648 KB Output is correct
12 Correct 6 ms 20824 KB Output is correct
13 Correct 6 ms 20828 KB Output is correct
14 Correct 6 ms 20828 KB Output is correct
15 Correct 7 ms 20824 KB Output is correct
16 Correct 5 ms 20828 KB Output is correct
17 Correct 6 ms 20824 KB Output is correct
18 Correct 6 ms 20828 KB Output is correct
19 Correct 4 ms 20572 KB Output is correct
20 Correct 4 ms 20572 KB Output is correct
21 Correct 4 ms 20572 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 355 ms 22336 KB Output is correct
2 Correct 368 ms 23012 KB Output is correct
3 Correct 362 ms 23360 KB Output is correct
4 Correct 361 ms 23024 KB Output is correct
5 Correct 355 ms 29380 KB Output is correct
6 Correct 173 ms 28332 KB Output is correct
7 Correct 179 ms 28348 KB Output is correct
8 Correct 334 ms 29252 KB Output is correct
9 Correct 314 ms 29524 KB Output is correct
10 Correct 327 ms 28288 KB Output is correct
11 Correct 162 ms 28096 KB Output is correct
12 Correct 178 ms 28992 KB Output is correct
13 Correct 182 ms 29116 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 20828 KB Output is correct
2 Correct 7 ms 20828 KB Output is correct
3 Correct 7 ms 20828 KB Output is correct
4 Correct 8 ms 20824 KB Output is correct
5 Correct 7 ms 20828 KB Output is correct
6 Correct 7 ms 20828 KB Output is correct
7 Correct 7 ms 20828 KB Output is correct
8 Correct 7 ms 20828 KB Output is correct
9 Correct 7 ms 20828 KB Output is correct
10 Correct 7 ms 20828 KB Output is correct
11 Correct 8 ms 20648 KB Output is correct
12 Correct 6 ms 20824 KB Output is correct
13 Correct 6 ms 20828 KB Output is correct
14 Correct 6 ms 20828 KB Output is correct
15 Correct 7 ms 20824 KB Output is correct
16 Correct 5 ms 20828 KB Output is correct
17 Correct 6 ms 20824 KB Output is correct
18 Correct 6 ms 20828 KB Output is correct
19 Correct 4 ms 20572 KB Output is correct
20 Correct 4 ms 20572 KB Output is correct
21 Correct 4 ms 20572 KB Output is correct
22 Correct 355 ms 22336 KB Output is correct
23 Correct 368 ms 23012 KB Output is correct
24 Correct 362 ms 23360 KB Output is correct
25 Correct 361 ms 23024 KB Output is correct
26 Correct 355 ms 29380 KB Output is correct
27 Correct 173 ms 28332 KB Output is correct
28 Correct 179 ms 28348 KB Output is correct
29 Correct 334 ms 29252 KB Output is correct
30 Correct 314 ms 29524 KB Output is correct
31 Correct 327 ms 28288 KB Output is correct
32 Correct 162 ms 28096 KB Output is correct
33 Correct 178 ms 28992 KB Output is correct
34 Correct 182 ms 29116 KB Output is correct
35 Correct 360 ms 27728 KB Output is correct
36 Correct 362 ms 29008 KB Output is correct
37 Correct 366 ms 29888 KB Output is correct
38 Correct 356 ms 29760 KB Output is correct
39 Correct 373 ms 30056 KB Output is correct
40 Correct 359 ms 29784 KB Output is correct
41 Correct 361 ms 29408 KB Output is correct
42 Correct 368 ms 30304 KB Output is correct
43 Correct 366 ms 28936 KB Output is correct
44 Correct 363 ms 29280 KB Output is correct
45 Correct 354 ms 29228 KB Output is correct
46 Correct 367 ms 30488 KB Output is correct
47 Correct 181 ms 29040 KB Output is correct
48 Correct 169 ms 29012 KB Output is correct
49 Correct 348 ms 27852 KB Output is correct
50 Correct 173 ms 28728 KB Output is correct
51 Correct 179 ms 29244 KB Output is correct
52 Correct 194 ms 29012 KB Output is correct