제출 #1312076

#제출 시각아이디문제언어결과실행 시간메모리
1312076maya_sAddk (eJOI21_addk)C++20
36 / 100
2095 ms4556 KiB
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
typedef long long ll;

int main(){
    ll n, k; cin >> n >> k;
    vector<ll> v(n);
    for(ll i = 0; i < n; i++) cin >> v[i];
    ll q; cin >> q;
    while(q--){
        ll t; cin >> t;
        if(t == 1){
            vector<ll> x(k);
            for(ll i = 0; i < k; i++) cin >> x[i];
        }
        else{
            ll l, r, m; cin >> l >> r >> m; l--, r--;
            ll sum = 0, window = 0;
            for(ll i = l; i < l+m; i++) window += v[i];
            sum = window;
            for(ll i = l+m; i <= r; i++) window += v[i] - v[i-m], sum += window;
            cout << sum << "\n";
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...