oj.uz

Submission #605842

# Submission time Handle Problem Language Result Execution time Memory
605842 2022-07-26T03:27:22 Z jjiangly Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 159 ms 13140 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()
#define siz(x) int(x.size())
#define ll long long
#define ar array
#define vt vector
#define inf INT_MAX
#define lnf LLONG_MAX

const int nxm = int(2e5) + 7;
ll n, q, s, t, a[nxm];

namespace sub1 {
  ll l, r, x;
  void exe() {
    while (q--) {
      cin >> l >> r >> x;
      for (int i = l; i <= r; ++i) {
        a[i] += x;
      }
      ll ans = 0;
      for (int i = 1; i <= n; ++i) {
        if (a[i] > a[i - 1]) {
          ans -= (a[i] - a[i - 1]) * s;
        } else {
          ans += (a[i - 1] - a[i]) * t;
        }
      }
      cout << ans << "\n";
    }
  }
};

namespace sub2 {
  ll l, r, x;
  ll bit[nxm];
  void add(int x, ll v) {
    for (int i = x + 1; i <= nxm; i += i & -i) {
      bit[i - 1] += v;
    }
  }
  ll sum(int x) {
    ll r = 0;
    for (int i = x; i > 0; i -= i & -i) {
      r += bit[i - 1];
    }
    return r;
  }
  void exe() {
    ll Sum = 0;
    for (int i = 1; i <= n; ++i) {
      Sum += (a[i] - a[i - 1]);
    }
    while (q--) {
      cin >> l >> r >> x;
      Sum -= a[l] + sum(l + 1) - a[l - 1] - sum(l);
      if (r + 1 <= n) {
        Sum -= a[r + 1] + sum(r + 2) - a[r] - sum(r + 1);
      }
      add(l, x);
      add(r + 1, -x);
      Sum += a[l] + sum(l + 1) - a[l - 1] - sum(l);
      if (r + 1 <= n) {
        Sum += a[r + 1] + sum(r + 2) - a[r] - sum(r + 1);
      }
      cout << Sum * (-t) << "\n";
    }
  }
};

namespace sub3 {
  ll l, r, x;
  ll bit[nxm];
  void add(int x, ll v) {
    for (int i = x + 1; i <= nxm; i += i & -i) {
      bit[i - 1] += v;
    }
  }
  ll sum(int x) {
    ll r = 0;
    for (int i = x; i > 0; i -= i & -i) {
      r += bit[i - 1];
    }
    return r;
  }
  void exe() {
    ll ans = 0;
    for (int i = 1; i <= n; ++i) {
       if (a[i] > a[i - 1]) {
         ans -= (a[i] - a[i - 1]) * s;
       } else {
         ans += (a[i - 1] - a[i]) * t;
       }
    }
    //cout << ans << "\n";
    while (q--) {
      cin >> l >> r >> x;
      ll rhs = a[l] + sum(l + 1);
      ll lhs = a[l - 1] + sum(l);
      if (rhs > lhs) {
        ans += (rhs - lhs) * s;
      } else {
        ans -= (lhs - rhs) * t;
      }
      if (r + 1 <= n) {
        rhs = a[r + 1] + sum(r + 2);
        lhs = a[r] + sum(r + 1);
        if (rhs > lhs) {
          ans += (rhs - lhs) * s;
        } else {
          ans -= (lhs - rhs) * t;
        }
      }
      add(l, x);
      add(r + 1, -x);
      rhs = a[l] + sum(l + 1);
      lhs = a[l - 1] + sum(l);
      if (rhs > lhs) {
        ans -= (rhs - lhs) * s;
      } else {
        ans += (lhs - rhs) * t;
      }
      if (r + 1 <= n) {
        rhs = a[r + 1] + sum(r + 2);
        lhs = a[r] + sum(r + 1);
        if (rhs > lhs) {
          ans -= (rhs - lhs) * s;
        } else {
          ans += (lhs - rhs) * t;
        }
      }
      cout << ans << "\n";
    }
  }
};

int subtask() {
  if (n <= 2000 && q <= 2000) {
    return 1;
  } else if (s == t) {
    return 2;
  }
  return 3;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> q >> s >> t;
  for (int i = 0; i <= n; ++i) {
    cin >> a[i];
  }
  if (subtask() == 1) {
    sub1::exe();
  } else if (subtask() == 2) {
    sub2::exe();
  } else {
    sub3::exe();
  }

  return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 6 ms 372 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 6 ms 360 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 7 ms 340 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 7 ms 356 KB Output is correct
13 Correct 7 ms 340 KB Output is correct
14 Correct 6 ms 388 KB Output is correct
15 Correct 7 ms 372 KB Output is correct
16 Correct 5 ms 468 KB Output is correct
17 Correct 6 ms 340 KB Output is correct
18 Correct 6 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 118 ms 4828 KB Output is correct
2 Correct 143 ms 5476 KB Output is correct
3 Correct 117 ms 6056 KB Output is correct
4 Correct 120 ms 5220 KB Output is correct
5 Correct 137 ms 5968 KB Output is correct
6 Correct 80 ms 4900 KB Output is correct
7 Correct 79 ms 4840 KB Output is correct
8 Correct 109 ms 6284 KB Output is correct
9 Correct 110 ms 6676 KB Output is correct
10 Correct 105 ms 5352 KB Output is correct
11 Correct 90 ms 4836 KB Output is correct
12 Correct 79 ms 5196 KB Output is correct
13 Correct 83 ms 5708 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 468 KB Output is correct
2 Correct 6 ms 372 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 6 ms 360 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 7 ms 340 KB Output is correct
8 Correct 7 ms 340 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 7 ms 356 KB Output is correct
13 Correct 7 ms 340 KB Output is correct
14 Correct 6 ms 388 KB Output is correct
15 Correct 7 ms 372 KB Output is correct
16 Correct 5 ms 468 KB Output is correct
17 Correct 6 ms 340 KB Output is correct
18 Correct 6 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 118 ms 4828 KB Output is correct
23 Correct 143 ms 5476 KB Output is correct
24 Correct 117 ms 6056 KB Output is correct
25 Correct 120 ms 5220 KB Output is correct
26 Correct 137 ms 5968 KB Output is correct
27 Correct 80 ms 4900 KB Output is correct
28 Correct 79 ms 4840 KB Output is correct
29 Correct 109 ms 6284 KB Output is correct
30 Correct 110 ms 6676 KB Output is correct
31 Correct 105 ms 5352 KB Output is correct
32 Correct 90 ms 4836 KB Output is correct
33 Correct 79 ms 5196 KB Output is correct
34 Correct 83 ms 5708 KB Output is correct
35 Correct 120 ms 4960 KB Output is correct
36 Correct 129 ms 6392 KB Output is correct
37 Correct 127 ms 12776 KB Output is correct
38 Correct 132 ms 12512 KB Output is correct
39 Correct 127 ms 12460 KB Output is correct
40 Correct 124 ms 12364 KB Output is correct
41 Correct 140 ms 12180 KB Output is correct
42 Correct 130 ms 12352 KB Output is correct
43 Correct 127 ms 11700 KB Output is correct
44 Correct 124 ms 11980 KB Output is correct
45 Correct 159 ms 12100 KB Output is correct
46 Correct 119 ms 13140 KB Output is correct
47 Correct 82 ms 10168 KB Output is correct
48 Correct 103 ms 10176 KB Output is correct
49 Correct 118 ms 10676 KB Output is correct
50 Correct 91 ms 10020 KB Output is correct
51 Correct 95 ms 10328 KB Output is correct
52 Correct 83 ms 10104 KB Output is correct