oj.uz

Submission #200782

# Submission time Handle Problem Language Result Execution time Memory
200782 2020-02-08T06:45:52 Z balbit Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 157 ms 11128 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b){
    return b==1?1:(mod-mod/b) * inv(mod%b) % mod;
}

const int maxn = 2e5+5;

ll re = 0;
ll df[maxn];
ll n, q, s, t;
inline ll val(ll x){
    if (x>0)return -s*x;
    else return -t*x;
}

signed main(){
    IOS();
    cin>>n>>q>>s>>t;
    vector<int> a(n+1);
    REP(i,n+1){
        cin>>a[i];
        if (i) df[i-1] = a[i]-a[i-1], re += val(df[i-1]);
    }
    REP(i,q){
        int l, r; cin>>l>>r;
        ll k; cin>>k;
        --l;
        re -= val(df[l]);
        df[l]+=k;
        re += val(df[l]);
        if (r<n){
            re -= val(df[r]);
            df[r]-=k;
            re += val(df[r]);
        }

        cout<<re<<endl;
    }

    // Check your array bounds!
    // Think about corner cases (smallest or biggest?)
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 8824 KB Output is correct
2 Correct 145 ms 9444 KB Output is correct
3 Correct 143 ms 9976 KB Output is correct
4 Correct 139 ms 9184 KB Output is correct
5 Correct 141 ms 9848 KB Output is correct
6 Correct 116 ms 10232 KB Output is correct
7 Correct 118 ms 10232 KB Output is correct
8 Correct 142 ms 10232 KB Output is correct
9 Correct 155 ms 10616 KB Output is correct
10 Correct 138 ms 9336 KB Output is correct
11 Correct 124 ms 10232 KB Output is correct
12 Correct 115 ms 10744 KB Output is correct
13 Correct 116 ms 11128 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 7 ms 504 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 6 ms 372 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 6 ms 380 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 142 ms 8824 KB Output is correct
23 Correct 145 ms 9444 KB Output is correct
24 Correct 143 ms 9976 KB Output is correct
25 Correct 139 ms 9184 KB Output is correct
26 Correct 141 ms 9848 KB Output is correct
27 Correct 116 ms 10232 KB Output is correct
28 Correct 118 ms 10232 KB Output is correct
29 Correct 142 ms 10232 KB Output is correct
30 Correct 155 ms 10616 KB Output is correct
31 Correct 138 ms 9336 KB Output is correct
32 Correct 124 ms 10232 KB Output is correct
33 Correct 115 ms 10744 KB Output is correct
34 Correct 116 ms 11128 KB Output is correct
35 Correct 138 ms 8952 KB Output is correct
36 Correct 151 ms 10488 KB Output is correct
37 Correct 152 ms 11128 KB Output is correct
38 Correct 142 ms 11000 KB Output is correct
39 Correct 157 ms 10872 KB Output is correct
40 Correct 143 ms 10872 KB Output is correct
41 Correct 140 ms 10744 KB Output is correct
42 Correct 151 ms 10744 KB Output is correct
43 Correct 138 ms 9720 KB Output is correct
44 Correct 146 ms 9848 KB Output is correct
45 Correct 136 ms 9720 KB Output is correct
46 Correct 144 ms 10104 KB Output is correct
47 Correct 122 ms 9848 KB Output is correct
48 Correct 132 ms 10488 KB Output is correct
49 Correct 118 ms 9976 KB Output is correct
50 Correct 114 ms 10744 KB Output is correct
51 Correct 118 ms 11128 KB Output is correct
52 Correct 118 ms 10972 KB Output is correct