oj.uz

답안 #879521

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879521 2023-11-27T15:21:46 Z Shayan86 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 94 ms 13160 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv

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

#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 2e5 + 50;
const ll Mod = 1e9 + 7;

ll n, q, S, T, arr[N], delta[N], res;

void upd(int i, int x){
    if(delta[i] >= 0) res += delta[i] * S;
    else res += delta[i] * T;
    delta[i] += x;
    if(delta[i] >= 0) res -= delta[i] * S;
    else res -= delta[i] * T;
}

int main(){
    fast_io;

    cin >> n >> q >> S >> T;

    for(int i = 0; i <= n; i++){
        cin >> arr[i];
        if(i) delta[i] = arr[i] - arr[i-1];
    }

    for(int i = 1; i <= n; i++){
        if(delta[i] >= 0) res -= delta[i] * S;
        else res -= delta[i] * T;
    }

    while(q--){
        int l, r, x;
        cin >> l >> r >> x;

        upd(l, x); 
        if(r < n) upd(r+1, -x);

        cout << res << endl;
    }

}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2584 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2528 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2392 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2580 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 10276 KB Output is correct
2 Correct 73 ms 10832 KB Output is correct
3 Correct 78 ms 11468 KB Output is correct
4 Correct 67 ms 10900 KB Output is correct
5 Correct 69 ms 12112 KB Output is correct
6 Correct 61 ms 11092 KB Output is correct
7 Correct 61 ms 10984 KB Output is correct
8 Correct 75 ms 11888 KB Output is correct
9 Correct 94 ms 12116 KB Output is correct
10 Correct 71 ms 11016 KB Output is correct
11 Correct 59 ms 11084 KB Output is correct
12 Correct 61 ms 11604 KB Output is correct
13 Correct 61 ms 11856 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2584 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2528 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2392 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2580 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 70 ms 10276 KB Output is correct
23 Correct 73 ms 10832 KB Output is correct
24 Correct 78 ms 11468 KB Output is correct
25 Correct 67 ms 10900 KB Output is correct
26 Correct 69 ms 12112 KB Output is correct
27 Correct 61 ms 11092 KB Output is correct
28 Correct 61 ms 10984 KB Output is correct
29 Correct 75 ms 11888 KB Output is correct
30 Correct 94 ms 12116 KB Output is correct
31 Correct 71 ms 11016 KB Output is correct
32 Correct 59 ms 11084 KB Output is correct
33 Correct 61 ms 11604 KB Output is correct
34 Correct 61 ms 11856 KB Output is correct
35 Correct 70 ms 10580 KB Output is correct
36 Correct 91 ms 11860 KB Output is correct
37 Correct 74 ms 12624 KB Output is correct
38 Correct 77 ms 12788 KB Output is correct
39 Correct 91 ms 12368 KB Output is correct
40 Correct 77 ms 12396 KB Output is correct
41 Correct 74 ms 12368 KB Output is correct
42 Correct 77 ms 12320 KB Output is correct
43 Correct 73 ms 11764 KB Output is correct
44 Correct 76 ms 12116 KB Output is correct
45 Correct 68 ms 12148 KB Output is correct
46 Correct 81 ms 13160 KB Output is correct
47 Correct 68 ms 11624 KB Output is correct
48 Correct 64 ms 11856 KB Output is correct
49 Correct 61 ms 10832 KB Output is correct
50 Correct 66 ms 11580 KB Output is correct
51 Correct 63 ms 11812 KB Output is correct
52 Correct 73 ms 11792 KB Output is correct