oj.uz

Submission #998346

# Submission time Handle Problem Language Result Execution time Memory
998346 2024-06-13T16:51:23 Z mispertion Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 87 ms 7336 KB 
#include<bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 2e5+10;
const int M = 7e6 + 1;
int mod = 998244353;
const int infi = INT_MAX;
const ll infl = LLONG_MAX;
const int P = 2;

int mult(int a, int b) {
    a %= mod;
    b %= mod;
    return a * 1LL * b % mod;
}

int sum(int a, int b) { 
    a %= mod;
    b %= mod;
    if (a + b < 0)
        return a + b + mod;
    if (a + b >= mod)
        return a + b - mod;
    return a + b;
}

ll binpow(ll a, ll n, ll mod) {
    if (n == 0)
        return 1;
    if (n % 2 == 1) {
        return binpow(a, n - 1, mod) * a % mod;
    } else {
        ll b = binpow(a, n / 2, mod);
        return b * b % mod;
    }
}

int n, q, s, t, a[N], d[N], sm = 0;

void solve(){
    cin >> n >> q >> s >> t;
    for(int i = 0; i <= n; i++){
        cin >> a[i];
        if(i > 0)
            d[i] = a[i] - a[i - 1];
        if(d[i] > 0)
            sm -= s * d[i];
        else
            sm -= t * d[i];
    }
    for(int j = 1; j <= q; j++){
        int l, r, x;
        cin >> l >> r >> x;
        if(d[l] > 0)
            sm += s * d[l];
        else
            sm += t * d[l];
        d[l] += x;
        if(d[l] > 0)
            sm -= s * d[l];
        else
            sm -= t * d[l];
        if(r + 1 <= n){
            if(d[r + 1] > 0)
            sm += s * d[r + 1];
        else
            sm += t * d[r + 1];
        d[r + 1] -= x;
        if(d[r + 1] > 0)
            sm -= s * d[r + 1];
        else
            sm -= t * d[r + 1];
        }
    
        cout << sm << '\n';
    }
}   

signed main() {
    mispertion;
    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 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2496 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 4948 KB Output is correct
2 Correct 61 ms 5576 KB Output is correct
3 Correct 62 ms 5968 KB Output is correct
4 Correct 57 ms 5348 KB Output is correct
5 Correct 64 ms 5968 KB Output is correct
6 Correct 62 ms 6480 KB Output is correct
7 Correct 53 ms 6480 KB Output is correct
8 Correct 65 ms 6400 KB Output is correct
9 Correct 84 ms 6736 KB Output is correct
10 Correct 63 ms 5460 KB Output is correct
11 Correct 49 ms 6484 KB Output is correct
12 Correct 54 ms 6816 KB Output is correct
13 Correct 54 ms 7248 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2496 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 64 ms 4948 KB Output is correct
23 Correct 61 ms 5576 KB Output is correct
24 Correct 62 ms 5968 KB Output is correct
25 Correct 57 ms 5348 KB Output is correct
26 Correct 64 ms 5968 KB Output is correct
27 Correct 62 ms 6480 KB Output is correct
28 Correct 53 ms 6480 KB Output is correct
29 Correct 65 ms 6400 KB Output is correct
30 Correct 84 ms 6736 KB Output is correct
31 Correct 63 ms 5460 KB Output is correct
32 Correct 49 ms 6484 KB Output is correct
33 Correct 54 ms 6816 KB Output is correct
34 Correct 54 ms 7248 KB Output is correct
35 Correct 60 ms 4948 KB Output is correct
36 Correct 87 ms 6456 KB Output is correct
37 Correct 64 ms 7336 KB Output is correct
38 Correct 64 ms 6992 KB Output is correct
39 Correct 70 ms 7052 KB Output is correct
40 Correct 67 ms 6996 KB Output is correct
41 Correct 65 ms 6796 KB Output is correct
42 Correct 82 ms 7024 KB Output is correct
43 Correct 62 ms 6220 KB Output is correct
44 Correct 63 ms 6792 KB Output is correct
45 Correct 60 ms 6340 KB Output is correct
46 Correct 69 ms 7104 KB Output is correct
47 Correct 60 ms 6992 KB Output is correct
48 Correct 55 ms 7248 KB Output is correct
49 Correct 56 ms 6344 KB Output is correct
50 Correct 53 ms 6992 KB Output is correct
51 Correct 58 ms 6992 KB Output is correct
52 Correct 57 ms 7064 KB Output is correct