oj.uz

Submission #824223

# Submission time Handle Problem Language Result Execution time Memory
824223 2023-08-13T19:12:44 Z taher Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 117 ms 7228 KB 
#include <bits/stdc++.h>

using namespace std;

template <typename T>
class fenwick {
  public:
  vector<T> fenw;
  int n;

  fenwick(int _n) : n(_n) {
    fenw.resize(n);
  }

  void modify(int x, T v) {
    while (x < n) {
      fenw[x] += v;
      x |= (x + 1);
    }
  }

  T get(int x) {
    T v{};
    while (x >= 0) {
      v += fenw[x];
      x = (x & (x + 1)) - 1;
    }
    return v;
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q, s, t;
  cin >> n >> q >> s >> t;
  ++n;

  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long res = 0;

  fenwick<long long> fenw(n + 1);
  auto Contribution = [&](int i) {
    long long la = a[i] + fenw.get(i);
    long long lb = a[i - 1] + fenw.get(i - 1);
    if (lb < la) {
      return -1LL * (s * (la - lb));
    } else {
      return +1LL * (t * (lb - la));
    }
  };

  for (int i = 1; i < n; i++) {
    res += Contribution(i);
  }

  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;

    if (r + 1 < n) {
      res -= Contribution(r + 1);  
    }
    res -= Contribution(l);

    long long y;
    cin >> y;
    fenw.modify(l, +y);
    fenw.modify(r + 1, -y);

    if (r + 1 < n) {
      res += Contribution(r + 1);
    }
    res += Contribution(l);

    cout << res << '\n';
  }
  return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 4824 KB Output is correct
2 Correct 109 ms 5452 KB Output is correct
3 Correct 114 ms 6044 KB Output is correct
4 Correct 105 ms 5256 KB Output is correct
5 Correct 107 ms 5948 KB Output is correct
6 Correct 74 ms 6380 KB Output is correct
7 Correct 75 ms 6348 KB Output is correct
8 Correct 106 ms 6260 KB Output is correct
9 Correct 106 ms 6604 KB Output is correct
10 Correct 103 ms 5304 KB Output is correct
11 Correct 72 ms 6348 KB Output is correct
12 Correct 74 ms 6760 KB Output is correct
13 Correct 71 ms 7204 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 109 ms 4824 KB Output is correct
23 Correct 109 ms 5452 KB Output is correct
24 Correct 114 ms 6044 KB Output is correct
25 Correct 105 ms 5256 KB Output is correct
26 Correct 107 ms 5948 KB Output is correct
27 Correct 74 ms 6380 KB Output is correct
28 Correct 75 ms 6348 KB Output is correct
29 Correct 106 ms 6260 KB Output is correct
30 Correct 106 ms 6604 KB Output is correct
31 Correct 103 ms 5304 KB Output is correct
32 Correct 72 ms 6348 KB Output is correct
33 Correct 74 ms 6760 KB Output is correct
34 Correct 71 ms 7204 KB Output is correct
35 Correct 106 ms 4988 KB Output is correct
36 Correct 114 ms 6348 KB Output is correct
37 Correct 114 ms 7164 KB Output is correct
38 Correct 117 ms 7004 KB Output is correct
39 Correct 112 ms 6988 KB Output is correct
40 Correct 111 ms 6980 KB Output is correct
41 Correct 111 ms 6852 KB Output is correct
42 Correct 111 ms 6904 KB Output is correct
43 Correct 109 ms 6256 KB Output is correct
44 Correct 113 ms 6580 KB Output is correct
45 Correct 109 ms 6412 KB Output is correct
46 Correct 107 ms 6992 KB Output is correct
47 Correct 75 ms 7060 KB Output is correct
48 Correct 81 ms 7228 KB Output is correct
49 Correct 102 ms 6132 KB Output is correct
50 Correct 74 ms 6956 KB Output is correct
51 Correct 73 ms 6996 KB Output is correct
52 Correct 77 ms 7012 KB Output is correct