oj.uz

답안 #780408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780408 2023-07-12T08:51:14 Z myde Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 96 ms 11480 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int maxn = 2e5;
int n, q, s, t, sumS = 0, sumT = 0;
int bit[maxn + 5];
int ls(int x) { return x & (-x); }

void upd(int x, int val)
{
  for (int i = x; i <= maxn; i += ls(i))
    bit[i] += val;
}

int get(int x)
{
  int res = 0;
  for (int i = x; i > 0; i -= ls(i))
    res += bit[i];
  return res;
}

int get(int l, int r)
{
  return get(r) - get(l - 1);
}

void updSum(int idx, int type)
{
  if (bit[idx] > 0)
    sumS += bit[idx] * type;
  else
    sumT -= bit[idx] * type;
}

signed main()
{
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> q >> s >> t;

  int bfr = 0, cur = 0;

  for (int i = 0; i <= n; i++)
  {
    cin >> cur;
    if (i == 0)
    {
      bfr = cur;
      continue;
    }

    bit[i] = cur - bfr;
    // cout << ": " << bit[i] << '\n';
    updSum(i, 1);

    bfr = cur;
  }

  while (q--)
  {
    // cout << ":: " << sumS << ' ' << sumT << '\n';
    int l, r, x;
    cin >> l >> r >> x;

    updSum(l, -1);
    if(r + 1 <= n)
    updSum(r + 1, -1);

    bit[l] += x;
    bit[r + 1] -= x;

    updSum(l, 1);
    if(r + 1 <= n)
    updSum(r + 1, 1);

    cout << -sumS * s + sumT * t << '\n';
  }
}

/*
0 4 1 8
  4 -3 7
sumS = 11
sumT = 3

0 6 3 8
  6 -3 5
 - 6 x 1 + 3 x 2 - 5 x 1  = -5


0 4 3 8
  4 -1 5
- 4 x 1 + 1 x 2 - 5 x 1 = -7

0 4 8 13
*/

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 392 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 388 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 8652 KB Output is correct
2 Correct 75 ms 9292 KB Output is correct
3 Correct 85 ms 9836 KB Output is correct
4 Correct 72 ms 9264 KB Output is correct
5 Correct 77 ms 10428 KB Output is correct
6 Correct 65 ms 9420 KB Output is correct
7 Correct 65 ms 9420 KB Output is correct
8 Correct 77 ms 10180 KB Output is correct
9 Correct 92 ms 10572 KB Output is correct
10 Correct 91 ms 9292 KB Output is correct
11 Correct 70 ms 9368 KB Output is correct
12 Correct 65 ms 10116 KB Output is correct
13 Correct 65 ms 10268 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 392 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 388 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 88 ms 8652 KB Output is correct
23 Correct 75 ms 9292 KB Output is correct
24 Correct 85 ms 9836 KB Output is correct
25 Correct 72 ms 9264 KB Output is correct
26 Correct 77 ms 10428 KB Output is correct
27 Correct 65 ms 9420 KB Output is correct
28 Correct 65 ms 9420 KB Output is correct
29 Correct 77 ms 10180 KB Output is correct
30 Correct 92 ms 10572 KB Output is correct
31 Correct 91 ms 9292 KB Output is correct
32 Correct 70 ms 9368 KB Output is correct
33 Correct 65 ms 10116 KB Output is correct
34 Correct 65 ms 10268 KB Output is correct
35 Correct 74 ms 8764 KB Output is correct
36 Correct 82 ms 10304 KB Output is correct
37 Correct 77 ms 11052 KB Output is correct
38 Correct 87 ms 10800 KB Output is correct
39 Correct 86 ms 10868 KB Output is correct
40 Correct 81 ms 10884 KB Output is correct
41 Correct 96 ms 10720 KB Output is correct
42 Correct 96 ms 10728 KB Output is correct
43 Correct 76 ms 10040 KB Output is correct
44 Correct 78 ms 10480 KB Output is correct
45 Correct 78 ms 10440 KB Output is correct
46 Correct 75 ms 11480 KB Output is correct
47 Correct 67 ms 10132 KB Output is correct
48 Correct 66 ms 10116 KB Output is correct
49 Correct 69 ms 9160 KB Output is correct
50 Correct 66 ms 9868 KB Output is correct
51 Correct 66 ms 10232 KB Output is correct
52 Correct 67 ms 10072 KB Output is correct