Submission #1301750

#TimeUsernameProblemLanguageResultExecution timeMemory
1301750yusifmAddk (eJOI21_addk)C++20
0 / 100
210 ms1596 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define str string #define pb push_back #define pf push_front #define in insert #define all(v) v.begin(),v.end() #define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); const int sz=1000000,INF=1000000000; using namespace std; void solve() { ll n,m,l,num,Num,num1,num2,num3,_,ans; cin>>n>>m; vector<ll>prefs(n+1,0); for(int i=0;i<n;i++) { cin>>num; prefs[i+1]=prefs[i]+num; } cin>>l; for(int i=0;i<l;i++) { cin>>Num; if(Num==2) { cin>>num1>>num2>>num3; ans=0; for(int j=num1;j<=num2;j++) { if(j+num3<=num2) { ans+=prefs[j+num3-1]-prefs[j-1]; } } cout<<ans<<"\n"; } else { cin>>_; } } } int main() { fastIO; ll t=1; //cin>>t; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...