oj.uz

Submission #661090

# Submission time Handle Problem Language Result Execution time Memory
661090 2022-11-24T10:09:18 Z sandry24 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 107 ms 13060 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
 
void solve(){
    ll n, q, s, t, pos = 0, neg = 0;
    cin >> n >> q >> s >> t;
    vector<ll> a(n+1), diff(n+1);
    for(int i = 0; i <= n; i++)
        cin >> a[i];
    for(int i = 1; i <= n; i++){
        diff[i] = a[i] - a[i-1];
        if(a[i] >= a[i-1])
            pos += diff[i];
        else
            neg += -diff[i];
    }
    //cout << neg*t - pos*s << '\n';
    for(int i = 0; i < q; i++){
        ll l, r, x;
        cin >> l >> r >> x;
        if(diff[l] < 0)
            neg -= -diff[l];
        else
            pos -= diff[l];
        diff[l] += x;
        if(diff[l] < 0)
            neg += -diff[l];
        else
            pos += diff[l];
        if(r != n){
            if(diff[r+1] < 0)
                neg -= -diff[r+1];
            else
                pos -= diff[r+1];
            diff[r+1] -= x;
            if(diff[r+1] < 0)
                neg += -diff[r+1];
            else
                pos += diff[r+1];
        }
        cout << neg*t - pos*s << '\n';
    }
}
 
int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 328 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 404 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 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 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 10308 KB Output is correct
2 Correct 94 ms 10832 KB Output is correct
3 Correct 107 ms 11584 KB Output is correct
4 Correct 86 ms 10820 KB Output is correct
5 Correct 96 ms 12060 KB Output is correct
6 Correct 75 ms 10988 KB Output is correct
7 Correct 78 ms 11120 KB Output is correct
8 Correct 93 ms 11848 KB Output is correct
9 Correct 91 ms 12188 KB Output is correct
10 Correct 86 ms 10808 KB Output is correct
11 Correct 79 ms 11004 KB Output is correct
12 Correct 73 ms 11608 KB Output is correct
13 Correct 73 ms 11928 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 328 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 404 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 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 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 91 ms 10308 KB Output is correct
23 Correct 94 ms 10832 KB Output is correct
24 Correct 107 ms 11584 KB Output is correct
25 Correct 86 ms 10820 KB Output is correct
26 Correct 96 ms 12060 KB Output is correct
27 Correct 75 ms 10988 KB Output is correct
28 Correct 78 ms 11120 KB Output is correct
29 Correct 93 ms 11848 KB Output is correct
30 Correct 91 ms 12188 KB Output is correct
31 Correct 86 ms 10808 KB Output is correct
32 Correct 79 ms 11004 KB Output is correct
33 Correct 73 ms 11608 KB Output is correct
34 Correct 73 ms 11928 KB Output is correct
35 Correct 89 ms 10352 KB Output is correct
36 Correct 90 ms 11940 KB Output is correct
37 Correct 90 ms 12672 KB Output is correct
38 Correct 91 ms 12392 KB Output is correct
39 Correct 93 ms 12552 KB Output is correct
40 Correct 93 ms 12448 KB Output is correct
41 Correct 94 ms 12208 KB Output is correct
42 Correct 90 ms 12404 KB Output is correct
43 Correct 90 ms 11656 KB Output is correct
44 Correct 90 ms 12008 KB Output is correct
45 Correct 88 ms 12004 KB Output is correct
46 Correct 90 ms 13060 KB Output is correct
47 Correct 81 ms 11632 KB Output is correct
48 Correct 77 ms 11648 KB Output is correct
49 Correct 81 ms 10664 KB Output is correct
50 Correct 82 ms 11520 KB Output is correct
51 Correct 74 ms 11848 KB Output is correct
52 Correct 76 ms 11624 KB Output is correct