oj.uz

Submission #762810

# Submission time Handle Problem Language Result Execution time Memory
762810 2023-06-21T19:47:47 Z sysia Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 88 ms 13072 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

void solve(){
    int n, q, s, t; cin >> n >> q >> s >> t;
    vector<int>a(n+1), b(n+1);
    int ans = 0;
    for (int i = 0; i<=n; i++) {
        cin >> a[i];
        if (i) {
            b[i] = a[i] - a[i-1];
            if (b[i] > 0) ans -= abs(b[i])*s;
            else ans += abs(b[i])*t;
        }
    }
    debug(ans);
    while (q--){
        int l, r, v; cin >> l >> r >> v;
        int sgn = 1;
        for (auto k: {l, r+1}){
            if (k > n) continue;
            if (b[k] > 0) ans += abs(b[k])*s;
            else ans -= abs(b[k])*t;
            b[k] += sgn*v;
            if (b[k] > 0) ans -= abs(b[k])*s;
            else ans += abs(b[k])*t;
            sgn = -sgn;
        }
        cout << ans << "\n";
    }
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 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 328 KB Output is correct
9 Correct 1 ms 368 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 332 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 1 ms 212 KB Output is correct
21 Correct 0 ms 320 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 10224 KB Output is correct
2 Correct 77 ms 10844 KB Output is correct
3 Correct 77 ms 11456 KB Output is correct
4 Correct 70 ms 10848 KB Output is correct
5 Correct 78 ms 12088 KB Output is correct
6 Correct 65 ms 10992 KB Output is correct
7 Correct 64 ms 10964 KB Output is correct
8 Correct 74 ms 11808 KB Output is correct
9 Correct 76 ms 12104 KB Output is correct
10 Correct 73 ms 10872 KB Output is correct
11 Correct 61 ms 10860 KB Output is correct
12 Correct 68 ms 11704 KB Output is correct
13 Correct 65 ms 11892 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 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 328 KB Output is correct
9 Correct 1 ms 368 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 332 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 1 ms 212 KB Output is correct
21 Correct 0 ms 320 KB Output is correct
22 Correct 74 ms 10224 KB Output is correct
23 Correct 77 ms 10844 KB Output is correct
24 Correct 77 ms 11456 KB Output is correct
25 Correct 70 ms 10848 KB Output is correct
26 Correct 78 ms 12088 KB Output is correct
27 Correct 65 ms 10992 KB Output is correct
28 Correct 64 ms 10964 KB Output is correct
29 Correct 74 ms 11808 KB Output is correct
30 Correct 76 ms 12104 KB Output is correct
31 Correct 73 ms 10872 KB Output is correct
32 Correct 61 ms 10860 KB Output is correct
33 Correct 68 ms 11704 KB Output is correct
34 Correct 65 ms 11892 KB Output is correct
35 Correct 74 ms 10408 KB Output is correct
36 Correct 75 ms 11748 KB Output is correct
37 Correct 88 ms 12716 KB Output is correct
38 Correct 77 ms 12464 KB Output is correct
39 Correct 80 ms 12356 KB Output is correct
40 Correct 79 ms 12400 KB Output is correct
41 Correct 78 ms 12280 KB Output is correct
42 Correct 77 ms 12332 KB Output is correct
43 Correct 73 ms 11596 KB Output is correct
44 Correct 83 ms 12164 KB Output is correct
45 Correct 76 ms 12044 KB Output is correct
46 Correct 83 ms 13072 KB Output is correct
47 Correct 67 ms 11600 KB Output is correct
48 Correct 67 ms 11664 KB Output is correct
49 Correct 65 ms 10700 KB Output is correct
50 Correct 62 ms 11508 KB Output is correct
51 Correct 74 ms 11884 KB Output is correct
52 Correct 64 ms 11700 KB Output is correct