oj.uz

답안 #237673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
237673 2020-06-08T09:17:00 Z zaneyu Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 721 ms 24312 KB 
/*input
7 8 8 13
0
4
-9
4
-2
3
10
-9
1 4 8
3 5 -2
3 3 9
1 7 4
3 5 -1
5 6 3
4 4 9
6 7 -10
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long 
#define ld long double
#define pii pair<double,double>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e12;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1){
            res=(res*a)%MOD;
        }
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
#define int ll
int arr[maxn];
struct node{
    ll mx,lazy=0;

}seg[4*maxn];
node pull(node a,node b){
    node x;
    x.mx=max(a.mx,b.mx);
    return x;
}
void pushdown(int idx,int l,int r){
    if(!seg[idx].lazy) return;
    seg[idx].mx+=seg[idx].lazy;
    if(l==r){
        seg[idx].lazy=0;
        return;
    }
    seg[idx*2].lazy+=seg[idx].lazy;
    seg[idx*2+1].lazy+=seg[idx].lazy;
    seg[idx].lazy=0;
}
void build(int idx,int l,int r){
    if(l==r){
        seg[idx].mx=arr[l];
        return;
    }
    int mid=(l+r)/2;
    build(idx*2,l,mid);
    build(idx*2+1,mid+1,r);
    seg[idx]=pull(seg[idx*2],seg[idx*2+1]);    
}
void upd(int idx,int l,int r,int ql,int qr,int x){
    pushdown(idx,l,r);
    if(r<ql or l>qr) return;
    if(ql<=l and r<=qr){
        seg[idx].lazy+=x;
        pushdown(idx,l,r);
        return;
    }
    int mid=(l+r)/2;
    upd(idx*2,l,mid,ql,qr,x);
    upd(idx*2+1,mid+1,r,ql,qr,x);
    seg[idx]=pull(seg[idx*2],seg[idx*2+1]);
}
ll query(int idx,int l,int r,int ql,int qr){
    if(r<ql or l>qr) return -INF64;
    pushdown(idx,l,r);
    if(ql<=l and r<=qr){
        return seg[idx].mx;
    }
    int mid=(l+r)/2;
    return max(query(idx*2,l,mid,ql,qr),query(idx*2+1,mid+1,r,ql,qr));
}
int n;
ll get(int i){
    return query(1,0,n-1,i,i);
}
ll ssum=0,tsum=0;
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int q,s,t;
    cin>>n>>q>>s>>t;
    ++n;
    REP(i,n){
        cin>>arr[i];
        if(i){
            if(arr[i]>arr[i-1]) ssum+=(arr[i]-arr[i-1]);
            else tsum+=(arr[i-1]-arr[i]);
        }
    }
    build(1,0,n-1);
    REP(i,q){
        int l,r,x;
        cin>>l>>r>>x;
        int tl=get(l),tl1=get(l-1);
        if(tl>tl1) ssum-=(tl-tl1);
        else tsum-=(tl1-tl);
        if(r!=(n-1)){
            tl1=get(r),tl=get(r+1);
            if(tl>tl1) ssum-=(tl-tl1);
            else tsum-=(tl1-tl);            
        }
        upd(1,0,n-1,l,r,x);
        tl=get(l),tl1=get(l-1);
        if(tl>tl1) ssum+=(tl-tl1);
        else tsum+=(tl1-tl);
        if(r!=(n-1)){
            tl1=get(r),tl=get(r+1);
            if(tl>tl1) ssum+=(tl-tl1);
            else tsum+=(tl1-tl);            
        }
        //cout<<tsum<<' '<<ssum<<' ';
        cout<<tsum*t-ssum*s<<'\n';
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 701 ms 21484 KB Output is correct
2 Correct 692 ms 21984 KB Output is correct
3 Correct 721 ms 22588 KB Output is correct
4 Correct 666 ms 22052 KB Output is correct
5 Correct 695 ms 23276 KB Output is correct
6 Correct 297 ms 22008 KB Output is correct
7 Correct 296 ms 22136 KB Output is correct
8 Correct 557 ms 22904 KB Output is correct
9 Correct 545 ms 23160 KB Output is correct
10 Correct 535 ms 22028 KB Output is correct
11 Correct 464 ms 22008 KB Output is correct
12 Correct 310 ms 22776 KB Output is correct
13 Correct 303 ms 22904 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 12928 KB Output is correct
2 Correct 15 ms 12928 KB Output is correct
3 Correct 15 ms 12928 KB Output is correct
4 Correct 15 ms 12928 KB Output is correct
5 Correct 15 ms 13056 KB Output is correct
6 Correct 15 ms 12928 KB Output is correct
7 Correct 21 ms 12928 KB Output is correct
8 Correct 15 ms 13056 KB Output is correct
9 Correct 15 ms 13056 KB Output is correct
10 Correct 15 ms 13056 KB Output is correct
11 Correct 15 ms 12928 KB Output is correct
12 Correct 15 ms 13056 KB Output is correct
13 Correct 13 ms 13056 KB Output is correct
14 Correct 14 ms 12928 KB Output is correct
15 Correct 14 ms 12928 KB Output is correct
16 Correct 14 ms 13056 KB Output is correct
17 Correct 13 ms 12928 KB Output is correct
18 Correct 14 ms 13056 KB Output is correct
19 Correct 10 ms 12928 KB Output is correct
20 Correct 10 ms 12800 KB Output is correct
21 Correct 10 ms 12800 KB Output is correct
22 Correct 701 ms 21484 KB Output is correct
23 Correct 692 ms 21984 KB Output is correct
24 Correct 721 ms 22588 KB Output is correct
25 Correct 666 ms 22052 KB Output is correct
26 Correct 695 ms 23276 KB Output is correct
27 Correct 297 ms 22008 KB Output is correct
28 Correct 296 ms 22136 KB Output is correct
29 Correct 557 ms 22904 KB Output is correct
30 Correct 545 ms 23160 KB Output is correct
31 Correct 535 ms 22028 KB Output is correct
32 Correct 464 ms 22008 KB Output is correct
33 Correct 310 ms 22776 KB Output is correct
34 Correct 303 ms 22904 KB Output is correct
35 Correct 686 ms 21624 KB Output is correct
36 Correct 710 ms 23156 KB Output is correct
37 Correct 705 ms 23672 KB Output is correct
38 Correct 683 ms 23416 KB Output is correct
39 Correct 688 ms 23544 KB Output is correct
40 Correct 687 ms 23544 KB Output is correct
41 Correct 704 ms 23288 KB Output is correct
42 Correct 698 ms 23544 KB Output is correct
43 Correct 684 ms 22776 KB Output is correct
44 Correct 703 ms 23208 KB Output is correct
45 Correct 661 ms 23160 KB Output is correct
46 Correct 686 ms 24312 KB Output is correct
47 Correct 310 ms 22648 KB Output is correct
48 Correct 445 ms 22652 KB Output is correct
49 Correct 666 ms 22108 KB Output is correct
50 Correct 469 ms 22656 KB Output is correct
51 Correct 292 ms 22904 KB Output is correct
52 Correct 463 ms 22776 KB Output is correct