oj.uz

Submission #118084

# Submission time Handle Problem Language Result Execution time Memory
118084 2019-06-18T06:59:34 Z JohnTitor Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 213 ms 13096 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
#define __builtin_popcount __builtin_popcountll
using ll=long long; using ld=long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi=acos(0)*2;
template <typename T> inline void read(T &x){char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){nega=1; c=getchar();} x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10); putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){ putchar('-'); x=-x;} writep(x);}
template <typename T> inline void writeln(T x){write(x); putchar('\n');}
#define taskname "Foehn"
int n, q;
ll s, t;
ll a[200001];
ll d[200001];
int main(){
    #ifdef Aria
        if(fopen(taskname".in", "r"))
            freopen(taskname".in", "r", stdin);
    #endif // Aria
    read(n);
    read(q);
    read(s);
    read(t);
    FOR(i, 0, n) read(a[i]);
    FOR(i, 1, n) d[i]=a[i]-a[i-1];
    ll ans=0;
    FOR(i, 1, n) if(d[i]>0) ans-=d[i]*s; else ans-=d[i]*t;
    {
        int l, r;
        ll x;
        FOR(i, 1, q){
            read(l);
            read(r);
            read(x);
            if(d[l]>0) ans+=d[l]*s; else ans+=d[l]*t;
            d[l]+=x;
            if(d[l]>0) ans-=d[l]*s; else ans-=d[l]*t;
            r++;
            if(r<=n){
                if(d[r]>0) ans+=d[r]*s; else ans+=d[r]*t;
                d[r]-=x;
                if(d[r]>0) ans-=d[r]*s; else ans-=d[r]*t;
            }
            writeln(ans);
        }
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 10300 KB Output is correct
2 Correct 108 ms 10904 KB Output is correct
3 Correct 115 ms 11384 KB Output is correct
4 Correct 103 ms 10872 KB Output is correct
5 Correct 107 ms 12136 KB Output is correct
6 Correct 85 ms 11032 KB Output is correct
7 Correct 89 ms 11000 KB Output is correct
8 Correct 117 ms 11824 KB Output is correct
9 Correct 111 ms 12152 KB Output is correct
10 Correct 99 ms 10872 KB Output is correct
11 Correct 82 ms 10872 KB Output is correct
12 Correct 94 ms 11656 KB Output is correct
13 Correct 95 ms 11768 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 102 ms 10300 KB Output is correct
23 Correct 108 ms 10904 KB Output is correct
24 Correct 115 ms 11384 KB Output is correct
25 Correct 103 ms 10872 KB Output is correct
26 Correct 107 ms 12136 KB Output is correct
27 Correct 85 ms 11032 KB Output is correct
28 Correct 89 ms 11000 KB Output is correct
29 Correct 117 ms 11824 KB Output is correct
30 Correct 111 ms 12152 KB Output is correct
31 Correct 99 ms 10872 KB Output is correct
32 Correct 82 ms 10872 KB Output is correct
33 Correct 94 ms 11656 KB Output is correct
34 Correct 95 ms 11768 KB Output is correct
35 Correct 93 ms 10364 KB Output is correct
36 Correct 111 ms 11828 KB Output is correct
37 Correct 129 ms 12536 KB Output is correct
38 Correct 131 ms 12536 KB Output is correct
39 Correct 114 ms 12408 KB Output is correct
40 Correct 130 ms 12356 KB Output is correct
41 Correct 129 ms 12280 KB Output is correct
42 Correct 213 ms 12336 KB Output is correct
43 Correct 116 ms 11640 KB Output is correct
44 Correct 120 ms 12024 KB Output is correct
45 Correct 108 ms 12024 KB Output is correct
46 Correct 122 ms 13096 KB Output is correct
47 Correct 93 ms 11640 KB Output is correct
48 Correct 93 ms 11640 KB Output is correct
49 Correct 102 ms 10872 KB Output is correct
50 Correct 89 ms 11384 KB Output is correct
51 Correct 91 ms 11768 KB Output is correct
52 Correct 90 ms 11640 KB Output is correct