oj.uz

답안 #761016

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761016 2023-06-19T04:03:46 Z Cookie Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 97 ms 13100 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("VNOICUP.INP");
ofstream fout("VNOICUP.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(ll i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
#define ull unsigned long long
using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 7;
const int mxn = 2e5 + 5, mxq = 2e5 + 5, sq = 400, mxv = 15 * 10, pr = 31;
const int base = (1 << 18);
const ll inf = 2e9, neg = -69420, add = 1e9;
ll n, q, s, t;
ll a[mxn + 1], dif[mxn + 1];
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> q >> s >> t;
    ll ans = 0;
    for(int i = 0; i <= n; i++){
        cin >> a[i];
        if(i){
            dif[i] = a[i] - a[i - 1]; ans += ((dif[i] > 0) ? -s * dif[i] : t * -dif[i]);
        }
    }
   
    for(int i = 0; i < q; i++){
        ll l, r, x; cin >> l >> r >> x;
        ans -= ((dif[l] > 0) ? -s * dif[l] : t * -dif[l]);; dif[l] += x; 
        ans += ((dif[l] > 0) ? -s * dif[l] : t * -dif[l]);;
        if(r != n){
            ans -= ((dif[r + 1] > 0) ? -s * dif[r + 1] : t * -dif[r + 1]);; dif[r + 1] -= x; 
             ans += ((dif[r + 1] > 0) ? -s * dif[r + 1] : t * -dif[r + 1]);;
        }
        cout << ans << "\n";
    }
  
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 392 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 356 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 468 KB Output is correct
7 Correct 1 ms 404 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 348 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 352 KB Output is correct
17 Correct 1 ms 408 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 10296 KB Output is correct
2 Correct 89 ms 10828 KB Output is correct
3 Correct 79 ms 11452 KB Output is correct
4 Correct 79 ms 11060 KB Output is correct
5 Correct 75 ms 12044 KB Output is correct
6 Correct 67 ms 11064 KB Output is correct
7 Correct 75 ms 10956 KB Output is correct
8 Correct 78 ms 11752 KB Output is correct
9 Correct 82 ms 12152 KB Output is correct
10 Correct 76 ms 10808 KB Output is correct
11 Correct 67 ms 10956 KB Output is correct
12 Correct 67 ms 11716 KB Output is correct
13 Correct 64 ms 11916 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 392 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 356 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 468 KB Output is correct
7 Correct 1 ms 404 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 348 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 352 KB Output is correct
17 Correct 1 ms 408 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 75 ms 10296 KB Output is correct
23 Correct 89 ms 10828 KB Output is correct
24 Correct 79 ms 11452 KB Output is correct
25 Correct 79 ms 11060 KB Output is correct
26 Correct 75 ms 12044 KB Output is correct
27 Correct 67 ms 11064 KB Output is correct
28 Correct 75 ms 10956 KB Output is correct
29 Correct 78 ms 11752 KB Output is correct
30 Correct 82 ms 12152 KB Output is correct
31 Correct 76 ms 10808 KB Output is correct
32 Correct 67 ms 10956 KB Output is correct
33 Correct 67 ms 11716 KB Output is correct
34 Correct 64 ms 11916 KB Output is correct
35 Correct 83 ms 10376 KB Output is correct
36 Correct 78 ms 11792 KB Output is correct
37 Correct 78 ms 12632 KB Output is correct
38 Correct 79 ms 12376 KB Output is correct
39 Correct 83 ms 12468 KB Output is correct
40 Correct 78 ms 12476 KB Output is correct
41 Correct 80 ms 12244 KB Output is correct
42 Correct 97 ms 12296 KB Output is correct
43 Correct 77 ms 11668 KB Output is correct
44 Correct 81 ms 11964 KB Output is correct
45 Correct 77 ms 12124 KB Output is correct
46 Correct 84 ms 13100 KB Output is correct
47 Correct 67 ms 11688 KB Output is correct
48 Correct 70 ms 11620 KB Output is correct
49 Correct 68 ms 10644 KB Output is correct
50 Correct 64 ms 11456 KB Output is correct
51 Correct 69 ms 11848 KB Output is correct
52 Correct 69 ms 11640 KB Output is correct