oj.uz

Submission #259052

# Submission time Handle Problem Language Result Execution time Memory
259052 2020-08-07T05:28:09 Z Fidisk Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 149 ms 13296 KB 
#include <bits/stdc++.h>
using namespace std;

#define oo 1e9
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) ((xxxx>>(aaaa-1))&1)
#define _cos(xxxx) cos(xxxx*acos(-1)/180)
#define _sin(xxxx) sin(xxxx*acos(-1)/180)
#define _tan(xxxx) tan(xxxx*acos(-1)/180)
#define PE cout<<fixed

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
typedef pair<long long,long long> pll;
typedef pair<pair<long long,long long>,long long> plll;

const ld pi=acos(-1);

ll n,q,s,t,i,a[500009],b[500009],res,l,r,x,tmp1,tmp2;

int main(){
    IO;
    cin>>n>>q>>s>>t;
    for (i=0;i<=n;i++) {
        cin>>a[i];
    }
    for (i=1;i<=n;i++) {
        b[i]=a[i]-a[i-1];
    }
    for (i=1;i<=n;i++) {
        res+=(b[i]>0)?(-b[i]*s):(-b[i]*t);
    }
    //cout<<res<<'\n';
    for (i=1;i<=q;i++) {
        cin>>l>>r>>x;
        tmp1=b[l]+x;
        tmp2=b[r+1]-x;
        res+=(b[l]>0)?(b[l]*s):(b[l]*t);
        res+=(tmp1>0)?(-tmp1*s):(-tmp1*t);
        if (r!=n) {
            res+=(b[r+1]>0)?(b[r+1]*s):(b[r+1]*t);
            res+=(tmp2>0)?(-tmp2*s):(-tmp2*t);
        }
        b[l]=tmp1;
        b[r+1]=tmp2;
        cout<<res<<'\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 10352 KB Output is correct
2 Correct 123 ms 11000 KB Output is correct
3 Correct 118 ms 11516 KB Output is correct
4 Correct 111 ms 11000 KB Output is correct
5 Correct 117 ms 12152 KB Output is correct
6 Correct 105 ms 11128 KB Output is correct
7 Correct 105 ms 11128 KB Output is correct
8 Correct 119 ms 11896 KB Output is correct
9 Correct 119 ms 12280 KB Output is correct
10 Correct 114 ms 11000 KB Output is correct
11 Correct 99 ms 11004 KB Output is correct
12 Correct 112 ms 11744 KB Output is correct
13 Correct 102 ms 11896 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 133 ms 10352 KB Output is correct
23 Correct 123 ms 11000 KB Output is correct
24 Correct 118 ms 11516 KB Output is correct
25 Correct 111 ms 11000 KB Output is correct
26 Correct 117 ms 12152 KB Output is correct
27 Correct 105 ms 11128 KB Output is correct
28 Correct 105 ms 11128 KB Output is correct
29 Correct 119 ms 11896 KB Output is correct
30 Correct 119 ms 12280 KB Output is correct
31 Correct 114 ms 11000 KB Output is correct
32 Correct 99 ms 11004 KB Output is correct
33 Correct 112 ms 11744 KB Output is correct
34 Correct 102 ms 11896 KB Output is correct
35 Correct 132 ms 10468 KB Output is correct
36 Correct 119 ms 11896 KB Output is correct
37 Correct 137 ms 12664 KB Output is correct
38 Correct 129 ms 12536 KB Output is correct
39 Correct 126 ms 12536 KB Output is correct
40 Correct 130 ms 12664 KB Output is correct
41 Correct 131 ms 12280 KB Output is correct
42 Correct 134 ms 12536 KB Output is correct
43 Correct 118 ms 11768 KB Output is correct
44 Correct 149 ms 12196 KB Output is correct
45 Correct 118 ms 12152 KB Output is correct
46 Correct 136 ms 13296 KB Output is correct
47 Correct 106 ms 11768 KB Output is correct
48 Correct 110 ms 11768 KB Output is correct
49 Correct 108 ms 10744 KB Output is correct
50 Correct 101 ms 11640 KB Output is correct
51 Correct 109 ms 12024 KB Output is correct
52 Correct 107 ms 11896 KB Output is correct