제출 #483529

#제출 시각아이디문제언어결과실행 시간메모리
483529otogagnidzeAddk (eJOI21_addk)C++14
0 / 100
133 ms1932 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n, k; cin >> n >> k; long long a[n + 1], b[n + 1], b2[n + 1]; b[0] = 0; b2[0] = 0; for(int i = 1; i <= n; i++){ cin >> a[i]; b[i] = b[i - 1] + a[i]; b2[i] = b2[i - 1] + b[i]; } /*for(int i = 1; i <= n; i++){ cout << b[i] << " "; } cout << endl; for(int i = 1; i <= n; i++){ cout << b2[i] << " "; } */ int q; cin >> q; while(q--){ int h, l, r, m; cin >> h; if(h == 2){ cin >> l >> r >> m; m = min((r - l + 1) / 2, m); long long ans = b2[r] - b2[r - m] - b2[l + m - 2]; if(l - 2 > 0) ans += b2[l - 2]; cout << ans << endl; } else{ int d; for(int i = 1; i <= k; i++) cin >> d; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...