oj.uz

Submission #988410

# Submission time Handle Problem Language Result Execution time Memory
988410 2024-05-24T15:59:03 Z nikaa123 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 98 ms 13040 KB 
// #pragma GCC diagnostic warnig "-std=c++11"
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl '\n'
#define ff first
#define ss second
#define stop exit(0)
#define sz(x) (int)x.size()
#define pause system("pause")
#define all(x) (x).begin(),(x).end()
#define deb(x) cout << #x << "-" << x  << endl
 
typedef char chr;
typedef string str;
typedef long long ll;
typedef vector <int> vii;
typedef pair <int,int> pii;
 
const long long INF = LLONG_MAX;
const int inf = INT_MAX;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int dx[] = {0,0,-1,1};
const int dy[] = {-1,1,0,0};
const double PI = 2 * acos(0.0);

const int N = 2e5 + 5;

int n,q,s,t,l,r,x,ans,a[N],b[N];

inline void test_case () {  

    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; i++) {
        cin >> a[i];
        b[i] = a[i]-a[i-1];
        if (b[i]>0) {
            ans -= abs(b[i]) * s;
        } else {
            ans += abs(b[i]) * t;
        }
    }
    // for (int i = 1; i <= n; i++) {
    //     cout << b[i] << " ";
    // }
    // cout << endl;
    while (q--) {
        cin >> l >> r >> x;
        if (b[l]>0) {
            ans += abs(b[l]) * s;
        } else {
            ans -= abs(b[l]) * t;
        }
        if (r < n) {
            if (b[r+1]>0) {
                ans += abs(b[r+1]) * s;
            } else {
                ans -= abs(b[r+1]) * t;
            }
        }
        b[l] += x;
        b[r+1] -= x;
        if (b[l]>0) {
            ans -= abs(b[l]) * s;
        } else {
            ans += abs(b[l]) * t;
        }
        if (r < n) {
            if (b[r+1]>0 ) {
                ans -= abs(b[r+1]) * s;
            } else {
                ans += abs(b[r+1]) * t;
            }
        }
        // for (int i = 1; i <= n; i++) {
        //     cout << b[i] << " ";
        // }
        // cout << endl;
        cout << ans << endl;
    }





}
 
signed main () {
 
    ios_base :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int T = 1;
    // cin >> T;
    while(T--) {
        test_case();
    }
    
    return 0;
 
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 10324 KB Output is correct
2 Correct 77 ms 10968 KB Output is correct
3 Correct 81 ms 11604 KB Output is correct
4 Correct 72 ms 10832 KB Output is correct
5 Correct 77 ms 12120 KB Output is correct
6 Correct 69 ms 11048 KB Output is correct
7 Correct 69 ms 10944 KB Output is correct
8 Correct 82 ms 11856 KB Output is correct
9 Correct 82 ms 12100 KB Output is correct
10 Correct 82 ms 11064 KB Output is correct
11 Correct 62 ms 10832 KB Output is correct
12 Correct 67 ms 11600 KB Output is correct
13 Correct 67 ms 11892 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2392 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 2 ms 2392 KB Output is correct
9 Correct 2 ms 2488 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 3 ms 2396 KB Output is correct
12 Correct 2 ms 2392 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 80 ms 10324 KB Output is correct
23 Correct 77 ms 10968 KB Output is correct
24 Correct 81 ms 11604 KB Output is correct
25 Correct 72 ms 10832 KB Output is correct
26 Correct 77 ms 12120 KB Output is correct
27 Correct 69 ms 11048 KB Output is correct
28 Correct 69 ms 10944 KB Output is correct
29 Correct 82 ms 11856 KB Output is correct
30 Correct 82 ms 12100 KB Output is correct
31 Correct 82 ms 11064 KB Output is correct
32 Correct 62 ms 10832 KB Output is correct
33 Correct 67 ms 11600 KB Output is correct
34 Correct 67 ms 11892 KB Output is correct
35 Correct 76 ms 10324 KB Output is correct
36 Correct 80 ms 11856 KB Output is correct
37 Correct 87 ms 12628 KB Output is correct
38 Correct 81 ms 12580 KB Output is correct
39 Correct 90 ms 12644 KB Output is correct
40 Correct 84 ms 12624 KB Output is correct
41 Correct 98 ms 12372 KB Output is correct
42 Correct 96 ms 12372 KB Output is correct
43 Correct 79 ms 11596 KB Output is correct
44 Correct 86 ms 12152 KB Output is correct
45 Correct 75 ms 12088 KB Output is correct
46 Correct 78 ms 13040 KB Output is correct
47 Correct 70 ms 11604 KB Output is correct
48 Correct 69 ms 11600 KB Output is correct
49 Correct 67 ms 10660 KB Output is correct
50 Correct 65 ms 11604 KB Output is correct
51 Correct 68 ms 11976 KB Output is correct
52 Correct 68 ms 11648 KB Output is correct