oj.uz

답안 #783661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
783661 2023-07-15T07:51:46 Z devariaota Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 103 ms 7216 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define endl "\n"
#define pii pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define pque priority_queue
#define pqueg priority_queue<ll,vector<ll>,greater<ll>>
#define que queue<ll>
#define FOR(m,i,n) for(int i=(m); i<=(n); i++)
#define FORM(m,i,n) for(int i=(m); i>=(n); i--)
ll n,q,s,t,ans,l,r,x;
ll a[200200],diff[200200];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> q >> s >> t;
  FOR(0,i,n) {
    cin >> a[i];
  }
  FOR(1,i,n) {
    diff[i] = a[i] - a[i-1];
    if(diff[i] > 0) {
      ans -= diff[i] * s;
    }
    else {
      ans += abs(diff[i]) * t;
    }
  }
  while(q--) {
    cin >> l >> r >> x;
    if(diff[l] > 0) {
      ans += diff[l] * s;
    }
    else {
      ans -= abs(diff[l]) * t;
    }
    diff[l] += x;
    if(diff[l] > 0) {
      ans -= diff[l] * s;
    }
    else {
      ans += abs(diff[l]) * t;
    }
    if(r != n) {
      if(diff[r+1] > 0) {
        ans += diff[r+1] * s;
      }
      else {
        ans -= abs(diff[r+1]) * t;
      }
      diff[r+1] -= x;
      if(diff[r+1] > 0) {
        ans -= diff[r+1] * s;
      }
      else {
        ans += abs(diff[r+1]) * t;
      }
    }
    cout << ans << endl;
  }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 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 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 1 ms 340 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 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 4884 KB Output is correct
2 Correct 90 ms 5452 KB Output is correct
3 Correct 75 ms 6032 KB Output is correct
4 Correct 73 ms 5160 KB Output is correct
5 Correct 75 ms 6000 KB Output is correct
6 Correct 65 ms 6344 KB Output is correct
7 Correct 68 ms 6376 KB Output is correct
8 Correct 76 ms 6336 KB Output is correct
9 Correct 82 ms 6644 KB Output is correct
10 Correct 80 ms 5364 KB Output is correct
11 Correct 63 ms 6420 KB Output is correct
12 Correct 64 ms 6836 KB Output is correct
13 Correct 63 ms 7128 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 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 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 1 ms 340 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 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 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 71 ms 4884 KB Output is correct
23 Correct 90 ms 5452 KB Output is correct
24 Correct 75 ms 6032 KB Output is correct
25 Correct 73 ms 5160 KB Output is correct
26 Correct 75 ms 6000 KB Output is correct
27 Correct 65 ms 6344 KB Output is correct
28 Correct 68 ms 6376 KB Output is correct
29 Correct 76 ms 6336 KB Output is correct
30 Correct 82 ms 6644 KB Output is correct
31 Correct 80 ms 5364 KB Output is correct
32 Correct 63 ms 6420 KB Output is correct
33 Correct 64 ms 6836 KB Output is correct
34 Correct 63 ms 7128 KB Output is correct
35 Correct 85 ms 5016 KB Output is correct
36 Correct 75 ms 6436 KB Output is correct
37 Correct 78 ms 7144 KB Output is correct
38 Correct 93 ms 6956 KB Output is correct
39 Correct 89 ms 6988 KB Output is correct
40 Correct 77 ms 7024 KB Output is correct
41 Correct 103 ms 6804 KB Output is correct
42 Correct 80 ms 6936 KB Output is correct
43 Correct 77 ms 6136 KB Output is correct
44 Correct 92 ms 6624 KB Output is correct
45 Correct 73 ms 6400 KB Output is correct
46 Correct 75 ms 7100 KB Output is correct
47 Correct 66 ms 6944 KB Output is correct
48 Correct 70 ms 7216 KB Output is correct
49 Correct 65 ms 6212 KB Output is correct
50 Correct 79 ms 6920 KB Output is correct
51 Correct 69 ms 7080 KB Output is correct
52 Correct 63 ms 6988 KB Output is correct