oj.uz

Submission #934917

# Submission time Handle Problem Language Result Execution time Memory
934917 2024-02-28T07:34:13 Z Whisper Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 91 ms 13252 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, numQuery, nDec, nInc;
int a[MAX], d[MAX];

void Whisper(){
    cin >> nArr >> numQuery >> nDec >> nInc;
    nDec = -nDec;
    for (int i = 0; i <= nArr; ++i) cin >> a[i];
    for (int i = 1; i <= nArr; ++i) d[i] = a[i] - a[i - 1];
    int cur = 0;
    for (int i = 1; i <= nArr; ++i){
        if (d[i] > 0){
            cur += d[i] * nDec;
        }
        else{
            cur += -d[i] * nInc;
        }
    }
    for (int i = 1; i <= numQuery; ++i){
        int l, r, x; cin >> l >> r >> x;
        if (d[l] > 0){
            cur -= d[l] * nDec;
        }
        else{
            cur -= -d[l] * nInc;
        }
        if (d[r + 1] > 0){
            cur -= d[r + 1] * nDec;
        }
        else{
            cur -= -d[r + 1] * nInc;
        }

        d[l] += x;
        if (d[l] > 0){
            cur += d[l] * nDec;
        }
        else{
            cur += -d[l] * nInc;
        }
        if (r + 1 <= nArr)
            d[r + 1] -= x;
        if (d[r + 1] > 0){
            cur += d[r + 1] * nDec;
        }
        else{
            cur += -d[r + 1] * nInc;
        }
        cout << cur << '\n';
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 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 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2588 KB Output is correct
10 Correct 1 ms 2584 KB Output is correct
11 Correct 1 ms 2396 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 2392 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 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 10280 KB Output is correct
2 Correct 74 ms 10916 KB Output is correct
3 Correct 74 ms 11472 KB Output is correct
4 Correct 68 ms 10816 KB Output is correct
5 Correct 74 ms 12136 KB Output is correct
6 Correct 68 ms 11088 KB Output is correct
7 Correct 65 ms 11172 KB Output is correct
8 Correct 75 ms 11860 KB Output is correct
9 Correct 77 ms 12188 KB Output is correct
10 Correct 73 ms 10836 KB Output is correct
11 Correct 70 ms 11244 KB Output is correct
12 Correct 64 ms 11604 KB Output is correct
13 Correct 64 ms 11860 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 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 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2588 KB Output is correct
10 Correct 1 ms 2584 KB Output is correct
11 Correct 1 ms 2396 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 2392 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 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 10280 KB Output is correct
23 Correct 74 ms 10916 KB Output is correct
24 Correct 74 ms 11472 KB Output is correct
25 Correct 68 ms 10816 KB Output is correct
26 Correct 74 ms 12136 KB Output is correct
27 Correct 68 ms 11088 KB Output is correct
28 Correct 65 ms 11172 KB Output is correct
29 Correct 75 ms 11860 KB Output is correct
30 Correct 77 ms 12188 KB Output is correct
31 Correct 73 ms 10836 KB Output is correct
32 Correct 70 ms 11244 KB Output is correct
33 Correct 64 ms 11604 KB Output is correct
34 Correct 64 ms 11860 KB Output is correct
35 Correct 73 ms 10372 KB Output is correct
36 Correct 75 ms 12064 KB Output is correct
37 Correct 79 ms 12624 KB Output is correct
38 Correct 77 ms 12440 KB Output is correct
39 Correct 79 ms 12372 KB Output is correct
40 Correct 77 ms 12428 KB Output is correct
41 Correct 76 ms 12280 KB Output is correct
42 Correct 91 ms 12368 KB Output is correct
43 Correct 76 ms 11700 KB Output is correct
44 Correct 86 ms 11996 KB Output is correct
45 Correct 71 ms 12112 KB Output is correct
46 Correct 73 ms 13252 KB Output is correct
47 Correct 66 ms 11632 KB Output is correct
48 Correct 65 ms 11772 KB Output is correct
49 Correct 71 ms 10704 KB Output is correct
50 Correct 61 ms 11604 KB Output is correct
51 Correct 64 ms 11864 KB Output is correct
52 Correct 62 ms 11572 KB Output is correct