oj.uz

Submission #307596

# Submission time Handle Problem Language Result Execution time Memory
307596 2020-09-28T19:36:12 Z milleniumEeee Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 524 ms 13688 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int MAXN = (int)2e5 + 5;

int a[MAXN];
int tree[MAXN * 4], lazy[MAXN * 4];
int n, q, s, t;

void build(int v, int tl, int tr) {
  if (tl == tr) {
    tree[v] = a[tl];
    return;
  }
  int mid = (tl + tr) >> 1;
  build(v + v, tl, mid);
  build(v + v + 1, mid + 1, tr);
}

void push(int v, int tl, int tr) {
  if (!lazy[v]) { 
    return;
  }
  if (tl != tr) {
    lazy[v + v] += lazy[v];
    lazy[v + v + 1] += lazy[v];
  } else {
    tree[v] += lazy[v];
  }
  lazy[v] = 0;
}

void upd(int l, int r, int val, int v, int tl, int tr) {
  push(v, tl, tr);
  if (l <= tl && tr <= r) {
    lazy[v] = val;
    push(v, tl, tr);
    return;
  }
  if (l > tr || tl > r) {
    return;
  }
  int mid = (tl + tr) >> 1;
  upd(l, r, val, v + v, tl, mid);
  upd(l, r, val, v + v + 1, mid + 1, tr);
}

int get(int pos, int v, int tl, int tr) {
  if (pos == 0) { // case
    return 0;
  }
  
  push(v, tl, tr);
  if (tl == tr) {
    return tree[v];
  }
  int mid = (tl + tr) >> 1;
  if (pos <= mid) {
    return get(pos, v + v, tl, mid);
  } else {
    return get(pos, v + v + 1, mid + 1, tr);
  }
}

int calc(int i, int j) { // i < j
  int x = get(i, 1, 1, n);
  int y = get(j, 1, 1, n);
  int diff = abs(x - y);
  if (x < y) {
    return -(diff * s);
  } else {
    return diff * t;
  }
}


signed main() {
  cin >> n >> q >> s >> t;
  for (int i = 0; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  build(1, 1, n);
  int ans = 0;
  for (int i = 0; i < n; i++) {
    ans += calc(i, i + 1);
  }
  while (q--) {
    int l, r, val;
    scanf("%lld %lld %lld", &l, &r, &val);
    if (l - 1 >= 0) {
      ans -= calc(l - 1, l);
    }
    if (r + 1 <= n) {
      ans -= calc(r, r + 1);
    }
    upd(l, r, val, 1, 1, n);
    if (l - 1 >= 0) {
      ans += calc(l - 1, l);
    }
    if (r + 1 <= n) {
      ans += calc(r, r + 1);
    }
    printf("%lld\n", ans);
  }
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:81:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   81 |     scanf("%lld", &a[i]);
      |     ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp:90:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   90 |     scanf("%lld %lld %lld", &l, &r, &val);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 506 ms 10468 KB Output is correct
2 Correct 514 ms 12024 KB Output is correct
3 Correct 519 ms 12664 KB Output is correct
4 Correct 492 ms 11640 KB Output is correct
5 Correct 504 ms 12408 KB Output is correct
6 Correct 187 ms 8824 KB Output is correct
7 Correct 193 ms 8824 KB Output is correct
8 Correct 432 ms 12920 KB Output is correct
9 Correct 425 ms 13052 KB Output is correct
10 Correct 428 ms 11912 KB Output is correct
11 Correct 251 ms 8952 KB Output is correct
12 Correct 181 ms 9208 KB Output is correct
13 Correct 214 ms 9592 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 4 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 506 ms 10468 KB Output is correct
23 Correct 514 ms 12024 KB Output is correct
24 Correct 519 ms 12664 KB Output is correct
25 Correct 492 ms 11640 KB Output is correct
26 Correct 504 ms 12408 KB Output is correct
27 Correct 187 ms 8824 KB Output is correct
28 Correct 193 ms 8824 KB Output is correct
29 Correct 432 ms 12920 KB Output is correct
30 Correct 425 ms 13052 KB Output is correct
31 Correct 428 ms 11912 KB Output is correct
32 Correct 251 ms 8952 KB Output is correct
33 Correct 181 ms 9208 KB Output is correct
34 Correct 214 ms 9592 KB Output is correct
35 Correct 512 ms 11512 KB Output is correct
36 Correct 523 ms 12792 KB Output is correct
37 Correct 509 ms 13688 KB Output is correct
38 Correct 508 ms 13432 KB Output is correct
39 Correct 522 ms 13432 KB Output is correct
40 Correct 524 ms 13432 KB Output is correct
41 Correct 521 ms 13304 KB Output is correct
42 Correct 508 ms 13360 KB Output is correct
43 Correct 511 ms 12664 KB Output is correct
44 Correct 515 ms 13048 KB Output is correct
45 Correct 503 ms 12920 KB Output is correct
46 Correct 506 ms 13560 KB Output is correct
47 Correct 190 ms 9336 KB Output is correct
48 Correct 243 ms 9592 KB Output is correct
49 Correct 492 ms 12704 KB Output is correct
50 Correct 253 ms 9468 KB Output is correct
51 Correct 182 ms 9460 KB Output is correct
52 Correct 275 ms 9336 KB Output is correct