oj.uz

답안 #886771

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
886771 2023-12-12T22:26:01 Z Maite_Morale Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 99 ms 15828 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define MAX 500005
#define oo 1e18
#define mod 1000000007
#define fast_in ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
using namespace std;
typedef long long ll;
#define pll pair<ll , ll>
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pll>
 
ll t,n,a[MAX],s,q,k,p,f;
int main(){
    fast_in
    cin>>n>>q>>s>>t;vpll v;ll r=0;
    for(int i=0;i<=n;i++){
        cin>>a[i];
        if(i!=0){
            v.push_back({a[i-1],a[i]});
            if(a[i]-a[i-1]>0)r+=(a[i]-a[i-1])*-s;
            else             r+=(a[i]-a[i-1])*-t;
        }
    }
    for(int i=0;i<q;i++){
        cin>>p>>f>>k;
        if(p>0){
            if(v[p-1].S-v[p-1].F>0)r-=(v[p-1].S-v[p-1].F)*-s;
            else                   r-=(v[p-1].S-v[p-1].F)*-t;
            v[p-1].S+=k;
            if(v[p-1].S-v[p-1].F>0)r+=(v[p-1].S-v[p-1].F)*-s;
            else                   r+=(v[p-1].S-v[p-1].F)*-t;
        }
        if(f<n){
            if(v[f].S-v[f].F>0)r-=(v[f].S-v[f].F)*-s;
            else               r-=(v[f].S-v[f].F)*-t;
            v[f].F+=k;
            if(v[f].S-v[f].F>0)r+=(v[f].S-v[f].F)*-s;
            else               r+=(v[f].S-v[f].F)*-t;
        }
        cout<<r<<"\n";
    }

    
return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 12736 KB Output is correct
2 Correct 85 ms 13412 KB Output is correct
3 Correct 76 ms 14384 KB Output is correct
4 Correct 73 ms 14100 KB Output is correct
5 Correct 74 ms 14520 KB Output is correct
6 Correct 65 ms 13504 KB Output is correct
7 Correct 66 ms 13504 KB Output is correct
8 Correct 79 ms 14272 KB Output is correct
9 Correct 77 ms 14524 KB Output is correct
10 Correct 74 ms 13412 KB Output is correct
11 Correct 63 ms 14012 KB Output is correct
12 Correct 65 ms 14016 KB Output is correct
13 Correct 70 ms 14540 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 480 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 488 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 86 ms 12736 KB Output is correct
23 Correct 85 ms 13412 KB Output is correct
24 Correct 76 ms 14384 KB Output is correct
25 Correct 73 ms 14100 KB Output is correct
26 Correct 74 ms 14520 KB Output is correct
27 Correct 65 ms 13504 KB Output is correct
28 Correct 66 ms 13504 KB Output is correct
29 Correct 79 ms 14272 KB Output is correct
30 Correct 77 ms 14524 KB Output is correct
31 Correct 74 ms 13412 KB Output is correct
32 Correct 63 ms 14012 KB Output is correct
33 Correct 65 ms 14016 KB Output is correct
34 Correct 70 ms 14540 KB Output is correct
35 Correct 78 ms 12824 KB Output is correct
36 Correct 80 ms 14204 KB Output is correct
37 Correct 81 ms 15828 KB Output is correct
38 Correct 99 ms 14748 KB Output is correct
39 Correct 80 ms 14784 KB Output is correct
40 Correct 77 ms 14960 KB Output is correct
41 Correct 79 ms 14844 KB Output is correct
42 Correct 78 ms 14828 KB Output is correct
43 Correct 82 ms 14156 KB Output is correct
44 Correct 78 ms 15040 KB Output is correct
45 Correct 93 ms 14528 KB Output is correct
46 Correct 75 ms 15432 KB Output is correct
47 Correct 69 ms 14888 KB Output is correct
48 Correct 68 ms 14196 KB Output is correct
49 Correct 68 ms 13752 KB Output is correct
50 Correct 63 ms 14528 KB Output is correct
51 Correct 73 ms 14272 KB Output is correct
52 Correct 66 ms 14560 KB Output is correct