Submission #1036025

#TimeUsernameProblemLanguageResultExecution timeMemory
1036025christinelynnAddk (eJOI21_addk)C++17
0 / 100
2075 ms1116 KiB
#include <bits/stdc++.h> #define nikah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ll long long const ll maxn = 1e5+7; using namespace std; ll n,q,k; ll a[maxn], pref[maxn]; int main() { nikah cin>>n>>k; for (ll i=1; i<=n; i++) { cin>>a[i]; pref[i] = a[i] + pref[i-1]; } cin>>q; while (q--) { ll mode,l,r,m; cin>>mode>>l>>r>>m; if (mode == 2) { ll ans = 0, re = l + m - 1; while (re <= r) { for (ll i=l; i<=re; i++) { ans += a[i]; } re++; l++; } cout<<ans<<endl; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...