제출 #825582

#제출 시각아이디문제언어결과실행 시간메모리
825582andecaandeciAddk (eJOI21_addk)C++17
92 / 100
1109 ms3376 KiB
#include<bits/stdc++.h>
using namespace std;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define tup tuple<int, int, int>
#define pii pair<int, int>
#define fi first
#define se second
#define pub push_back
#define pob pop_back
int n, k, q;
vector<int> arr;
signed main() {
    ioss;
    cin >> n >> k;
    arr.resize(n+2);
    int pref[n+2] = {};
    for(int i = 1; i <= n; i++) cin >> arr[i], pref[i] = pref[i-1]+arr[i];

    if(k == 1) {
        cin >> q;
        for(int i = 0; i < q; i++) {
            int idx; cin >> idx;
            if(idx == 1) {
                int num; cin >> num;
            }
            else {
                int l, r, m;
                cin >> l >> r >> m;
                int ans = 0;
                if(m > (r-l+1)/2) m = (r-l+1)-m+1;
                for(int j = 0; j < m; j++) ans += pref[r-j]-pref[l+j-1];
                cout << ans << endl;
            }
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...