oj.uz

답안 #359228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
359228 2021-01-26T12:52:40 Z Pety Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 182 ms 13420 KB 
#include <bits/stdc++.h>


using namespace std;

ifstream fin ("echilibru.in");
ofstream fout ("echilibru.out");

typedef long long ll;
int n, q;
ll aib[200002], a[200002], s, t;

ll query (int x) {
  ll s = 0;
  for (int i = x; i; i -= (i & -i))
    s += aib[i];
  return s;
}
void update (int x, ll val) {
  if (x > n)
    return;
  for (int i = x; i <= n; i += (i & -i))
    aib[i] += val;
}



int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  cin >> n >> q >> s >> t;
  n++;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    update(i, a[i]);
    update(i + 1, -a[i]);
  }
  ll sum = 0;
  for (int i = 1; i < n; i++) {
    if (a[i] < a[i + 1])
      sum += (a[i] - a[i + 1]) * s;
    else
      sum += (a[i] - a[i + 1]) * t;
  }
  ll l, r, x;
  while (q--) {
    cin >> l >> r >> x;
    l++;r++;
    if (l > 1) {
      ll val1 = query(l), val2 = query(l - 1);
      if (val2 < val1)
        sum -= (val2 - val1) * s;
      else
        sum -= (val2 - val1) * t;
    }
    if (r < n) {
      ll val1 = query(r + 1), val2 = query(r);
      if (val2 < val1)
        sum -= (val2 - val1) * s;
      else
        sum -= (val2 - val1) * t;
    }
    update(l, x);
    update(r + 1, -x);
    if (l > 1) {
      ll val1 = query(l), val2 = query(l - 1);
      if (val2 < val1)
        sum += (val2 - val1) * s;
      else
        sum += (val2 - val1) * t;
    }
    if (r < n) {
      ll val1 = query(r + 1), val2 = query(r);
      if (val2 < val1)
        sum += (val2 - val1) * s;
      else
        sum += (val2 - val1) * t;
    }
    cout << sum << "\n";
  }
  return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 3 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 165 ms 10508 KB Output is correct
2 Correct 164 ms 10988 KB Output is correct
3 Correct 167 ms 11628 KB Output is correct
4 Correct 161 ms 11116 KB Output is correct
5 Correct 166 ms 12140 KB Output is correct
6 Correct 131 ms 11244 KB Output is correct
7 Correct 121 ms 11116 KB Output is correct
8 Correct 156 ms 11928 KB Output is correct
9 Correct 158 ms 12268 KB Output is correct
10 Correct 154 ms 10988 KB Output is correct
11 Correct 128 ms 10988 KB Output is correct
12 Correct 119 ms 11756 KB Output is correct
13 Correct 121 ms 12012 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 3 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 165 ms 10508 KB Output is correct
23 Correct 164 ms 10988 KB Output is correct
24 Correct 167 ms 11628 KB Output is correct
25 Correct 161 ms 11116 KB Output is correct
26 Correct 166 ms 12140 KB Output is correct
27 Correct 131 ms 11244 KB Output is correct
28 Correct 121 ms 11116 KB Output is correct
29 Correct 156 ms 11928 KB Output is correct
30 Correct 158 ms 12268 KB Output is correct
31 Correct 154 ms 10988 KB Output is correct
32 Correct 128 ms 10988 KB Output is correct
33 Correct 119 ms 11756 KB Output is correct
34 Correct 121 ms 12012 KB Output is correct
35 Correct 163 ms 10800 KB Output is correct
36 Correct 168 ms 11860 KB Output is correct
37 Correct 171 ms 12804 KB Output is correct
38 Correct 164 ms 12524 KB Output is correct
39 Correct 168 ms 12652 KB Output is correct
40 Correct 174 ms 12596 KB Output is correct
41 Correct 167 ms 12396 KB Output is correct
42 Correct 168 ms 12396 KB Output is correct
43 Correct 164 ms 11756 KB Output is correct
44 Correct 166 ms 12140 KB Output is correct
45 Correct 168 ms 12140 KB Output is correct
46 Correct 182 ms 13420 KB Output is correct
47 Correct 133 ms 11756 KB Output is correct
48 Correct 137 ms 11756 KB Output is correct
49 Correct 153 ms 10732 KB Output is correct
50 Correct 131 ms 11628 KB Output is correct
51 Correct 125 ms 11992 KB Output is correct
52 Correct 139 ms 11756 KB Output is correct