제출 #571805

#제출 시각아이디문제언어결과실행 시간메모리
571805AdnanboiAddk (eJOI21_addk)C++17
36 / 100
2071 ms9236 KiB
#include <bits/stdc++.h>

using namespace std;

#define N 1000000
#define ll long long

vector<ll> lista(N);

ll n;

void update(int p, ll value){
    lista[p]=value;
}

ll sum2(int m, int begin, int end){
    ll result=0;
    for(int i=begin-1;i<begin+m-1;i++){
        result+=lista[i];
    }
    ll constantres=result;
    for(int i=begin;i<end-m+1;i++){
        constantres-=lista[i-1];
        constantres+=lista[i+m-1];
        result+=constantres;
    }
    return result;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll q,k;
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>lista[i];
    }
    cin>>q;
    for(int i=0;i<q;i++){
        short c;
        cin>>c;
        if(c==1){
            int a;
            cin>>a;
            int first=lista[a-1];
            int b=a;
            for(int i=0;i<k-1;i++){
                int d=b;
                cin>>b;
                update(d-1,lista[b-1]);
            }
            update(b-1,first);
        }
        else if(c==2){
            int a,b,m;
            cin>>a>>b>>m;
            cout<<sum2(m,a,b)<<'\n';
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...