oj.uz

답안 #1031988

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031988 2024-07-23T09:29:25 Z tvladm2009 Addk (eJOI21_addk) C++17
100 / 100
 144 ms 9608 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
#define int ll
 
const int N = 1e6 + 7;
 
int n, k, q, a[N], old[N];
 
struct Fenwick {
    vector<ll> f;
    int n;
    
    Fenwick(int nn) {
        n = nn;
        f.resize(n + 1);
    }
    
    void add(int i, int x) {
        for (; i <= n; i += i & -i) f[i] += x;
    }
    
    int sum(int i) {
        ll res = 0;
        for (; i >= 1; i -= i & -i) res += f[i];
        return res;
    }
    
    int get(int l, int r) {
        return sum(r) - sum(l - 1);
    }
};
 
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    Fenwick f1(n), f2(n), f3(n);
    for (int i = 1; i <= n; ++i) {
        f1.add(i, a[i]);
        f2.add(i, a[i] * i);
        f3.add(i, a[i] * (n - i + 1));
    }
    cin >> q;
    while (q--) {
        int t;
        cin >> t;
        if (t == 1) {
            vector<int> v(k);
            for (auto &x : v) cin >> x;
            for (auto x : v) {
                f1.add(x, -a[x]);
                f2.add(x, -a[x] * x);
                f3.add(x, -a[x] * (n - x + 1));
            }
            
            vector<int> rot;
            for (int i = 1; i < k; ++i) rot.push_back(v[i]);
            rot.push_back(v[0]);
            for (int i = 0; i < k; ++i) {
                f1.add(v[i], a[rot[i]]);
                f2.add(v[i], a[rot[i]] * v[i]);
                f3.add(v[i], a[rot[i]] * (n - v[i] + 1));
            }
            for (int i = 0; i < k; ++i) old[v[i]] = a[v[i]];
            for (int i = 0; i < k; ++i) a[v[i]] = old[rot[i]];
        } else {
            int l, r, m;
            cin >> l >> r >> m;
            ll ans = 0;
            if (r - l + 1 >= 2 * m) {
                ans += f2.get(l, l + m - 1) - f1.get(l, l + m - 1) * (l - 1);
                ans += f3.get(r - m + 1, r) - f1.get(r - m + 1, r) * (n - r);
                if (l + m <= r - m) {
                    ans += f1.get(l + m, r - m) * m;
                }
            } else {
                m = min(m, (r - l + 1) - m);
                ans += f2.get(l, l + m - 1) - f1.get(l, l + m - 1) * (l - 1);
                ans += f3.get(r - m + 1, r) - f1.get(r - m + 1, r) * (n - r);
                if (l + m <= r - m) {
                    ans += f1.get(l + m, r - m) * (m + 1);
                }
            }
            cout << ans << "\n";
        }
    }
    return 0;
}

Subtask #1
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 860 KB Output is correct
9 Correct 7 ms 1116 KB Output is correct

Subtask #2
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1884 KB Output is correct
2 Correct 17 ms 2720 KB Output is correct
3 Correct 19 ms 3420 KB Output is correct
4 Correct 36 ms 5972 KB Output is correct
5 Correct 50 ms 8152 KB Output is correct
6 Correct 50 ms 7864 KB Output is correct
7 Correct 47 ms 7864 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 4876 KB Output is correct
2 Correct 58 ms 6964 KB Output is correct
3 Correct 144 ms 9608 KB Output is correct
4 Correct 64 ms 8588 KB Output is correct