oj.uz

답안 #948328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948328 2024-03-18T04:12:19 Z steveonalex Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 122 ms 14932 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
struct FenwickTree{
    ll n;
    vector<ll> a;

    FenwickTree(ll _n){
        n = _n;
        a.resize(n+1);
    }

    void update(ll i, ll v){
        while(i <= n){
            a[i] += v;
            i += LASTBIT(i);
        }
    }

    ll get(ll i){
        ll ans = 0;
        while(i > 0){
            ans += a[i];
            i -= LASTBIT(i);
        }
        return ans;
    }
};

const ll N = 2e5 + 69;

ll n, q;
ll s, t;
ll dt[N];
FenwickTree bit(N);
ll ans= 0;

void update(ll l, ll r, ll val){
    ans -= dt[l];
    ans -= dt[r+1];
    bit.update(l, val);
    bit.update(r + 1, -val);
    dt[l] = bit.get(l) - bit.get(l-1);
    if (dt[l] > 0) dt[l] *= s;
    else dt[l] *= t;

    dt[r+1] = bit.get(r+1) - bit.get(r);
    if (dt[r+1] > 0) dt[r+1] *= s;
    else dt[r+1] *= t;

    ans += dt[l]; ans += dt[r+1];
}
 
int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> q >> s >> t;
    vector<ll> a(n+1);
    for(ll i= 0; i<=n; ++i) cin >> a[i];

    for(ll i = 1; i<=n; ++i){
        update(i, i, a[i]);
    }
    while(q--){
        ll l, r, x; cin >> l >> r >> x;
        update(l, r, x);
        cout << -(ans - dt[n+1]) << "\n";
    }

    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 3 ms 1884 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 2 ms 1880 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 2 ms 1880 KB Output is correct
11 Correct 3 ms 1884 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 2 ms 1880 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 2 ms 1956 KB Output is correct
16 Correct 2 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 2 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 6480 KB Output is correct
2 Correct 113 ms 7036 KB Output is correct
3 Correct 111 ms 7756 KB Output is correct
4 Correct 93 ms 6740 KB Output is correct
5 Correct 101 ms 7584 KB Output is correct
6 Correct 84 ms 8100 KB Output is correct
7 Correct 82 ms 8020 KB Output is correct
8 Correct 107 ms 8068 KB Output is correct
9 Correct 98 ms 8272 KB Output is correct
10 Correct 96 ms 7012 KB Output is correct
11 Correct 80 ms 7996 KB Output is correct
12 Correct 87 ms 8468 KB Output is correct
13 Correct 80 ms 13396 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 3 ms 1884 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 2 ms 1884 KB Output is correct
8 Correct 2 ms 1880 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 2 ms 1880 KB Output is correct
11 Correct 3 ms 1884 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 2 ms 1880 KB Output is correct
14 Correct 2 ms 1884 KB Output is correct
15 Correct 2 ms 1956 KB Output is correct
16 Correct 2 ms 1884 KB Output is correct
17 Correct 2 ms 1884 KB Output is correct
18 Correct 2 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 99 ms 6480 KB Output is correct
23 Correct 113 ms 7036 KB Output is correct
24 Correct 111 ms 7756 KB Output is correct
25 Correct 93 ms 6740 KB Output is correct
26 Correct 101 ms 7584 KB Output is correct
27 Correct 84 ms 8100 KB Output is correct
28 Correct 82 ms 8020 KB Output is correct
29 Correct 107 ms 8068 KB Output is correct
30 Correct 98 ms 8272 KB Output is correct
31 Correct 96 ms 7012 KB Output is correct
32 Correct 80 ms 7996 KB Output is correct
33 Correct 87 ms 8468 KB Output is correct
34 Correct 80 ms 13396 KB Output is correct
35 Correct 100 ms 12112 KB Output is correct
36 Correct 107 ms 13392 KB Output is correct
37 Correct 106 ms 14160 KB Output is correct
38 Correct 122 ms 14164 KB Output is correct
39 Correct 105 ms 13952 KB Output is correct
40 Correct 109 ms 14096 KB Output is correct
41 Correct 103 ms 13904 KB Output is correct
42 Correct 103 ms 13904 KB Output is correct
43 Correct 110 ms 13652 KB Output is correct
44 Correct 102 ms 13648 KB Output is correct
45 Correct 116 ms 13564 KB Output is correct
46 Correct 103 ms 14932 KB Output is correct
47 Correct 86 ms 13336 KB Output is correct
48 Correct 82 ms 13392 KB Output is correct
49 Correct 105 ms 12372 KB Output is correct
50 Correct 79 ms 13136 KB Output is correct
51 Correct 79 ms 13396 KB Output is correct
52 Correct 79 ms 13320 KB Output is correct