Submission #777106

#	Time	Username	Problem	Language	Result	Execution time	Memory
777106		ind1v	Addk (eJOI21_addk)	C++11	0 / 100	28 ms	3560 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int N = 100005;
const int K = 15;

struct fenwick_tree {
  int64_t fenw[N];
  
  void upd(int idx, int val) {
    for (; idx < N; idx |= (idx + 1)) {
      fenw[idx] += val;
    }
  }
  
  int64_t get(int idx) {
    int64_t res = 0;
    for (; idx >= 0; idx &= (idx + 1), --idx) {
      res += fenw[idx];
    }
    return res;
  }
  
  int64_t get(int l, int r) {
    return get(r) - get(l - 1);
  }
};

int n, k;
int a[N];
int64_t p[N];
int idx[K];
int q;
fenwick_tree ft;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    p[i] = a[i] + p[i - 1];
  }
  for (int i = 1; i <= n; i++) {
    ft.upd(i, p[i]);
  }
  cin >> q;
  while (q--) {
    int t;
    cin >> t;
    if (t == 1) {
      for (int i = 1; i <= k; i++) {
        cin >> idx[i]; 
      }
    } else if (t == 2) {
      int l, r, m;
      cin >> l >> r >> m;
      cout << ft.get(min(l + m - 1, r), r) - ft.get(l - 1, l + (r - min(l + m - 1, r) + 1) - 2) << '\n';
    }
  }
  return 0;
}

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