oj.uz

Submission #987083

# Submission time Handle Problem Language Result Execution time Memory
987083 2024-05-21T20:22:22 Z vyshniak_n Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 86 ms 13396 KB 
//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 3e5 + 10;
const ll mod = 1e9 + 7;
const ll K = 600;
const ll LOG = 8;



void solve() {
    ll n, q, s, t;
    cin >> n >> q >> s >> t;

    vector <ll> a(n + 1);
    for (ll i = 0; i <= n; i++)
        cin >> a[i];

    vector <ll> b(n + 1);
    for (ll i = 1; i <= n; i++)
        b[i] = a[i] - a[i - 1];

    auto val = [&](ll x) -> ll {
        if (x > 0) return -abs(x) * s;
        else return abs(x) * t;
    };

    ll ans = 0;
    for (ll i = 1; i <= n; i++)
        ans += val(b[i]);

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

        ans -= val(b[l]);
        b[l] += x;
        ans += val(b[l]);

        if (r != n) {
            ans -= val(b[r + 1]);
            b[r + 1] -= x;
            ans += val(b[r + 1]);
        }

        cout << ans << el;
    }
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*
*/

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 10324 KB Output is correct
2 Correct 86 ms 11044 KB Output is correct
3 Correct 76 ms 11604 KB Output is correct
4 Correct 71 ms 10992 KB Output is correct
5 Correct 75 ms 12112 KB Output is correct
6 Correct 64 ms 11088 KB Output is correct
7 Correct 65 ms 11244 KB Output is correct
8 Correct 77 ms 11880 KB Output is correct
9 Correct 83 ms 12416 KB Output is correct
10 Correct 74 ms 10836 KB Output is correct
11 Correct 61 ms 11092 KB Output is correct
12 Correct 64 ms 11860 KB Output is correct
13 Correct 64 ms 12004 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 540 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 74 ms 10324 KB Output is correct
23 Correct 86 ms 11044 KB Output is correct
24 Correct 76 ms 11604 KB Output is correct
25 Correct 71 ms 10992 KB Output is correct
26 Correct 75 ms 12112 KB Output is correct
27 Correct 64 ms 11088 KB Output is correct
28 Correct 65 ms 11244 KB Output is correct
29 Correct 77 ms 11880 KB Output is correct
30 Correct 83 ms 12416 KB Output is correct
31 Correct 74 ms 10836 KB Output is correct
32 Correct 61 ms 11092 KB Output is correct
33 Correct 64 ms 11860 KB Output is correct
34 Correct 64 ms 12004 KB Output is correct
35 Correct 75 ms 10580 KB Output is correct
36 Correct 76 ms 11864 KB Output is correct
37 Correct 79 ms 12624 KB Output is correct
38 Correct 79 ms 12580 KB Output is correct
39 Correct 80 ms 12536 KB Output is correct
40 Correct 77 ms 12400 KB Output is correct
41 Correct 83 ms 12372 KB Output is correct
42 Correct 79 ms 12404 KB Output is correct
43 Correct 77 ms 11636 KB Output is correct
44 Correct 76 ms 12116 KB Output is correct
45 Correct 73 ms 12116 KB Output is correct
46 Correct 84 ms 13396 KB Output is correct
47 Correct 70 ms 11692 KB Output is correct
48 Correct 67 ms 11856 KB Output is correct
49 Correct 75 ms 11088 KB Output is correct
50 Correct 63 ms 11604 KB Output is correct
51 Correct 68 ms 11936 KB Output is correct
52 Correct 66 ms 11768 KB Output is correct