oj.uz

Submission #924891

# Submission time Handle Problem Language Result Execution time Memory
924891 2024-02-10T03:28:10 Z niter Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 83 ms 13140 KB 
#include <bits/stdc++.h>
#define loop(i,a,b) for(int i = (a); i < (b); i ++)
using namespace std;
typedef long long ll;

const int mxn = 200005;
ll S, T;
ll a[mxn], b[mxn];

ll cal(ll pre, ll nxt){
    if(nxt > pre) return (-S) * abs(nxt - pre);
    else return T * abs(pre - nxt);
}

ll cal(ll det){
    if(det > 0) return (-S) * abs(det);
    else return T * abs(det);
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);
//    freopen("in.txt", "r", stdin);
    int n, q; cin >> n >> q;
    cin >> S >> T;
    // S: decrease (go up), T: increase (go down)
    loop(i,0,n+1) cin >> a[i];
    ll now = 0;
    loop(i,1,n+1){
        b[i] = cal(a[i-1], a[i]);
        now += b[i];
//        cout << now << '\n';
    }
    for(int i = n; i >= 1; i--){
        a[i] = a[i] - a[i-1];
    }
//    loop(i,0,n+1){
//        cout << a[i] << ' ';
//    } cout << '\n';
    loop(queries,0,q){
        int l, r; ll val;
        cin >> l >> r >> val;
        ll nxt_a = a[l] + val;
        ll nxt_b = cal(nxt_a);
        now -= b[l];
        b[l] = nxt_b;
        now += b[l];
        a[l] = nxt_a;

        if(r == n){
            cout << now << '\n';
            continue;
        }
        nxt_a = a[r+1] - val;
        nxt_b = cal(nxt_a);
        now -= b[r+1];
        b[r+1] = nxt_b;
        now += b[r+1];
        a[r+1] = nxt_a;
        cout << now << '\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2524 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 1 ms 2580 KB Output is correct
11 Correct 2 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 10212 KB Output is correct
2 Correct 73 ms 10912 KB Output is correct
3 Correct 78 ms 11504 KB Output is correct
4 Correct 70 ms 10916 KB Output is correct
5 Correct 78 ms 11948 KB Output is correct
6 Correct 69 ms 11092 KB Output is correct
7 Correct 70 ms 11088 KB Output is correct
8 Correct 83 ms 11860 KB Output is correct
9 Correct 77 ms 12304 KB Output is correct
10 Correct 80 ms 10832 KB Output is correct
11 Correct 62 ms 10860 KB Output is correct
12 Correct 73 ms 11760 KB Output is correct
13 Correct 77 ms 11992 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2524 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 1 ms 2580 KB Output is correct
11 Correct 2 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 73 ms 10212 KB Output is correct
23 Correct 73 ms 10912 KB Output is correct
24 Correct 78 ms 11504 KB Output is correct
25 Correct 70 ms 10916 KB Output is correct
26 Correct 78 ms 11948 KB Output is correct
27 Correct 69 ms 11092 KB Output is correct
28 Correct 70 ms 11088 KB Output is correct
29 Correct 83 ms 11860 KB Output is correct
30 Correct 77 ms 12304 KB Output is correct
31 Correct 80 ms 10832 KB Output is correct
32 Correct 62 ms 10860 KB Output is correct
33 Correct 73 ms 11760 KB Output is correct
34 Correct 77 ms 11992 KB Output is correct
35 Correct 72 ms 10320 KB Output is correct
36 Correct 79 ms 11860 KB Output is correct
37 Correct 77 ms 12628 KB Output is correct
38 Correct 80 ms 12352 KB Output is correct
39 Correct 78 ms 12376 KB Output is correct
40 Correct 77 ms 12372 KB Output is correct
41 Correct 82 ms 12344 KB Output is correct
42 Correct 80 ms 12372 KB Output is correct
43 Correct 75 ms 11540 KB Output is correct
44 Correct 81 ms 12112 KB Output is correct
45 Correct 73 ms 12112 KB Output is correct
46 Correct 77 ms 13140 KB Output is correct
47 Correct 68 ms 11784 KB Output is correct
48 Correct 67 ms 11604 KB Output is correct
49 Correct 83 ms 10700 KB Output is correct
50 Correct 65 ms 11604 KB Output is correct
51 Correct 70 ms 11804 KB Output is correct
52 Correct 66 ms 11604 KB Output is correct