oj.uz

Submission #702188

# Submission time Handle Problem Language Result Execution time Memory
702188 2023-02-23T08:08:41 Z mychecksedad Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 108 ms 13144 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 1e6+100, M = 1e5+10, K = 20;


ll n, a[N], s, q, t, ans, b[N];
void solve(){
  cin >> n >> q >> t >> s;
  for(int i = 0; i <= n; ++i) cin >> a[i];
  ans = 0;
  a[0] = 0;
  for(int i = 1; i <= n; ++i){
    b[i] = a[i] - a[i - 1];
    if(b[i] >= 0)
      ans += t * b[i];
    else
      ans += s * b[i];
  }
  for(;q--;){
    int l, r; ll x;; cin >> l >> r >> x;
    if(b[l] >= 0)
      ans -= t * b[l];
    else
      ans -= s * b[l];
    if(r < n){
      if(b[r + 1] >= 0)
        ans -= t * b[r + 1];
      else
        ans -= s * b[r + 1];
    }

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

    if(b[l] >= 0)
      ans += t * b[l];
    else
      ans += s * b[l];
    if(r < n){
      if(b[r + 1] >= 0)
        ans += t * b[r + 1];
      else
        ans += s * b[r + 1];
    }
    cout << -ans << '\n';
  }
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int T = 1, aa;
  // cin >> T;aa=T;
  while(T--){
    // cout << "Case #" << aa-T << ": ";
    solve();
    cout << '\n';
  }
  return 0;
 
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:59:14: warning: unused variable 'aa' [-Wunused-variable]
   59 |   int T = 1, aa;
      |              ^~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 332 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 92 ms 10280 KB Output is correct
2 Correct 93 ms 10804 KB Output is correct
3 Correct 100 ms 11500 KB Output is correct
4 Correct 87 ms 10792 KB Output is correct
5 Correct 94 ms 11980 KB Output is correct
6 Correct 80 ms 10976 KB Output is correct
7 Correct 84 ms 10956 KB Output is correct
8 Correct 90 ms 11808 KB Output is correct
9 Correct 97 ms 12112 KB Output is correct
10 Correct 101 ms 10916 KB Output is correct
11 Correct 73 ms 10968 KB Output is correct
12 Correct 79 ms 11692 KB Output is correct
13 Correct 75 ms 11864 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 388 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 92 ms 10280 KB Output is correct
23 Correct 93 ms 10804 KB Output is correct
24 Correct 100 ms 11500 KB Output is correct
25 Correct 87 ms 10792 KB Output is correct
26 Correct 94 ms 11980 KB Output is correct
27 Correct 80 ms 10976 KB Output is correct
28 Correct 84 ms 10956 KB Output is correct
29 Correct 90 ms 11808 KB Output is correct
30 Correct 97 ms 12112 KB Output is correct
31 Correct 101 ms 10916 KB Output is correct
32 Correct 73 ms 10968 KB Output is correct
33 Correct 79 ms 11692 KB Output is correct
34 Correct 75 ms 11864 KB Output is correct
35 Correct 90 ms 10328 KB Output is correct
36 Correct 99 ms 11760 KB Output is correct
37 Correct 98 ms 12620 KB Output is correct
38 Correct 108 ms 12372 KB Output is correct
39 Correct 100 ms 12464 KB Output is correct
40 Correct 96 ms 12420 KB Output is correct
41 Correct 103 ms 12292 KB Output is correct
42 Correct 95 ms 12364 KB Output is correct
43 Correct 102 ms 11596 KB Output is correct
44 Correct 101 ms 11968 KB Output is correct
45 Correct 108 ms 12068 KB Output is correct
46 Correct 95 ms 13144 KB Output is correct
47 Correct 82 ms 11640 KB Output is correct
48 Correct 92 ms 11724 KB Output is correct
49 Correct 81 ms 10620 KB Output is correct
50 Correct 81 ms 11544 KB Output is correct
51 Correct 83 ms 11892 KB Output is correct
52 Correct 78 ms 11672 KB Output is correct