oj.uz

Submission #1039594

# Submission time Handle Problem Language Result Execution time Memory
1039594 2024-07-31T05:02:39 Z andecaandeci Addk (eJOI21_addk) C++17
92 / 100
 132 ms 7504 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dj[] = {0, 0, 1, -1, 1, -1, 1, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()

void solve() {
  int n,k;cin>>n>>k;
  vector<int> a(n), pref1(n), pref2(n), suff2(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    pref1[i] = a[i];
    pref2[i] = (i+1)*a[i];
    if (i > 0) pref1[i] += pref1[i-1], pref2[i] += pref2[i-1];
  }

  for (int i = n-1; i >= 0; i--) {
    suff2[i] = (n-1-i+1)*a[i];
    if (i+1 < n)suff2[i] += suff2[i+1];
  }

  function<int(int, int)> sum = [&](int l, int r) {
    if (r < l) return 0ll;
    return pref1[r] - (l-1 >= 0 ? pref1[l-1] : 0);
  };

  function<int(int,int)> sum_mul = [&](int l, int r) {
    return pref2[r] - (l-1 >= 0 ? pref2[l-1] : 0);
  };

  function<int(int, int)> suff_mul = [&](int l, int r) {
    return suff2[l] - (r+1 < n ? suff2[r+1] : 0);
  };

  function<int(int, int)> rnge = [&](int l, int r) {
    return sum_mul(l, r) - l * sum(l, r);
  };

  function<int(int, int)> rngesuff = [&](int l, int r) {
    return suff_mul(l, r) - (n-1-r) * sum(l, r);
  };

  int q;cin>>q;
  while (q--) {
    int t;cin>>t;
    if (t == 1) {
      int trash;
      for (int i = 0; i < k; i++) cin  >> trash;
      continue;
    } else {
      int l,r,m;cin>>l>>r>>m;l--;r--;

      int len = (r-l+1);
      int x = min(len-m+1, m)-1;
      // debug(x);
      // debug(rnge(l, l+x-1));
      // debug(x*sum(l+x, r - x));

      // debug(r-x+1);
      // debug(rngesuff(r-x+1, r));

      cout << rnge(l, l+x-1) + (x+1)*sum(l+x, r - x) + rngesuff(r-x+1, r) << endl;
    }
  }
}

int32_t main() {
  ios_base::sync_with_stdio(0);cin.tie(0);
  int t=1;
  while(t--) solve();

  return 0;
}

Subtask #1
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 4 ms 604 KB Output is correct
5 Correct 5 ms 856 KB Output is correct
6 Correct 6 ms 760 KB Output is correct
7 Correct 8 ms 832 KB Output is correct
8 Correct 9 ms 856 KB Output is correct
9 Correct 12 ms 1012 KB Output is correct

Subtask #2
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1628 KB Output is correct
2 Correct 37 ms 2544 KB Output is correct
3 Correct 50 ms 3032 KB Output is correct
4 Correct 88 ms 5204 KB Output is correct
5 Correct 132 ms 7504 KB Output is correct
6 Correct 121 ms 7120 KB Output is correct
7 Correct 114 ms 7244 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 3664 KB Output isn't correct
2 Halted 0 ms 0 KB -