oj.uz

Submission #843995

# Submission time Handle Problem Language Result Execution time Memory
843995 2023-09-04T20:00:08 Z VMaksimoski008 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 91 ms 13140 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int32_t main() {
    setIO();

    int n, q, s, t;
    ll ans = 0;
    cin >> n >> q >> s >> t;

    vector<int> v(n+1);
    vector<int> diff(n+1);

    for(int i=0; i<=n; i++) {
        cin >> v[i];

        if(i > 0) {
            diff[i] = v[i] - v[i-1];
            if(diff[i] > 0) ans -= (diff[i] * s);
            else ans += (abs(diff[i]) * t);
        }
    }

    while(q--) {
        int l, r, x;
        cin >> l >> r >> x;

        if(diff[l] > 0) ans += (diff[l] * s);
        else ans -= (abs(diff[l]) * t);
        diff[l] += x;
        if(diff[l] > 0) ans -= (diff[l] * s);
        else ans += (abs(diff[l]) * t);

        if(r != n) {
            if(diff[r+1] > 0) ans += (diff[r+1] * s);
            else ans -= (abs(diff[r+1]) * t);
            diff[r+1] -= x;
            if(diff[r+1] > 0) ans -= (diff[r+1] * s);
            else ans += (abs(diff[r+1]) * t);
        }

        cout << ans << '\n';
    }

    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 4944 KB Output is correct
2 Correct 73 ms 5872 KB Output is correct
3 Correct 75 ms 6224 KB Output is correct
4 Correct 73 ms 10908 KB Output is correct
5 Correct 73 ms 12112 KB Output is correct
6 Correct 64 ms 11088 KB Output is correct
7 Correct 64 ms 11116 KB Output is correct
8 Correct 75 ms 11864 KB Output is correct
9 Correct 81 ms 12112 KB Output is correct
10 Correct 88 ms 11000 KB Output is correct
11 Correct 60 ms 10832 KB Output is correct
12 Correct 64 ms 11600 KB Output is correct
13 Correct 62 ms 11848 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 71 ms 4944 KB Output is correct
23 Correct 73 ms 5872 KB Output is correct
24 Correct 75 ms 6224 KB Output is correct
25 Correct 73 ms 10908 KB Output is correct
26 Correct 73 ms 12112 KB Output is correct
27 Correct 64 ms 11088 KB Output is correct
28 Correct 64 ms 11116 KB Output is correct
29 Correct 75 ms 11864 KB Output is correct
30 Correct 81 ms 12112 KB Output is correct
31 Correct 88 ms 11000 KB Output is correct
32 Correct 60 ms 10832 KB Output is correct
33 Correct 64 ms 11600 KB Output is correct
34 Correct 62 ms 11848 KB Output is correct
35 Correct 74 ms 10332 KB Output is correct
36 Correct 75 ms 11928 KB Output is correct
37 Correct 82 ms 12784 KB Output is correct
38 Correct 91 ms 12412 KB Output is correct
39 Correct 77 ms 12444 KB Output is correct
40 Correct 76 ms 12712 KB Output is correct
41 Correct 76 ms 12324 KB Output is correct
42 Correct 76 ms 12516 KB Output is correct
43 Correct 74 ms 11600 KB Output is correct
44 Correct 75 ms 12112 KB Output is correct
45 Correct 71 ms 12028 KB Output is correct
46 Correct 75 ms 13140 KB Output is correct
47 Correct 74 ms 11600 KB Output is correct
48 Correct 66 ms 11836 KB Output is correct
49 Correct 66 ms 10744 KB Output is correct
50 Correct 62 ms 11600 KB Output is correct
51 Correct 63 ms 11856 KB Output is correct
52 Correct 62 ms 11600 KB Output is correct