oj.uz

Submission #783731

# Submission time Handle Problem Language Result Execution time Memory
783731 2023-07-15T09:08:57 Z andecaandeci Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 103 ms 7240 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
typedef long long ll;
const ll INF = 1e9; //4e18;
const ll MOD = 1e9 + 7;
const ll MAXN = 2e5 + 5;
const ll LOG = 30; //20;
const double EPS = 1e-9;
#define vi vector <int>
#define vll vector <ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ipi pair <int, pii>
#define lpl pair <ll, pll>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define endl '\n'
#define apaaja                          ios_base::sync_with_stdio(0);       cin.tie(0);                         cout.tie(0);                    
ll n, q, s, t;
ll a [MAXN];
ll dif [MAXN];

ll f(ll x){
    if(x > 0){
        return -1 * x * s;
    }
    return abs(x) * t;
}

int main(){
    apaaja
    cin >> n >> q >> s >> t;
    for(ll i = 0; i <= n; i++){
        cin >> a[i];
    }
    ll total = 0;
    for(ll i = 1; i <= n; i++){
        dif[i] = a[i] - a[i-1];
        total += f(dif[i]);
    }
    // cout << total << endl;
    while(q--){
        ll l, r, x; cin >> l >> r >> x;
        total -= f(dif[l]);
        dif[l] += x;
        total += f(dif[l]);
        r++;
        if(r <= n){
            total -= f(dif[r]);
            dif[r] -= x;
            total += f(dif[r]);
        }
        cout << total << endl;
    }
    return 0;
}

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 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 1 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 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 4776 KB Output is correct
2 Correct 76 ms 5400 KB Output is correct
3 Correct 77 ms 6064 KB Output is correct
4 Correct 71 ms 5128 KB Output is correct
5 Correct 77 ms 5984 KB Output is correct
6 Correct 67 ms 6308 KB Output is correct
7 Correct 84 ms 6348 KB Output is correct
8 Correct 81 ms 6440 KB Output is correct
9 Correct 77 ms 6592 KB Output is correct
10 Correct 77 ms 5324 KB Output is correct
11 Correct 63 ms 6392 KB Output is correct
12 Correct 64 ms 6796 KB Output is correct
13 Correct 63 ms 7140 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 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 1 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 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 81 ms 4776 KB Output is correct
23 Correct 76 ms 5400 KB Output is correct
24 Correct 77 ms 6064 KB Output is correct
25 Correct 71 ms 5128 KB Output is correct
26 Correct 77 ms 5984 KB Output is correct
27 Correct 67 ms 6308 KB Output is correct
28 Correct 84 ms 6348 KB Output is correct
29 Correct 81 ms 6440 KB Output is correct
30 Correct 77 ms 6592 KB Output is correct
31 Correct 77 ms 5324 KB Output is correct
32 Correct 63 ms 6392 KB Output is correct
33 Correct 64 ms 6796 KB Output is correct
34 Correct 63 ms 7140 KB Output is correct
35 Correct 74 ms 4996 KB Output is correct
36 Correct 84 ms 6348 KB Output is correct
37 Correct 103 ms 7240 KB Output is correct
38 Correct 76 ms 7048 KB Output is correct
39 Correct 76 ms 6988 KB Output is correct
40 Correct 77 ms 6936 KB Output is correct
41 Correct 78 ms 6860 KB Output is correct
42 Correct 80 ms 6868 KB Output is correct
43 Correct 76 ms 6244 KB Output is correct
44 Correct 75 ms 6532 KB Output is correct
45 Correct 73 ms 6384 KB Output is correct
46 Correct 75 ms 7016 KB Output is correct
47 Correct 67 ms 6988 KB Output is correct
48 Correct 66 ms 7184 KB Output is correct
49 Correct 66 ms 6140 KB Output is correct
50 Correct 63 ms 6944 KB Output is correct
51 Correct 64 ms 6928 KB Output is correct
52 Correct 64 ms 6936 KB Output is correct