제출 #1036005

#제출 시각아이디문제언어결과실행 시간메모리
1036005christinelynnAddk (eJOI21_addk)C++17
0 / 100
78 ms2896 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 == 1) continue;
    m = min(m, r-l+2 - m);
    ll ans = 0;
    for (ll i=1; i<=m; i++) {
      ans += (pref[r] - pref[l-1]);
      l++;
      r--;
      if (l > r) break;
    }
    cout<<ans<<endl;
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...