제출 #583761

#제출 시각아이디문제언어결과실행 시간메모리
583761IvkosqnAddk (eJOI21_addk)C++14
0 / 100
32 ms1804 KiB
#include <bits/stdc++.h> #define endl '\n' using namespace std; const int maxn = 1e5 + 1; int n, k, a[maxn]; unsigned long long p[maxn], pref[maxn]; void solve(){ int q; cin >> q; while(q--){ int type; cin >> type; if(type == 1){ for(int i = 0;i < k;i++){ int a; cin >> a; } continue; } int l, r, m; cin >> l >> r >> m; unsigned long long ans = 0; ans = pref[r] - pref[l + m - 2]; ans = ans - (pref[r - m] - pref[min(0, l - 2)]); cout << ans << endl; } } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> k; for(int i = 1;i <= n;i++){ cin >> a[i]; p[i] = p[i - 1] + a[i]; } for(int i = 1;i <= n;i++){ pref[i] = pref[i - 1] + p[i]; } solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...