oj.uz

Submission #631578

# Submission time Handle Problem Language Result Execution time Memory
631578 2022-08-18T09:02:16 Z PoonYaPat Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 142 ms 13072 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n,q;
ll s,t,c[200010],fen[200010],ans;

void update(int x, int val) {
    while (x<=n+5) {
        fen[x]+=val;
        x+=(x&-x);
    }
}

ll find(int x) {
    ll sum=c[x];
    while (x) {
        sum+=fen[x];
        x-=(x&-x);
    }
    return sum;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>q>>s>>t;
    for (int i=1; i<=n+1; ++i) {
        cin>>c[i];
        if (i>1) {
            if (c[i]>c[i-1]) ans-=(s*(c[i]-c[i-1]));
            else ans+=(t*(c[i-1]-c[i]));
        }
    }

    while (q--) {
        int a,b; ll val;
        cin>>a>>b>>val;
        ++a; ++b;

        if (a!=1) {
            ll pa=find(a-1), ha=find(a);
            if (pa<ha) ans+=s*(ha-pa);
            else ans-=t*(pa-ha);
            ha+=val;
            if (pa<ha) ans-=s*(ha-pa);
            else ans+=t*(pa-ha);
        }

        if (b!=n+1) {
            ll pb=find(b+1), hb=find(b);
            if (hb<pb) ans+=s*(pb-hb);
            else ans-=t*(hb-pb);
            hb+=val;
            if (hb<pb) ans-=s*(pb-hb);
            else ans+=t*(hb-pb);
        }

        update(a,val);
        update(b+1,-val);
        cout<<ans<<"\n";
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 10208 KB Output is correct
2 Correct 115 ms 10864 KB Output is correct
3 Correct 122 ms 11424 KB Output is correct
4 Correct 122 ms 10784 KB Output is correct
5 Correct 116 ms 12108 KB Output is correct
6 Correct 87 ms 9476 KB Output is correct
7 Correct 92 ms 9504 KB Output is correct
8 Correct 112 ms 11812 KB Output is correct
9 Correct 142 ms 12064 KB Output is correct
10 Correct 119 ms 10880 KB Output is correct
11 Correct 84 ms 9428 KB Output is correct
12 Correct 85 ms 10100 KB Output is correct
13 Correct 93 ms 10292 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 139 ms 10208 KB Output is correct
23 Correct 115 ms 10864 KB Output is correct
24 Correct 122 ms 11424 KB Output is correct
25 Correct 122 ms 10784 KB Output is correct
26 Correct 116 ms 12108 KB Output is correct
27 Correct 87 ms 9476 KB Output is correct
28 Correct 92 ms 9504 KB Output is correct
29 Correct 112 ms 11812 KB Output is correct
30 Correct 142 ms 12064 KB Output is correct
31 Correct 119 ms 10880 KB Output is correct
32 Correct 84 ms 9428 KB Output is correct
33 Correct 85 ms 10100 KB Output is correct
34 Correct 93 ms 10292 KB Output is correct
35 Correct 111 ms 10424 KB Output is correct
36 Correct 131 ms 11820 KB Output is correct
37 Correct 119 ms 12620 KB Output is correct
38 Correct 122 ms 12464 KB Output is correct
39 Correct 135 ms 12364 KB Output is correct
40 Correct 125 ms 12440 KB Output is correct
41 Correct 127 ms 12244 KB Output is correct
42 Correct 126 ms 12368 KB Output is correct
43 Correct 116 ms 11624 KB Output is correct
44 Correct 120 ms 12040 KB Output is correct
45 Correct 120 ms 11980 KB Output is correct
46 Correct 128 ms 13072 KB Output is correct
47 Correct 102 ms 10100 KB Output is correct
48 Correct 93 ms 10144 KB Output is correct
49 Correct 107 ms 10612 KB Output is correct
50 Correct 99 ms 9984 KB Output is correct
51 Correct 85 ms 10352 KB Output is correct
52 Correct 97 ms 10072 KB Output is correct