oj.uz

답안 #531130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
531130 2022-02-27T19:44:07 Z fabijan_cikac Addk (eJOI21_addk) C++17
92 / 100
 62 ms 6576 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long int
#define F first
#define S second
#define pll pair<ll, ll>

const int N = 1e5 + 100;

int n, k, q;
ll a[N]; pll fen[N];

void update(int x, ll val){
    a[x] += val; ++x; int y = x;
    while (x <= n){
        fen[x] = {fen[x].F + val, fen[x].S + y * val}; x += x & (-x);
    }
}

pll query(int x){
    ++x; pll val = {0, 0};
    while (x > 0){
        val = {val.F + fen[x].F, val.S + fen[x].S}; x -= x & (-x);
    }
    return val;
}

pll range_sum(int l, int r){
    if (l > r) return {0, 0};
    pll val1 = query(l - 1); pll val2 = query(r);
    return {val2.F - val1.F, val2.S - val1.S - l * (val2.F - val1.F)};
}

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

    cin >> n >> k;
    for (int i = 0; i < n; ++i){
        int x; cin >> x; update(i, x);
    }
    cin >> q;
    for (int i = 0; i < q; ++i){
        int u; cin >> u;
        if (u == 1){
            vector<int> v; v.resize(k);
            for (int i = 0; i < k; ++i){
                cin >> v[i]; --v[i];
            }
            ll cp = a[v[0]];
            for (int i = 0; i < k - 1; ++i)
                update(v[i], a[v[i + 1]] - a[v[i]]);
            update(v[k - 1], a[v[k - 1]] - cp);
        }
        else{
            int l, r, m; cin >> l >> r >> m; --l; --r;
            int siz = (r - l + 1);
            if (siz >= 2 * m){
                ll sum1 = range_sum(l, l + m - 1).S;
                ll sum2 = m * range_sum(l + m, r - m).F;
                ll sum3 = (m + 1) * range_sum(r - m + 1, r).F - range_sum(r - m + 1, r).S;
                cout << sum1 + sum2 + sum3;
            }
            else if (m < siz){
                if (siz == 2 * m - 1){
                    ll sum1 = range_sum(l, l + m - 2).S;
                    ll sum2 = m * range_sum(l + m - 1, r - m + 1).F;
                    ll sum3 = m * range_sum(r - m + 2, r).F - range_sum(r - m + 2, r).S;
                    cout << sum1 + sum2 + sum3;
                }
                else{
                    ll sum1 = range_sum(l, l + (siz - m)).S;
                    ll sum2 = (siz - m + 1) * range_sum(l + (siz - m) + 1, r - (siz - m + 1)).F;
                    ll sum3 = (siz - m + 2) * range_sum(r - (siz - m), r).F - range_sum(r - (siz - m), r).S;
                    cout << sum1 + sum2 + sum3;
                }
            }
            else cout << range_sum(l, r).F;
            cout << '\n';
        }
    }

    return 0;
}

Subtask #1
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 4 ms 612 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 4 ms 720 KB Output is correct
9 Correct 6 ms 844 KB Output is correct

Subtask #2
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1484 KB Output is correct
2 Correct 19 ms 2120 KB Output is correct
3 Correct 25 ms 2760 KB Output is correct
4 Correct 40 ms 4680 KB Output is correct
5 Correct 62 ms 6576 KB Output is correct
6 Correct 57 ms 6340 KB Output is correct
7 Correct 60 ms 6348 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 40 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -