제출 #1183731

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1183731		LilPluton	Addk (eJOI21_addk)	C++20	0 / 100	2093 ms	1328 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define ld long double
#define ar array
#define vc vector
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define rep(i,a,b) for(int i = a; i < b; i++)
#define per(i,a,b) for(int i = a; i >= b; i--)
#define trav(a,x) for(auto& a : x)
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " = " << x << endl
const int N = 2e5 + 5;
const int L = 24;
const int inf = 1e9 + 7;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

struct BIT{
    int n;
    vector<int> bit;
    BIT(int n) : n(n), bit(n + 1) {}
    void add(int i, int x) {
        for (; i <= n; i += i & -i) bit[i] += x;
    }
    int sum(int i) {
        int s = 0;
        for (; i > 0; i -= i & -i) s += bit[i];
        return s;
    }
    int sum(int l, int r) { return sum(r) - sum(l - 1); }
};

void solve(){
    int n, k;
    cin >> n >> k;
    vector<int> a(n + 1);
    BIT bit(n);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        bit.add(i, a[i]);
    }
    int q;
    cin >> q;
    while(q--){
        int ty, l, r, m;
        cin >> ty;
        if(ty == 2){
            cin >> l >> r >> m;
            int ans = 0;
            for(int i = l; i + m - 1 <= r; i++){
                ans += bit.sum(i + m - 1);
                ans -= bit.sum(i - 1);
            }
            cout << ans << endl;
        }
    }

}
 
signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
 
    int T = 1;
    while(T--){
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 36
• Subtask 2: 0 / 56
• Subtask 3: 0 / 8