oj.uz

Submission #553978

# Submission time Handle Problem Language Result Execution time Memory
553978 2022-04-27T12:58:14 Z AA_Surely Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 197 ms 15796 KB 
#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int N = 2e5 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

#define lc now << 1
#define rc now << 1 | 1

LL n, q, s, t;
LL ns[N], tree[N << 2];

#define endl '\n'

LL build(int now = 1, int ls = 0, int rs = n - 1) {
    if (ls == rs) return tree[now] = ns[ls] * (ns[ls] < 0 ? -t : -s);
    int mid = (ls + rs) >> 1;
    return tree[now] = build(lc, ls, mid) + build(rc, mid + 1, rs);
}

void change(int id, int now = 1, int ls = 0, int rs = n - 1) {
    if (ls == rs) {
        tree[now] = ns[ls] * (ns[ls] < 0 ? -t : -s);
        return;
    }

    int mid = (ls + rs) >> 1;
    if (id <= mid) change(id, lc, ls, mid);
    else change(id, rc, mid + 1, rs);

    tree[now] = tree[lc] + tree[rc];

    return;
}

int main() {
    IOS;
        
    cin >> n >> q >> s >> t;

    F0R(i, n + 1) cin >> ns[i];
    F0R(i, n) ns[i] = ns[i + 1] - ns[i];

    build();

    LL lo, hi, v;
    while(q--) {
        cin >> lo >> hi >> v;
        lo--;

        ns[lo] += v;
        if (hi < n) ns[hi] -= v;

        change(lo);
        if (hi < n) change(hi);

        cout << tree[1] << endl;
    }

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 396 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 7336 KB Output is correct
2 Correct 167 ms 8176 KB Output is correct
3 Correct 158 ms 8528 KB Output is correct
4 Correct 170 ms 13416 KB Output is correct
5 Correct 168 ms 14472 KB Output is correct
6 Correct 99 ms 13512 KB Output is correct
7 Correct 99 ms 13568 KB Output is correct
8 Correct 148 ms 14332 KB Output is correct
9 Correct 153 ms 14676 KB Output is correct
10 Correct 153 ms 13420 KB Output is correct
11 Correct 110 ms 13412 KB Output is correct
12 Correct 98 ms 14272 KB Output is correct
13 Correct 103 ms 14496 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 396 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 169 ms 7336 KB Output is correct
23 Correct 167 ms 8176 KB Output is correct
24 Correct 158 ms 8528 KB Output is correct
25 Correct 170 ms 13416 KB Output is correct
26 Correct 168 ms 14472 KB Output is correct
27 Correct 99 ms 13512 KB Output is correct
28 Correct 99 ms 13568 KB Output is correct
29 Correct 148 ms 14332 KB Output is correct
30 Correct 153 ms 14676 KB Output is correct
31 Correct 153 ms 13420 KB Output is correct
32 Correct 110 ms 13412 KB Output is correct
33 Correct 98 ms 14272 KB Output is correct
34 Correct 103 ms 14496 KB Output is correct
35 Correct 165 ms 12896 KB Output is correct
36 Correct 174 ms 14324 KB Output is correct
37 Correct 176 ms 15164 KB Output is correct
38 Correct 184 ms 14968 KB Output is correct
39 Correct 179 ms 15068 KB Output is correct
40 Correct 165 ms 14940 KB Output is correct
41 Correct 171 ms 14848 KB Output is correct
42 Correct 170 ms 14924 KB Output is correct
43 Correct 175 ms 14208 KB Output is correct
44 Correct 171 ms 14508 KB Output is correct
45 Correct 171 ms 14540 KB Output is correct
46 Correct 197 ms 15796 KB Output is correct
47 Correct 99 ms 14148 KB Output is correct
48 Correct 112 ms 14184 KB Output is correct
49 Correct 168 ms 13156 KB Output is correct
50 Correct 115 ms 14084 KB Output is correct
51 Correct 97 ms 14412 KB Output is correct
52 Correct 113 ms 14232 KB Output is correct