oj.uz

답안 #530693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
530693 2022-02-26T12:34:38 Z browntoad Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 109 ms 12328 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif

const ll inf = (1ll<<60);
const int iinf=2147483647;
const ll mod = 998244353;
const ll maxn=3005;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}

ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
int s,t;
int val(int x){
    if (x<0){
        return x*t;
    }
    else return x*s;
}
signed main(){
    IOS();
    int n,q; cin>>n>>q>>s>>t;
    vector<int> vc(n+1), cha(n+2);
    REP(i,n+1){
        cin>>vc[i];
    }
    int cans=0;
    REP1(i,n){
        cha[i]=vc[i]-vc[i-1];
        if (cha[i]<0){
            cans+=t*cha[i];
        }
        else cans+=s*cha[i];
    }
    REP(i,q){
        int l,r,x; cin>>l>>r>>x;
        int na=cha[l]+x, nb=cha[r+1]-x;
        cans-=val(cha[l]);
        cans+=val(na);
        cha[l]=na;
        if (r<n){
            cans-=val(cha[r+1]);
            cans+=val(nb);
            cha[r+1]=nb;
        }
        cout<<-cans<<endl;
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 9920 KB Output is correct
2 Correct 98 ms 10584 KB Output is correct
3 Correct 103 ms 11200 KB Output is correct
4 Correct 89 ms 10308 KB Output is correct
5 Correct 109 ms 11112 KB Output is correct
6 Correct 77 ms 11020 KB Output is correct
7 Correct 77 ms 10972 KB Output is correct
8 Correct 93 ms 11460 KB Output is correct
9 Correct 90 ms 11704 KB Output is correct
10 Correct 91 ms 10432 KB Output is correct
11 Correct 88 ms 10920 KB Output is correct
12 Correct 74 ms 11620 KB Output is correct
13 Correct 76 ms 11844 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 2 ms 316 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 100 ms 9920 KB Output is correct
23 Correct 98 ms 10584 KB Output is correct
24 Correct 103 ms 11200 KB Output is correct
25 Correct 89 ms 10308 KB Output is correct
26 Correct 109 ms 11112 KB Output is correct
27 Correct 77 ms 11020 KB Output is correct
28 Correct 77 ms 10972 KB Output is correct
29 Correct 93 ms 11460 KB Output is correct
30 Correct 90 ms 11704 KB Output is correct
31 Correct 91 ms 10432 KB Output is correct
32 Correct 88 ms 10920 KB Output is correct
33 Correct 74 ms 11620 KB Output is correct
34 Correct 76 ms 11844 KB Output is correct
35 Correct 93 ms 10092 KB Output is correct
36 Correct 99 ms 11496 KB Output is correct
37 Correct 91 ms 12328 KB Output is correct
38 Correct 93 ms 12092 KB Output is correct
39 Correct 89 ms 12160 KB Output is correct
40 Correct 106 ms 12020 KB Output is correct
41 Correct 92 ms 11864 KB Output is correct
42 Correct 94 ms 11972 KB Output is correct
43 Correct 98 ms 11188 KB Output is correct
44 Correct 104 ms 11580 KB Output is correct
45 Correct 95 ms 11388 KB Output is correct
46 Correct 99 ms 12128 KB Output is correct
47 Correct 77 ms 11612 KB Output is correct
48 Correct 76 ms 11588 KB Output is correct
49 Correct 77 ms 10716 KB Output is correct
50 Correct 74 ms 11440 KB Output is correct
51 Correct 81 ms 12108 KB Output is correct
52 Correct 74 ms 11580 KB Output is correct