oj.uz

답안 #964738

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964738 2024-04-17T12:42:27 Z zxcigan Addk (eJOI21_addk) C++17
92 / 100
 2000 ms 5972 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

const int N = 1e6 + 1;
const int mod = 1e9 + 7;

template <typename T>
bool umx(T& a, T b) {
    return (a < b ? a = b, 1 : 0);
}
template <typename T>
bool umn(T& a, T b) {
    return (a > b ? a = b, 1 : 0);
}
ll t[4 * N];
void build (int v, int tl, int tr, vector<ll>&pref) {
    if (tl == tr) {
        t[v] = pref[tl];
        return;
    }
    int tm = (tr + tl) >> 1;
    build (v << 1, tl, tm, pref);
    build (v << 1 | 1, tm + 1, tr, pref);
    t[v] = t[v << 1] + t[v << 1 | 1];
}
ll get (int v, int tl, int tr, int l, int r) {
    if (l < 1 || r < 1) return 0;
    if (l > r) return 0;
    if (l == tl && tr == r) return t[v];
    int tm = (tr + tl) >> 1;
    return get (v << 1, tl, tm, l, min (r, tm)) + get (v << 1 | 1, tm + 1, tr, max (l, tm + 1), r);
}
void update (int v, int tl, int tr, int l, int r, ll x) {
    if (l > r) return;
    if (tl == tr) {
        t[v] += x;
        return;
    }
    int tm = (tr + tl) >> 1;
    update (v << 1, tl, tm, l, min (r, tm), x);
    update (v << 1 | 1, tm + 1, tr, max (l, tm + 1), r, x);
    t[v] = t[v << 1] + t[v << 1 | 1];
}
    int n, k;
void upd (int pos, int was, int nw) {
    update (1, 1, n, pos, n, nw - was);
}
void solve () {
    cin  >> n >> k;
    vector<int> a(n + 1);
    vector<ll> pref (n + 1);
    vector<ll> ppref (n + 1);
    for (int i = 1; i <= n; ++i) cin >> a[i], pref[i] = pref[i - 1] + a[i];
    build (1, 1, n, pref);
    int q;
    cin >> q;
    while (q--) {
        int type;
        cin >> type;
        if (type == 2) {
            int l, r, x;
            cin >> l >> r >> x;
            ll ans = 0;
            if (l == 1) {
                ans -= get (1, 1, n, 1, r - x);
            }
            else {
                ans -= get (1, 1, n,  l - 1, r - x);
            }
            ans += get (1, 1, n, l + x - 1, r);
            cout << ans << "\n";
        }
        else {
            vector<int> ve(k);
            for (int i = 0; i < k; ++i) cin >> ve[i];
            if (k != 1) {
                int last = a[ve[0]];
                for (int i = 0; i < k - 1; ++i) {
                    upd (ve[i], a[ve[i]], a[ve[i + 1]]);
                    a[ve[i]] = a[ve[i + 1]];
                }
                upd (ve.back(), a[ve.back()], last);
                a[ve.back()] = last;
                for (int i = 1; i <= n; ++i) pref[i] = pref[i - 1] + a[i];
            }
        }
    }
}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    //    freopen ("input.txt", "r", stdin);
//    freopen ("output.txt", "w", stdout);
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    while (T--) solve();
    return 0;
}

Subtask #1
36.0 / 36.0

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

Subtask #2
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 3160 KB Output is correct
2 Correct 26 ms 3604 KB Output is correct
3 Correct 31 ms 3820 KB Output is correct
4 Correct 57 ms 4956 KB Output is correct
5 Correct 84 ms 5960 KB Output is correct
6 Correct 77 ms 5968 KB Output is correct
7 Correct 80 ms 5972 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2067 ms 3688 KB Time limit exceeded
2 Halted 0 ms 0 KB -