oj.uz

답안 #568993

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
568993 2022-05-26T13:04:09 Z DJ035 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 316 ms 17296 KB 
#include <bits/stdc++.h>
#define MEM 200005
#define sanic ios_base::sync_with_stdio(0)
#define MOD 1000000
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll INF = 1e13+7;
ll t,n,m,x,y;
ll tree[4*MEM], a[MEM], c[MEM];
ll init(ll pos, ll val, ll idx, ll s, ll e){
    if(s>idx || idx>e) return tree[pos];
    if(s==e) return tree[pos] = val;
    ll mid = (s+e)/2;
    return tree[pos] = init(pos*2, val, idx, s, mid)+init(pos*2+1, val, idx, mid+1, e);
}
ll query(ll nd, ll l, ll r, ll s, ll e){
    if(l>e || s>r) return 0;
    if(l<=s && e<=r) return tree[nd];
    ll mid = (s+e)/2;
    return query(nd*2, l, r, s, mid)+query(nd*2+1, l, r, mid+1, e);
}
int main() {
    sanic; cin.tie(0); cout.tie(0);
    cin >> n >> m >> x >> y;
    for(int i=0; i<=n; i++){
        cin >> a[i];
        if(i) c[i] = a[i-1]-a[i];
    }
    for(int i=1; i<=n; i++)
        init(1, c[i]*(c[i]>0 ? y:x), i, 1, n);
    while(m--){
        ll q1,q2,q3;
        cin >> q1 >> q2 >> q3;
        c[q1] -= q3;
        c[q2+1] += q3;
        init(1, c[q1]*(c[q1]>0 ? y:x), q1, 1, n);
        init(1, c[q2+1]*(c[q2+1]>0 ? y:x), q2+1, 1, n);
        cout << query(1, 1, n, 1, n) <<'\n';
    }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 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 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 464 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 316 ms 14372 KB Output is correct
2 Correct 242 ms 15008 KB Output is correct
3 Correct 267 ms 15568 KB Output is correct
4 Correct 251 ms 14996 KB Output is correct
5 Correct 272 ms 16088 KB Output is correct
6 Correct 145 ms 15180 KB Output is correct
7 Correct 154 ms 15064 KB Output is correct
8 Correct 204 ms 15936 KB Output is correct
9 Correct 208 ms 16244 KB Output is correct
10 Correct 293 ms 14972 KB Output is correct
11 Correct 181 ms 15024 KB Output is correct
12 Correct 146 ms 15712 KB Output is correct
13 Correct 158 ms 16016 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 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 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 464 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 316 ms 14372 KB Output is correct
23 Correct 242 ms 15008 KB Output is correct
24 Correct 267 ms 15568 KB Output is correct
25 Correct 251 ms 14996 KB Output is correct
26 Correct 272 ms 16088 KB Output is correct
27 Correct 145 ms 15180 KB Output is correct
28 Correct 154 ms 15064 KB Output is correct
29 Correct 204 ms 15936 KB Output is correct
30 Correct 208 ms 16244 KB Output is correct
31 Correct 293 ms 14972 KB Output is correct
32 Correct 181 ms 15024 KB Output is correct
33 Correct 146 ms 15712 KB Output is correct
34 Correct 158 ms 16016 KB Output is correct
35 Correct 244 ms 14544 KB Output is correct
36 Correct 274 ms 16072 KB Output is correct
37 Correct 243 ms 16784 KB Output is correct
38 Correct 279 ms 16588 KB Output is correct
39 Correct 275 ms 16460 KB Output is correct
40 Correct 236 ms 16540 KB Output is correct
41 Correct 230 ms 16284 KB Output is correct
42 Correct 237 ms 16408 KB Output is correct
43 Correct 257 ms 15700 KB Output is correct
44 Correct 240 ms 16312 KB Output is correct
45 Correct 267 ms 16204 KB Output is correct
46 Correct 259 ms 17296 KB Output is correct
47 Correct 150 ms 15844 KB Output is correct
48 Correct 181 ms 15820 KB Output is correct
49 Correct 258 ms 14732 KB Output is correct
50 Correct 183 ms 15692 KB Output is correct
51 Correct 149 ms 16016 KB Output is correct
52 Correct 168 ms 15688 KB Output is correct