oj.uz

답안 #407207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
407207 2021-05-18T15:55:03 Z FEDIKUS Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 131 ms 11524 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,ll) sort(a.begin(),a.end(),greater<ll>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define up(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define vstart auto startt=chrono::system_clock::now()
#define vend auto endd=chrono::system_clock::now()
#define vvreme chrono::duration<double> vremee=endd-startt
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pii;
typedef pair<ll,ll> pll;
typedef string str;

const ll maxn=2e5+10;

ll niz[maxn];

ll sta(ll a,ll s,ll t){
    if(a>0) return a*s;
    return a*t;
}

void solve(){
    ll n,q,s,t;
    cin>>n>>q>>s>>t;
    ll prosli=0;
    cin>>prosli;
    ll res=0;
    for(ll i=1;i<=n;i++){
        ll a;
        cin>>a;
        niz[i]=a-prosli;
        res-=sta(niz[i],s,t);
        prosli=a;
    }
    //cout<<res<<"\n";
    while(q--){
        ll l,r,x;
        cin>>l>>r>>x;
        res+=sta(niz[l],s,t);
        if(r<n) res+=sta(niz[r+1],s,t);
        niz[l]+=x;
        if(r<n) niz[r+1]-=x;
        res-=sta(niz[l],s,t);
        if(r<n) res-=sta(niz[r+1],s,t);
        cout<<res<<"\n";
    }
}

int main(){
    ios;
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 8644 KB Output is correct
2 Correct 120 ms 9236 KB Output is correct
3 Correct 122 ms 9908 KB Output is correct
4 Correct 120 ms 9320 KB Output is correct
5 Correct 131 ms 10436 KB Output is correct
6 Correct 108 ms 9508 KB Output is correct
7 Correct 105 ms 9412 KB Output is correct
8 Correct 122 ms 10352 KB Output is correct
9 Correct 124 ms 10564 KB Output is correct
10 Correct 120 ms 9236 KB Output is correct
11 Correct 107 ms 9284 KB Output is correct
12 Correct 105 ms 10104 KB Output is correct
13 Correct 103 ms 10252 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 328 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 328 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 119 ms 8644 KB Output is correct
23 Correct 120 ms 9236 KB Output is correct
24 Correct 122 ms 9908 KB Output is correct
25 Correct 120 ms 9320 KB Output is correct
26 Correct 131 ms 10436 KB Output is correct
27 Correct 108 ms 9508 KB Output is correct
28 Correct 105 ms 9412 KB Output is correct
29 Correct 122 ms 10352 KB Output is correct
30 Correct 124 ms 10564 KB Output is correct
31 Correct 120 ms 9236 KB Output is correct
32 Correct 107 ms 9284 KB Output is correct
33 Correct 105 ms 10104 KB Output is correct
34 Correct 103 ms 10252 KB Output is correct
35 Correct 116 ms 8772 KB Output is correct
36 Correct 122 ms 10184 KB Output is correct
37 Correct 130 ms 11140 KB Output is correct
38 Correct 123 ms 10832 KB Output is correct
39 Correct 124 ms 10820 KB Output is correct
40 Correct 126 ms 10792 KB Output is correct
41 Correct 123 ms 10668 KB Output is correct
42 Correct 128 ms 10768 KB Output is correct
43 Correct 121 ms 10016 KB Output is correct
44 Correct 122 ms 10416 KB Output is correct
45 Correct 129 ms 10608 KB Output is correct
46 Correct 125 ms 11524 KB Output is correct
47 Correct 106 ms 10052 KB Output is correct
48 Correct 108 ms 10052 KB Output is correct
49 Correct 112 ms 9116 KB Output is correct
50 Correct 107 ms 9952 KB Output is correct
51 Correct 109 ms 10296 KB Output is correct
52 Correct 103 ms 10020 KB Output is correct