제출 #1280727

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280727		turali12	Addk (eJOI21_addk)	C++20	92 / 100	1775 ms	4560 KiB

Main

#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define pb push_back
#define rall(x) x.rbegin(),x.rend()
const int N=1e6+1,mod=998244353,MOD=1e9+7,INF=9223372036854775807;
int a[N],p[N];
/*bool lex(const string &a,const string &b){
    if(a.size()!=b.size())
        return a.size()<b.size();
    return a<b;
}*/
/*bool cmp(const pair<int,int>&a,const pair<int,int>&b){
    if(a.first!=b.first){
        return a.first<b.first;
    }
    return a.second<b.second;
}*/
signed main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int testcasescount=1;
    //cin>>testcasescount;
    while(testcasescount--){
        int n,k;
        cin>>n>>k;
        for(int i=1;i<=n;i++){
            cin>>a[i];
            p[i]=a[i]+p[i-1];
        }
        int q;
        cin>>q;
        while(q--){
            int t;
            cin>>t;
            if(t==1){
                int x;
                cin>>x;
            }
            if(t==2){
                int l,r,m,s=0;
                cin>>l>>r>>m;
                for(int i=l;i+m-1<=r;i++){
                    s+=p[i+m-1]-p[i-1];
                }
                cout<<s<<'\n';
            }
        }
    }
}

• Subtask 1: 36 / 36
• Subtask 2: 56 / 56
• Subtask 3: 0 / 8