oj.uz

답안 #948323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948323 2024-03-18T04:09:40 Z steveonalex Foehn Phenomena (JOI17_foehn_phenomena) C++14
30 / 100
 117 ms 12888 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{
    int n;
    vector<ll> a;

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

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

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

const int N = 2e5 + 69;

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

void update(int l, int r, int 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<int> a(n+1);
    for(int i= 0; i<=n; ++i) cin >> a[i];

    for(int i = 1; i<=n; ++i){
        update(i, i, a[i]);
    }
    while(q--){
        int 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 1880 KB Output is correct
2 Correct 2 ms 2140 KB Output is correct
3 Correct 2 ms 2140 KB Output is correct
4 Correct 2 ms 2140 KB Output is correct
5 Correct 2 ms 2140 KB Output is correct
6 Correct 2 ms 2136 KB Output is correct
7 Correct 2 ms 2140 KB Output is correct
8 Correct 2 ms 2060 KB Output is correct
9 Correct 3 ms 2140 KB Output is correct
10 Correct 2 ms 2140 KB Output is correct
11 Correct 2 ms 2140 KB Output is correct
12 Correct 2 ms 2140 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 2 ms 2060 KB Output is correct
17 Correct 2 ms 2056 KB Output is correct
18 Correct 2 ms 2136 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 11184 KB Output is correct
2 Correct 113 ms 11604 KB Output is correct
3 Correct 106 ms 12192 KB Output is correct
4 Correct 105 ms 11652 KB Output is correct
5 Correct 102 ms 12888 KB Output is correct
6 Correct 92 ms 11928 KB Output is correct
7 Correct 86 ms 11760 KB Output is correct
8 Correct 105 ms 12640 KB Output is correct
9 Correct 117 ms 12884 KB Output is correct
10 Correct 102 ms 11720 KB Output is correct
11 Correct 80 ms 11640 KB Output is correct
12 Incorrect 82 ms 12332 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 2 ms 2140 KB Output is correct
3 Correct 2 ms 2140 KB Output is correct
4 Correct 2 ms 2140 KB Output is correct
5 Correct 2 ms 2140 KB Output is correct
6 Correct 2 ms 2136 KB Output is correct
7 Correct 2 ms 2140 KB Output is correct
8 Correct 2 ms 2060 KB Output is correct
9 Correct 3 ms 2140 KB Output is correct
10 Correct 2 ms 2140 KB Output is correct
11 Correct 2 ms 2140 KB Output is correct
12 Correct 2 ms 2140 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 2 ms 1884 KB Output is correct
16 Correct 2 ms 2060 KB Output is correct
17 Correct 2 ms 2056 KB Output is correct
18 Correct 2 ms 2136 KB Output is correct
19 Correct 1 ms 1880 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 107 ms 11184 KB Output is correct
23 Correct 113 ms 11604 KB Output is correct
24 Correct 106 ms 12192 KB Output is correct
25 Correct 105 ms 11652 KB Output is correct
26 Correct 102 ms 12888 KB Output is correct
27 Correct 92 ms 11928 KB Output is correct
28 Correct 86 ms 11760 KB Output is correct
29 Correct 105 ms 12640 KB Output is correct
30 Correct 117 ms 12884 KB Output is correct
31 Correct 102 ms 11720 KB Output is correct
32 Correct 80 ms 11640 KB Output is correct
33 Incorrect 82 ms 12332 KB Output isn't correct
34 Halted 0 ms 0 KB -