oj.uz

Submission #544708

# Submission time Handle Problem Language Result Execution time Memory
544708 2022-04-02T15:43:15 Z SavicS Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 149 ms 12360 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005; 

int n, q, S, T;
int niz[mxN];

ll P[mxN];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> q >> S >> T;
    ff(i,0,n)cin >> niz[i];

    ff(i,1,n)P[i] = niz[i] - niz[i - 1];

    ll uk = 0;
    ff(i,1,n){
        if(P[i] >= 0)uk -= 1ll * P[i] * S;
        else uk -= 1ll * P[i] * T;
    }    

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

        if(P[l] >= 0)uk += 1ll * P[l] * S;
        else uk += 1ll * P[l] * T;

        if(r != n){
            if(P[r + 1] >= 0)uk += 1ll * P[r + 1] * S;
            else uk += 1ll * P[r + 1] * T;
        }

        P[l] += val; if(r != n)P[r + 1] -= val;

        if(P[l] >= 0)uk -= 1ll * P[l] * S;
        else uk -= 1ll * P[l] * T;

        if(r != n){
            if(P[r + 1] >= 0)uk -= 1ll * P[r + 1] * S;
            else uk -= 1ll * P[r + 1] * T;
        }

        cout << uk << '\n';

    }

    return 0;
}
/*
 
3 5 1 2 
0 4 1 8
1 2 2 
1 1 -2 
2 3 5 
1 2 -1
1 3 5
 
// probati bojenje sahovski
*/

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 436 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 392 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 392 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 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 388 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 4700 KB Output is correct
2 Correct 92 ms 5324 KB Output is correct
3 Correct 99 ms 6012 KB Output is correct
4 Correct 88 ms 5172 KB Output is correct
5 Correct 96 ms 5904 KB Output is correct
6 Correct 86 ms 6348 KB Output is correct
7 Correct 83 ms 6308 KB Output is correct
8 Correct 95 ms 6252 KB Output is correct
9 Correct 110 ms 6568 KB Output is correct
10 Correct 121 ms 5356 KB Output is correct
11 Correct 79 ms 6376 KB Output is correct
12 Correct 80 ms 6740 KB Output is correct
13 Correct 78 ms 11056 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 436 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 392 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 2 ms 392 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 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 388 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 90 ms 4700 KB Output is correct
23 Correct 92 ms 5324 KB Output is correct
24 Correct 99 ms 6012 KB Output is correct
25 Correct 88 ms 5172 KB Output is correct
26 Correct 96 ms 5904 KB Output is correct
27 Correct 86 ms 6348 KB Output is correct
28 Correct 83 ms 6308 KB Output is correct
29 Correct 95 ms 6252 KB Output is correct
30 Correct 110 ms 6568 KB Output is correct
31 Correct 121 ms 5356 KB Output is correct
32 Correct 79 ms 6376 KB Output is correct
33 Correct 80 ms 6740 KB Output is correct
34 Correct 78 ms 11056 KB Output is correct
35 Correct 95 ms 9632 KB Output is correct
36 Correct 102 ms 11084 KB Output is correct
37 Correct 109 ms 11856 KB Output is correct
38 Correct 100 ms 11652 KB Output is correct
39 Correct 98 ms 11592 KB Output is correct
40 Correct 100 ms 11600 KB Output is correct
41 Correct 149 ms 11428 KB Output is correct
42 Correct 109 ms 11648 KB Output is correct
43 Correct 100 ms 10876 KB Output is correct
44 Correct 109 ms 11204 KB Output is correct
45 Correct 105 ms 11220 KB Output is correct
46 Correct 101 ms 12360 KB Output is correct
47 Correct 94 ms 10828 KB Output is correct
48 Correct 122 ms 10828 KB Output is correct
49 Correct 82 ms 9956 KB Output is correct
50 Correct 87 ms 10724 KB Output is correct
51 Correct 87 ms 11248 KB Output is correct
52 Correct 82 ms 10832 KB Output is correct