oj.uz

답안 #670451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670451 2022-12-09T06:47:54 Z fatemetmhr Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 149 ms 7264 KB 
// ~ Be Name Khoda ~

#include<bits/stdc++.h>
//#pragma GCC optimize ("Ofast")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,O3")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn  =  1e6   + 10;
const int maxn5 =  5e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   +  7;
const ll  inf   =  1e18;

ll s, t, all = 0, fen[maxn5], a[maxn5];


inline void add(int id, ll val){
    all += val;
    for(id++; id < maxn5; id += id & -id)
        fen[id] += val;
}

inline ll get(int id){
    ll ret = all + a[id];
    if(!id)
        return ret;
    for(; id; id -= id & -id)
        ret -= fen[id];
    return ret;
}

inline ll get_val(ll a, ll b){
    return abs(a - b) * (a < b ? -s : t);
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);

    int n, q;
    cin >> n >> q >> s >> t;
    ll cur = 0;
    for(int i = 0; i <= n; i++){
        cin >> a[i];
        if(i)
            cur += get_val(a[i - 1], a[i]);
    }
    while(q--){
        int l, r, x; cin >> l >> r >> x;
        //cout << "ok " << l << ' ' << r << endl;
        if(l)
            cur -= get_val(get(l - 1), get(l));
        if(r < n)
            cur -= get_val(get(r), get(r + 1));
        add(r, x);
        if(l)
            add(l - 1, -x);
        if(l)
            cur += get_val(get(l - 1), get(l));
        if(r < n)
            cur += get_val(get(r), get(r + 1));
        cout << cur << '\n';
    }
}

/*
Why so fast...? 
Hold on...
Hold your breath...
Need anything else?

Nein, Kein Problem...
Das Leben war schon immer so grausam :)
*/

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 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 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 4856 KB Output is correct
2 Correct 127 ms 5468 KB Output is correct
3 Correct 119 ms 6092 KB Output is correct
4 Correct 115 ms 5252 KB Output is correct
5 Correct 125 ms 6012 KB Output is correct
6 Correct 91 ms 4912 KB Output is correct
7 Correct 82 ms 4896 KB Output is correct
8 Correct 131 ms 6332 KB Output is correct
9 Correct 117 ms 6840 KB Output is correct
10 Correct 120 ms 5348 KB Output is correct
11 Correct 89 ms 4940 KB Output is correct
12 Correct 88 ms 5240 KB Output is correct
13 Correct 81 ms 5636 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 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 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 119 ms 4856 KB Output is correct
23 Correct 127 ms 5468 KB Output is correct
24 Correct 119 ms 6092 KB Output is correct
25 Correct 115 ms 5252 KB Output is correct
26 Correct 125 ms 6012 KB Output is correct
27 Correct 91 ms 4912 KB Output is correct
28 Correct 82 ms 4896 KB Output is correct
29 Correct 131 ms 6332 KB Output is correct
30 Correct 117 ms 6840 KB Output is correct
31 Correct 120 ms 5348 KB Output is correct
32 Correct 89 ms 4940 KB Output is correct
33 Correct 88 ms 5240 KB Output is correct
34 Correct 81 ms 5636 KB Output is correct
35 Correct 124 ms 5024 KB Output is correct
36 Correct 131 ms 6456 KB Output is correct
37 Correct 135 ms 7224 KB Output is correct
38 Correct 130 ms 6988 KB Output is correct
39 Correct 125 ms 7004 KB Output is correct
40 Correct 149 ms 6984 KB Output is correct
41 Correct 138 ms 6860 KB Output is correct
42 Correct 141 ms 6988 KB Output is correct
43 Correct 124 ms 6208 KB Output is correct
44 Correct 124 ms 6568 KB Output is correct
45 Correct 122 ms 6452 KB Output is correct
46 Correct 131 ms 7264 KB Output is correct
47 Correct 85 ms 5536 KB Output is correct
48 Correct 95 ms 5708 KB Output is correct
49 Correct 126 ms 6276 KB Output is correct
50 Correct 89 ms 5472 KB Output is correct
51 Correct 86 ms 5472 KB Output is correct
52 Correct 92 ms 5580 KB Output is correct