oj.uz

Submission #988802

# Submission time Handle Problem Language Result Execution time Memory
988802 2024-05-26T09:07:28 Z lo0ker Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 105 ms 13136 KB 
/*
	* AUTHOR : lo0ker
	* Problem : Foehn Phenomena
	* source : https://oj.uz/problem/view/JOI17_foehn_phenomena
*/

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int MOD = 1e9+7;

struct FenwickTree{
  vector<ll> val;
  int n;

  FenwickTree(int n){
    val.resize(n);
    this->n = n;
  }

  void update(int idx, int delta){
    for(; idx < n; idx |= (idx+1)){
      val[idx] += delta;
    }
  }

  ll query(int idx){
    ll ret = 0;
    for(; idx >= 0; idx = (idx&(idx+1))-1){
      ret += val[idx];
    }
    return ret;
  }
};

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

	int n, q;
  ll s, t;
  cin >> n >> q >> s >> t;

  vector<ll> a(n+1);
  for(auto &it : a) cin >> it;

  ll ans = 0;

  

  for(int i = 0; i < n; i++){
    if(a[i] < a[i+1]){
      ans -= s*(a[i+1] - a[i]);
    }
    else{
      ans += t*(a[i] - a[i+1]);
    }
  }

  FenwickTree ftree(n+1);

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

    ll prev = 0;
    ll al1 = a[l-1] + ftree.query(l-1);
    ll al2 = a[l] + ftree.query(l);
    ll temp = al1 - al2;
    prev += (temp < 0) ? s*(temp) : t*(temp);
    if(r < n){
      ll ar1 = a[r] + ftree.query(r);
      ll ar2 = a[r+1] + ftree.query(r+1);
      temp = ar1 - ar2;
      prev += (temp < 0) ? s*(temp) : t*(temp);
    }
    
    ans -= prev;
    ftree.update(l, x);
    ftree.update(r+1, -x);

    al1 = a[l-1] + ftree.query(l-1);
    al2 = a[l] + ftree.query(l);
    temp = al1 - al2;
    ans += (temp < 0) ? s*(temp) : t*(temp);
    if(r < n){
      ll ar1 = a[r] + ftree.query(r);
      ll ar2 = a[r+1] + ftree.query(r+1);
      temp = ar1 - ar2;
      ans += (temp < 0) ? s*(temp) : t*(temp);
    }
    cout << ans << "\n";
    /*for(int i = 0; i <= n; i++){
      cout << a[i] + ftree.query(i) << " ";
    }
    cout << "\n";*/
  }
	return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 10280 KB Output is correct
2 Correct 105 ms 10836 KB Output is correct
3 Correct 90 ms 11580 KB Output is correct
4 Correct 94 ms 11052 KB Output is correct
5 Correct 91 ms 12116 KB Output is correct
6 Correct 73 ms 11092 KB Output is correct
7 Correct 61 ms 10972 KB Output is correct
8 Correct 86 ms 11860 KB Output is correct
9 Correct 88 ms 12116 KB Output is correct
10 Correct 84 ms 10832 KB Output is correct
11 Correct 63 ms 10956 KB Output is correct
12 Correct 61 ms 11816 KB Output is correct
13 Correct 60 ms 11888 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 552 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 544 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 452 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 90 ms 10280 KB Output is correct
23 Correct 105 ms 10836 KB Output is correct
24 Correct 90 ms 11580 KB Output is correct
25 Correct 94 ms 11052 KB Output is correct
26 Correct 91 ms 12116 KB Output is correct
27 Correct 73 ms 11092 KB Output is correct
28 Correct 61 ms 10972 KB Output is correct
29 Correct 86 ms 11860 KB Output is correct
30 Correct 88 ms 12116 KB Output is correct
31 Correct 84 ms 10832 KB Output is correct
32 Correct 63 ms 10956 KB Output is correct
33 Correct 61 ms 11816 KB Output is correct
34 Correct 60 ms 11888 KB Output is correct
35 Correct 89 ms 10572 KB Output is correct
36 Correct 94 ms 11856 KB Output is correct
37 Correct 94 ms 12628 KB Output is correct
38 Correct 100 ms 12372 KB Output is correct
39 Correct 95 ms 12368 KB Output is correct
40 Correct 98 ms 12372 KB Output is correct
41 Correct 95 ms 12372 KB Output is correct
42 Correct 94 ms 12380 KB Output is correct
43 Correct 91 ms 11560 KB Output is correct
44 Correct 100 ms 12116 KB Output is correct
45 Correct 88 ms 12120 KB Output is correct
46 Correct 93 ms 13136 KB Output is correct
47 Correct 64 ms 11604 KB Output is correct
48 Correct 67 ms 11604 KB Output is correct
49 Correct 82 ms 10672 KB Output is correct
50 Correct 68 ms 11604 KB Output is correct
51 Correct 60 ms 11856 KB Output is correct
52 Correct 73 ms 11604 KB Output is correct