oj.uz

Submission #630086

# Submission time Handle Problem Language Result Execution time Memory
630086 2022-08-15T16:25:13 Z ZsofiaKeresztely Addk (eJOI21_addk) C++14
92 / 100
 409 ms 8232 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> lstairs, rstairs, pref;
ll n;

void upd(vector<ll> &a){
  pref.assign(n+1, 0);
  lstairs.assign(n+1, 0);
  rstairs.assign(n+1, 0);
  for (ll i=1; i<n+1; i++){
    pref[i] = pref[i-1] + a[i];
    lstairs[i] = lstairs[i-1] + pref[i];
  }
  rstairs[n] = a[n];
  for (ll i=n-1; i>0; i--){
    rstairs[i] = rstairs[i+1] + (pref[n] - pref[i-1]);
  }
  return;
}

int main(){
  ll k;
  cin >> n >> k;
  vector<ll> a(n+1);
  vector<ll> orig;
  for (ll i=1; i<n+1; i++){
    cin >> a[i];
  }
  orig = a;
  upd(a);
  cerr << "\n";
  ll q, type, val, l, r, m, sum, lastl, lastr, x;
  vector<ll> ind(k);
  set<ll> toupd;
  cin >> q;
  for (ll i=0; i<q; i++){
    cin >> type;
    if (type == 1){
      cin >> ind[0];
      toupd.insert(ind[0]);
      val = a[ind[0]];
      for (ll j=1; j<k; j++){
        cin >> ind[j];
        toupd.insert(ind[j]);
        a[ind[j-1]] = a[ind[j]];
      }
      a[ind[k-1]] = val;
      val = toupd.size();
      if (val * val >= n * k){
        upd(a);
        orig = a;
        toupd.clear();
      }
    }
    else{
      cin >> l >> r >> m;
      lastl = min(l+m-1, r-m+1);
      lastr = max(l+m-1, r-m+1);
      if (lastl == lastr){
        lastr++;
      }
      sum = rstairs[l] - rstairs[lastl+1] - (lastl - l + 1) * (pref[n] - pref[lastl])
      + lstairs[r] - lstairs[lastr-1] - (r - lastr + 1) * pref[lastr - 1]
      + (lastl - l + 1) * (pref[lastr-1] - pref[lastl]);
      for (auto i : toupd){
        x = min(i - l + 1, r - i + 1);
        if (x > 0){
          sum += (a[i] - orig[i]) * x;
        }
      }
      cout << sum << "\n";
    }
  }
  return 0;
}

Subtask #1
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 5 ms 436 KB Output is correct
4 Correct 8 ms 468 KB Output is correct
5 Correct 10 ms 596 KB Output is correct
6 Correct 14 ms 756 KB Output is correct
7 Correct 15 ms 716 KB Output is correct
8 Correct 20 ms 820 KB Output is correct
9 Correct 26 ms 1036 KB Output is correct

Subtask #2
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 1312 KB Output is correct
2 Correct 89 ms 2532 KB Output is correct
3 Correct 122 ms 3432 KB Output is correct
4 Correct 232 ms 5784 KB Output is correct
5 Correct 409 ms 8232 KB Output is correct
6 Correct 376 ms 7968 KB Output is correct
7 Correct 366 ms 7996 KB Output is correct

Subtask #3
0 / 8.0

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