제출 #1285038

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285038		tuncay_pasha	Addk (eJOI21_addk)	C++20	92 / 100	33 ms	5032 KiB

Main

// Try to be as positive as natural numbers :)
#include "bits/stdc++.h"

#define int long long

const int N = 1e5 + 5;

int a[N];
int p1[N], p2[N], s[N];

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int n, k;
  std::cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    std::cin >> a[i];
  }
  for (int i = 1; i <= n; ++i) {
    p1[i] = p1[i - 1] + a[i] * i;
  }
  for (int i = 1; i <= n; ++i) {
    p2[i] = p2[i - 1] + a[i];
  }
  for (int i = n; i >= 1; --i) {
    s[i] = s[i + 1] + a[i] * (n - i + 1);
  }
  int q;
  std::cin >> q;
  while (q--) {
    int t;
    std::cin >> t;
    if (t == 1) {
      int i;
      std::cin >> i;
      continue;
    }
    int l, r, m;
    std::cin >> l >> r >> m;
    m = std::min(m, (r - l + 1) - m + 1);
    int pt1 = p1[l + m - 2] - p1[l - 1] - (l - 1) * (p2[l + m - 2] - p2[l - 1]);
    int pt2 = s[r - m + 2] - s[r + 1] - (n - r) * (p2[r] - p2[r - m + 1]);
    int pt3 = (p2[r - m + 1] - p2[l + m - 2]) * m;
    int ans = pt1 + pt2 + pt3;
    std::cout << ans << '\n';
  }
}

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