oj.uz

Submission #1073021

# Submission time Handle Problem Language Result Execution time Memory
1073021 2024-08-24T08:42:53 Z raduv Addk (eJOI21_addk) C++14
92 / 100
 93 ms 11604 KB 
#include <bits/stdc++.h>
#define int long long
const int MAXN = 100'005;
const int MAXK = 15;
int sp[MAXN + 1];
int v[MAXN + 1];
int aint[(MAXN + 1) * 4];
int no_nums[(MAXN + 1) * 4];
int poz[MAXK];
int lazy[(MAXN + 1) * 4];
void propagate(int node){
  lazy[2 * node] += lazy[node];
  lazy[2 * node + 1] += lazy[node];
  aint[2 * node] += lazy[node] * no_nums[2 * node];
  aint[2 * node + 1] += lazy[node] * no_nums[2 * node + 1];
  lazy[node] = 0;
}
void build(int node, int st, int dr){
  if(st == dr){
    aint[node] = sp[st];
    no_nums[node] = 1;
  }
  else{
    int mij = (st + dr) / 2;
    build(2 * node, st, mij);
    build(2 * node + 1, mij + 1, dr);
    aint[node] = (aint[2 * node] + aint[2 * node + 1]);
    no_nums[node] = (no_nums[2 * node] + no_nums[2 * node + 1]);
  }
}
void update(int node, int st, int dr, int l, int r, int val){
  if(l <= st && dr <= r){
    aint[node] += no_nums[node] * val;
    lazy[node] += val;
  }
  else{
    if(lazy[node] > 0)
      propagate(node);
    int mij = (st + dr) / 2;
    if(l <= mij)
      update(2 * node, st, mij, l, r, val);
    if(r > mij)
      update(2 * node + 1, mij + 1, dr, l, r, val);
    aint[node] = (aint[2 * node] + aint[2 * node + 1]);
  }
}
int query(int node, int st, int dr, int l, int r){
  if(l <= st && dr <= r){
    return aint[node];
  }
  else{
    if(lazy[node] > 0)
      propagate(node);
    int mij = (st + dr) / 2, sum = 0;
    if(l <= mij)
      sum += query(2 * node, st, mij, l, r);
    if(r > mij)
      sum += query(2 * node + 1, mij + 1, dr, l, r);
    return sum;
  }
}


signed main()
{
    int n, k, q, i, tip, j, aux, l, r, m, s1, s2;
    scanf("%lld%lld", &n, &k);
    for( i = 1; i <= n; i++ ){
      scanf("%lld", &v[i]);
      sp[i] = sp[i - 1] + v[i];
    }
    build(1, 1, n);
    scanf("%lld", &q);
    for( i = 0; i < q; i++ ){
      scanf("%lld", &tip);
      if(tip == 1){
        for( j = 0; j < k; j++ )
          scanf("%lld", &poz[j]);
        aux = v[poz[0]];
        for( j = 1; j < k; j++ ){
          update(1, 1, n, poz[j - 1], n, v[poz[j]] - v[poz[j - 1]]);
          v[poz[j - 1]] = v[poz[j]];
        }
        update(1, 1, n, poz[k - 1], n, aux - v[poz[k - 1]]);
        v[poz[k - 1]] = aux;
      }
      else{
        scanf("%lld%lld%lld", &l, &r, &m);
        s1 = query(1, 1, n, l + m - 1, r);
        s2 = query(1, 1, n, std::max(1LL, l - 1), std::max(1LL, r - m));
        printf("%lld\n", s1 - s2);
      }
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     scanf("%lld%lld", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:69:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |       scanf("%lld", &v[i]);
      |       ~~~~~^~~~~~~~~~~~~~~
Main.cpp:73:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |     scanf("%lld", &q);
      |     ~~~~~^~~~~~~~~~~~
Main.cpp:75:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |       scanf("%lld", &tip);
      |       ~~~~~^~~~~~~~~~~~~~
Main.cpp:78:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |           scanf("%lld", &poz[j]);
      |           ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:88:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |         scanf("%lld%lld%lld", &l, &r, &m);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 5 ms 1148 KB Output is correct
8 Correct 5 ms 1116 KB Output is correct
9 Correct 8 ms 1628 KB Output is correct

Subtask #2
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2908 KB Output is correct
2 Correct 31 ms 3296 KB Output is correct
3 Correct 37 ms 5456 KB Output is correct
4 Correct 67 ms 9268 KB Output is correct
5 Correct 93 ms 10832 KB Output is correct
6 Correct 86 ms 11604 KB Output is correct
7 Correct 88 ms 11576 KB Output is correct

Subtask #3
0 / 8.0

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