oj.uz

답안 #786875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786875 2023-07-18T14:07:58 Z winter0101 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 113 ms 13108 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
const int maxn=2e5+9;
long long a[maxn];
long long b[maxn];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    int n,q;
    long long s,t;
    cin>>n>>q>>s>>t;
    long long pos=0,neg=0;
    for1(i,0,n)cin>>a[i];
    for1(i,1,n){
    b[i]=a[i]-a[i-1];
    if (b[i]>=0)pos+=b[i];
    else neg+=abs(b[i]);
    }
    //cout<<pos<<" "<<neg<<'\n';
    for1(i,1,q){
    int l,r;
    long long x;
    cin>>l>>r>>x;
    if (b[l]>=0)pos-=b[l];
    else neg-=abs(b[l]);
    b[l]+=x;
    if (b[l]>=0)pos+=b[l];
    else neg+=abs(b[l]);
    if (r+1<=n){
    if (b[r+1]>=0)pos-=b[r+1];
    else neg-=abs(b[r+1]);
    b[r+1]-=x;
    if (b[r+1]>=0)pos+=b[r+1];
    else neg+=abs(b[r+1]);
    }
    cout<<-pos*s+neg*t<<'\n';
    //cout<<pos<<" "<<neg<<'\n';
    }


}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 392 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 324 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 10284 KB Output is correct
2 Correct 79 ms 10852 KB Output is correct
3 Correct 93 ms 11400 KB Output is correct
4 Correct 71 ms 10856 KB Output is correct
5 Correct 85 ms 11944 KB Output is correct
6 Correct 87 ms 11024 KB Output is correct
7 Correct 69 ms 10960 KB Output is correct
8 Correct 79 ms 11828 KB Output is correct
9 Correct 97 ms 12152 KB Output is correct
10 Correct 76 ms 10912 KB Output is correct
11 Correct 64 ms 10868 KB Output is correct
12 Correct 79 ms 11596 KB Output is correct
13 Correct 66 ms 11808 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 392 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 83 ms 10284 KB Output is correct
23 Correct 79 ms 10852 KB Output is correct
24 Correct 93 ms 11400 KB Output is correct
25 Correct 71 ms 10856 KB Output is correct
26 Correct 85 ms 11944 KB Output is correct
27 Correct 87 ms 11024 KB Output is correct
28 Correct 69 ms 10960 KB Output is correct
29 Correct 79 ms 11828 KB Output is correct
30 Correct 97 ms 12152 KB Output is correct
31 Correct 76 ms 10912 KB Output is correct
32 Correct 64 ms 10868 KB Output is correct
33 Correct 79 ms 11596 KB Output is correct
34 Correct 66 ms 11808 KB Output is correct
35 Correct 88 ms 10380 KB Output is correct
36 Correct 83 ms 11896 KB Output is correct
37 Correct 98 ms 12644 KB Output is correct
38 Correct 80 ms 12348 KB Output is correct
39 Correct 113 ms 12460 KB Output is correct
40 Correct 81 ms 12416 KB Output is correct
41 Correct 81 ms 12256 KB Output is correct
42 Correct 83 ms 12284 KB Output is correct
43 Correct 78 ms 11592 KB Output is correct
44 Correct 81 ms 12044 KB Output is correct
45 Correct 75 ms 12100 KB Output is correct
46 Correct 78 ms 13108 KB Output is correct
47 Correct 70 ms 11588 KB Output is correct
48 Correct 70 ms 11644 KB Output is correct
49 Correct 88 ms 10700 KB Output is correct
50 Correct 70 ms 11528 KB Output is correct
51 Correct 67 ms 11808 KB Output is correct
52 Correct 71 ms 11812 KB Output is correct