oj.uz

Submission #630017

# Submission time Handle Problem Language Result Execution time Memory
630017 2022-08-15T14:16:45 Z ZsofiaKeresztely Addk (eJOI21_addk) C++14
0 / 100
 367 ms 3576 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int> lstairs, rstairs, pref;
int n;

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

int main(){
  int k;
  cin >> n >> k;
  vector<int> a(n+1);
  vector<int> orig;
  for (int i=1; i<n+1; i++){
    cin >> a[i];
  }
  orig = a;
  upd(a);
  int q, type, val, l, r, m, sum, lastl, lastr, x;
  vector<int> ind(k);
  set<int> toupd;
  cin >> q;
  for (int i=0; i<q; i++){
    cin >> type;
    if (type == 1){
      cin >> ind[0];
      toupd.insert(ind[0]);
      val = a[ind[0]];
      for (int j=1; j<k; j++){
        cin >> ind[j];
        toupd.insert(ind[j]);
        a[ind[j-1]] = a[ind[j]];
      }
      a[ind[k-1]] = val;
      if (toupd.size() * toupd.size() >= n * k){
        upd(a);
        orig = a;
        toupd.clear();
      }
    }
    else{
      cin >> l >> r >> m;
      lastl = min((l+r)/2, l+m-1);
      lastr = max((l+r)/2+1, l-m+1);
      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 - 1 + 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;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:47:39: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |       if (toupd.size() * toupd.size() >= n * k){
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
0 / 36.0

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

Subtask #2
0 / 56.0

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

Subtask #3
0 / 8.0

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