oj.uz

Submission #199198

# Submission time Handle Problem Language Result Execution time Memory
199198 2020-01-30T03:33:22 Z xiaowuc1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 198 ms 11768 KB 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef vector<int> vi;
// END NO SAD

typedef long long ll;
typedef pair<int, int> pii;

const int RAGETREE_SZ = 1 << 18;
ll bit[RAGETREE_SZ];
void upd(int idx, ll val) {
  idx += 2;
  while(idx < RAGETREE_SZ) {
    bit[idx] += val;
    idx += idx & -idx;
  }
}
ll qry(int idx) {
  idx += 2;
  ll ret = 0;
  while(idx) {
    ret += bit[idx];
    idx -= idx & -idx;
  }
  return ret;
}

void solve() {
  int n, q;
  ll s, t;
  ll pos = 0;
  ll neg = 0;
  cin >> n >> q >> s >> t;
  {
    ll last = 0;
    for(int i = 0; i <= n; i++) {
      ll curr;
      cin >> curr;
      upd(i, curr - last);
      last = curr;
    }
  }
  for(int i = 1; i <= n; i++) {
    ll delta = qry(i) - qry(i-1);
    if(delta > 0) pos += delta;
    else neg -= delta;
  }
  while(q--) {
    int lhs, rhs, k;
    cin >> lhs >> rhs >> k;
    ll delta;
    delta = qry(lhs) - qry(lhs-1);
    if(delta > 0) pos -= delta;
    else neg += delta;
    if(rhs < n) {
      delta = qry(rhs+1) - qry(rhs);
      if(delta > 0) pos -= delta;
      else neg += delta;
    }
    upd(lhs, k);
    upd(rhs+1, -k);
    delta = qry(lhs) - qry(lhs-1);
    if(delta > 0) pos += delta;
    else neg -= delta;
    if(rhs < n) {
      delta = qry(rhs+1) - qry(rhs);
      if(delta > 0) pos += delta;
      else neg -= delta;
    }
    cout << t*neg - s*pos << "\n";
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  solve();
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 8772 KB Output is correct
2 Correct 188 ms 9464 KB Output is correct
3 Correct 176 ms 9976 KB Output is correct
4 Correct 170 ms 9336 KB Output is correct
5 Correct 181 ms 10488 KB Output is correct
6 Correct 141 ms 9592 KB Output is correct
7 Correct 141 ms 9592 KB Output is correct
8 Correct 175 ms 10360 KB Output is correct
9 Correct 182 ms 10616 KB Output is correct
10 Correct 172 ms 9464 KB Output is correct
11 Correct 144 ms 9464 KB Output is correct
12 Correct 150 ms 10360 KB Output is correct
13 Correct 138 ms 10364 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 7 ms 504 KB Output is correct
4 Correct 7 ms 504 KB Output is correct
5 Correct 7 ms 504 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 7 ms 504 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 7 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 8 ms 504 KB Output is correct
13 Correct 6 ms 504 KB Output is correct
14 Correct 7 ms 504 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 7 ms 504 KB Output is correct
17 Correct 6 ms 504 KB Output is correct
18 Correct 6 ms 504 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 181 ms 8772 KB Output is correct
23 Correct 188 ms 9464 KB Output is correct
24 Correct 176 ms 9976 KB Output is correct
25 Correct 170 ms 9336 KB Output is correct
26 Correct 181 ms 10488 KB Output is correct
27 Correct 141 ms 9592 KB Output is correct
28 Correct 141 ms 9592 KB Output is correct
29 Correct 175 ms 10360 KB Output is correct
30 Correct 182 ms 10616 KB Output is correct
31 Correct 172 ms 9464 KB Output is correct
32 Correct 144 ms 9464 KB Output is correct
33 Correct 150 ms 10360 KB Output is correct
34 Correct 138 ms 10364 KB Output is correct
35 Correct 181 ms 9032 KB Output is correct
36 Correct 180 ms 10360 KB Output is correct
37 Correct 185 ms 11256 KB Output is correct
38 Correct 184 ms 11000 KB Output is correct
39 Correct 182 ms 11000 KB Output is correct
40 Correct 184 ms 11000 KB Output is correct
41 Correct 185 ms 10744 KB Output is correct
42 Correct 186 ms 11004 KB Output is correct
43 Correct 181 ms 10232 KB Output is correct
44 Correct 179 ms 10616 KB Output is correct
45 Correct 175 ms 10616 KB Output is correct
46 Correct 198 ms 11768 KB Output is correct
47 Correct 147 ms 10232 KB Output is correct
48 Correct 142 ms 10236 KB Output is correct
49 Correct 166 ms 9208 KB Output is correct
50 Correct 139 ms 9976 KB Output is correct
51 Correct 146 ms 10360 KB Output is correct
52 Correct 144 ms 10216 KB Output is correct