oj.uz

답안 #239110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239110 2020-06-14T12:24:29 Z aggu_01000101 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 662 ms 20004 KB 
#include <bits/stdc++.h>
#define int long long
#define INF 1000000000000000
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
#define mid(l, u) ((l+u)/2)
#define x(p) p.first
#define y(p) p.second
#define MOD 998244353

using namespace std;
const int N = 200005;
int n, q, s, t;
int a[N];
int seg[4*N];
int laz[4*N];
int build(int l, int u, int i){
    laz[i] = 0;
    if(l==u) return seg[i] = a[l];
    return seg[i] = min(build(l, mid(l, u), lchild(i)),build(mid(l, u) + 1, u, rchild(i)));
}
int query(int l, int u, int i, int uu){
    if(laz[i]!=0){
        seg[i]+=laz[i];
        if(l!=u){
            laz[lchild(i)]+=laz[i];
            laz[rchild(i)]+=laz[i];
        }
        laz[i] = 0;
    }
    if(l>=uu && u<=uu) return seg[i];
    if(l>uu || u<uu) return INF;
    return min(query(l, mid(l, u), lchild(i), uu), query(mid(l, u)+1, u, rchild(i), uu));
}
int update(int l, int u, int i, int ll, int uu, int x){
    if(laz[i]!=0){
        seg[i]+=laz[i];
        if(l!=u){
            laz[lchild(i)]+=laz[i];
            laz[rchild(i)]+=laz[i];
        }
        laz[i] = 0;
    }
    if(l>=ll && u<=uu){
        seg[i]+=x;
        if(l!=u){
            laz[lchild(i)]+=x;
            laz[rchild(i)]+=x;
        }
        return seg[i];
    }
    if(l>uu || u<ll) return seg[i];
    return seg[i] = min(update(l, mid(l, u), lchild(i), ll, uu, x), update(mid(l, u)+1, u, rchild(i), ll, uu, x));
}
int toadd(int a, int b){
    int tr = 0;
    if(b>=a){
        tr = (b-a)*(-s);
    }
    else{
        tr = (a-b)*t;
    }
    return tr;
}
int get(int i){
    return query(0, n, 0, i);
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>q>>s>>t;
    for(int i = 0;i<=n;i++) cin>>a[i];
    int curr = 0;
    for(int i = 0;i<n;i++){
        curr+=toadd(a[i], a[i+1]);
    }
    build(0, n, 0);
    while(q--){
        int l, r, x;
        cin>>l>>r>>x;
        if(l>0) curr-=(toadd(get(l-1), get(l)));
        if(r<n) curr-=(toadd(get(r), get(r+1)));
        update(0, n, 0, l, r, x);
        if(l>0) curr+=(toadd(get(l-1), get(l)));
        if(r<n) curr+=(toadd(get(r), get(r+1)));
        cout<<curr<<"\n";
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 642 ms 12400 KB Output is correct
2 Correct 662 ms 17656 KB Output is correct
3 Correct 655 ms 18172 KB Output is correct
4 Correct 649 ms 17568 KB Output is correct
5 Correct 639 ms 18936 KB Output is correct
6 Correct 265 ms 17784 KB Output is correct
7 Correct 250 ms 17656 KB Output is correct
8 Correct 516 ms 18624 KB Output is correct
9 Correct 513 ms 19024 KB Output is correct
10 Correct 490 ms 17660 KB Output is correct
11 Correct 420 ms 17784 KB Output is correct
12 Correct 274 ms 18452 KB Output is correct
13 Correct 265 ms 18552 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 512 KB Output is correct
2 Correct 8 ms 404 KB Output is correct
3 Correct 8 ms 512 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 8 ms 512 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 9 ms 512 KB Output is correct
9 Correct 8 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 8 ms 512 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 8 ms 512 KB Output is correct
16 Correct 8 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 9 ms 512 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 642 ms 12400 KB Output is correct
23 Correct 662 ms 17656 KB Output is correct
24 Correct 655 ms 18172 KB Output is correct
25 Correct 649 ms 17568 KB Output is correct
26 Correct 639 ms 18936 KB Output is correct
27 Correct 265 ms 17784 KB Output is correct
28 Correct 250 ms 17656 KB Output is correct
29 Correct 516 ms 18624 KB Output is correct
30 Correct 513 ms 19024 KB Output is correct
31 Correct 490 ms 17660 KB Output is correct
32 Correct 420 ms 17784 KB Output is correct
33 Correct 274 ms 18452 KB Output is correct
34 Correct 265 ms 18552 KB Output is correct
35 Correct 630 ms 17344 KB Output is correct
36 Correct 618 ms 18552 KB Output is correct
37 Correct 626 ms 19448 KB Output is correct
38 Correct 648 ms 19320 KB Output is correct
39 Correct 630 ms 19240 KB Output is correct
40 Correct 618 ms 19192 KB Output is correct
41 Correct 632 ms 18936 KB Output is correct
42 Correct 641 ms 19064 KB Output is correct
43 Correct 652 ms 18296 KB Output is correct
44 Correct 634 ms 18984 KB Output is correct
45 Correct 617 ms 18936 KB Output is correct
46 Correct 630 ms 20004 KB Output is correct
47 Correct 279 ms 18424 KB Output is correct
48 Correct 400 ms 18392 KB Output is correct
49 Correct 594 ms 17528 KB Output is correct
50 Correct 422 ms 18296 KB Output is correct
51 Correct 264 ms 18552 KB Output is correct
52 Correct 439 ms 18412 KB Output is correct