oj.uz

Submission #964626

# Submission time Handle Problem Language Result Execution time Memory
964626 2024-04-17T08:27:08 Z efedmrlr Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 105 ms 13048 KB 
// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

using namespace std;


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()


void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
constexpr int MOD = 1e9+7;
int n,q,s,t;
vector<int> d;
int ans = 0;

void upd(int ind, int x) {
    if(d[ind] > 0) {
        ans += s * d[ind];
    }
    else {
        ans += t * d[ind];
    }
    d[ind] += x;
    if(d[ind] > 0) {
        ans -= s * d[ind];
    }
    else {
        ans -= t * d[ind];
    }
}

inline void solve() {
    cin>>n>>q>>s>>t;
    vector<int> a(n + 1);
    REP(i, n + 1) cin >> a[i];
    d.assign(n + 3, 0);
    for(int i = 1; i<=n; i++) {
        d[i] = a[i] - a[i - 1];
        if(d[i] > 0) {
            ans -= s * d[i];
        }
        else {
            ans -= t * d[i];
        }
    }
    REP(z, q) {
        int l, r, x;
        cin >> l >> r >> x;
        if(r + 1 <= n) upd(r + 1, -x);
        upd(l, x);
        cout << ans << "\n";
    }

}
 
signed main() {

    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 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 348 KB Output is correct
8 Correct 1 ms 488 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 1 ms 528 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 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 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 76 ms 10364 KB Output is correct
2 Correct 75 ms 10948 KB Output is correct
3 Correct 76 ms 11588 KB Output is correct
4 Correct 75 ms 11084 KB Output is correct
5 Correct 78 ms 12172 KB Output is correct
6 Correct 66 ms 11100 KB Output is correct
7 Correct 64 ms 11124 KB Output is correct
8 Correct 80 ms 11952 KB Output is correct
9 Correct 79 ms 12260 KB Output is correct
10 Correct 78 ms 10836 KB Output is correct
11 Correct 61 ms 10832 KB Output is correct
12 Correct 66 ms 11608 KB Output is correct
13 Correct 63 ms 11860 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 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 348 KB Output is correct
8 Correct 1 ms 488 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 1 ms 528 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 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 76 ms 10364 KB Output is correct
23 Correct 75 ms 10948 KB Output is correct
24 Correct 76 ms 11588 KB Output is correct
25 Correct 75 ms 11084 KB Output is correct
26 Correct 78 ms 12172 KB Output is correct
27 Correct 66 ms 11100 KB Output is correct
28 Correct 64 ms 11124 KB Output is correct
29 Correct 80 ms 11952 KB Output is correct
30 Correct 79 ms 12260 KB Output is correct
31 Correct 78 ms 10836 KB Output is correct
32 Correct 61 ms 10832 KB Output is correct
33 Correct 66 ms 11608 KB Output is correct
34 Correct 63 ms 11860 KB Output is correct
35 Correct 80 ms 10448 KB Output is correct
36 Correct 85 ms 11956 KB Output is correct
37 Correct 78 ms 12624 KB Output is correct
38 Correct 94 ms 12492 KB Output is correct
39 Correct 80 ms 12604 KB Output is correct
40 Correct 80 ms 12508 KB Output is correct
41 Correct 85 ms 12368 KB Output is correct
42 Correct 88 ms 12504 KB Output is correct
43 Correct 83 ms 11600 KB Output is correct
44 Correct 76 ms 12128 KB Output is correct
45 Correct 85 ms 12232 KB Output is correct
46 Correct 105 ms 13048 KB Output is correct
47 Correct 65 ms 11808 KB Output is correct
48 Correct 76 ms 11600 KB Output is correct
49 Correct 67 ms 10852 KB Output is correct
50 Correct 67 ms 11640 KB Output is correct
51 Correct 78 ms 11824 KB Output is correct
52 Correct 74 ms 11628 KB Output is correct