oj.uz

Submission #951117

# Submission time Handle Problem Language Result Execution time Memory
951117 2024-03-21T07:23:11 Z dwuy Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 136 ms 7340 KB 
#include <bits/stdc++.h>

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout)
#define fi first
#define se second
#define endl "\n"
#define len(s) int32_t(s.length())
#define MASK(k)(1LL<<(k))
#define TASK "test"
#define int long long
using namespace std;

typedef tuple<int, int, int> tpiii;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef long long ll;

const long long OO = 1e18;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MX = 200005;

struct BIT{
    int n;
    vector<int> tree;

    BIT(int n=0){
        this->n = n;
        this->tree.assign(n+5, 0);
    }

    void update(int idx, int val){
        for(; idx<=n; idx+=-idx&idx) tree[idx] += val;
    }

    int get(int idx){
        int res = 0;
        for(; idx; idx-=-idx&idx) res += tree[idx];
        return res;
    }
};

int n, q, S, T;
int a[MX];

void nhap(){
    cin >> n >> q >> S >> T;
    for(int i=0; i<=n; i++) cin >> a[i];
}

void solve(){
    int ans = 0;
    BIT bit(n + 5);
    for(int i=1; i<=n; i++){
        bit.update(i, a[i]);
        bit.update(i+1, -a[i]);
        ans += a[i] > a[i-1]? -S*(a[i] - a[i-1]) : T*(a[i-1] - a[i]);
    }
    while(q--){
        int l, r, val;
        cin >> l >> r >> val;
        if(r != n) ans -= bit.get(r+1) > bit.get(r) ? -S*(bit.get(r+1) - bit.get(r)) : T*(bit.get(r) - bit.get(r+1));
        ans -= bit.get(l) > bit.get(l-1)? -S*(bit.get(l) - bit.get(l-1)) : T*(bit.get(l-1) - bit.get(l));

        bit.update(l, val);
        bit.update(r+1, -val);

        if(r != n) ans += bit.get(r+1) > bit.get(r) ? -S*(bit.get(r+1) - bit.get(r)) : T*(bit.get(r) - bit.get(r+1));
        ans += bit.get(l) > bit.get(l-1)? -S*(bit.get(l) - bit.get(l-1)) : T*(bit.get(l-1) - bit.get(l));

        cout << ans << ' ';
    }
}

int32_t main(){
    fastIO;
    //file(TASK);

    nhap();
    solve();

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 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 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 4904 KB Output is correct
2 Correct 127 ms 5452 KB Output is correct
3 Correct 118 ms 6224 KB Output is correct
4 Correct 113 ms 5256 KB Output is correct
5 Correct 123 ms 6484 KB Output is correct
6 Correct 72 ms 6480 KB Output is correct
7 Correct 76 ms 6480 KB Output is correct
8 Correct 111 ms 6492 KB Output is correct
9 Correct 113 ms 6708 KB Output is correct
10 Correct 106 ms 5460 KB Output is correct
11 Correct 77 ms 6484 KB Output is correct
12 Correct 77 ms 6816 KB Output is correct
13 Correct 70 ms 7248 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 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 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 120 ms 4904 KB Output is correct
23 Correct 127 ms 5452 KB Output is correct
24 Correct 118 ms 6224 KB Output is correct
25 Correct 113 ms 5256 KB Output is correct
26 Correct 123 ms 6484 KB Output is correct
27 Correct 72 ms 6480 KB Output is correct
28 Correct 76 ms 6480 KB Output is correct
29 Correct 111 ms 6492 KB Output is correct
30 Correct 113 ms 6708 KB Output is correct
31 Correct 106 ms 5460 KB Output is correct
32 Correct 77 ms 6484 KB Output is correct
33 Correct 77 ms 6816 KB Output is correct
34 Correct 70 ms 7248 KB Output is correct
35 Correct 119 ms 4944 KB Output is correct
36 Correct 130 ms 6412 KB Output is correct
37 Correct 122 ms 7168 KB Output is correct
38 Correct 120 ms 7128 KB Output is correct
39 Correct 136 ms 6984 KB Output is correct
40 Correct 134 ms 6992 KB Output is correct
41 Correct 120 ms 6860 KB Output is correct
42 Correct 127 ms 6972 KB Output is correct
43 Correct 119 ms 6144 KB Output is correct
44 Correct 123 ms 6744 KB Output is correct
45 Correct 112 ms 6496 KB Output is correct
46 Correct 116 ms 7180 KB Output is correct
47 Correct 74 ms 6988 KB Output is correct
48 Correct 107 ms 7340 KB Output is correct
49 Correct 106 ms 6160 KB Output is correct
50 Correct 78 ms 6992 KB Output is correct
51 Correct 71 ms 7056 KB Output is correct
52 Correct 78 ms 7144 KB Output is correct