oj.uz

답안 #267323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
267323 2020-08-16T03:37:15 Z leductoan Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 496 ms 13944 KB 
#include<bits/stdc++.h>
using namespace std;
#define task "Phenomena"
#define lb lower_bound
#define ub upper_bound
#define alll(v) (v).begin(),(v).end()
#define szz(v) (v).size()
#define fi first
#define se second
#define pb push_back
#define FOR(i,a,b) for (ll i = (a), _b = (b); i <= _b; ++i)
#define FORD(i,b,a) for (ll i = (b), _a = (a); i >= _a; --i)
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pii;

const ll MOD=1000000007; /// 998244353
const ll base=311; /// for hash actually
const ll N=2e5+5;

ll st[4*N],lazy[4*N],n,q,s,t,a[N];
void down(ll i, ll l, ll r)
{
    ll t=lazy[i];
    st[i<<1]+=t;
    st[i<<1|1]+=t;
    lazy[i<<1]+=t;
    lazy[i<<1|1]+=t;
    lazy[i]=0;
}
void upd(ll i, ll l, ll r, ll u, ll v, ll val)
{
    if(u>r||v<l) return;
    if(u<=l&&r<=v)
    {
        lazy[i]+=val;
        st[i]+=val;
        return;
    }
    down(i,l,r);
    ll mid=(l+r)>>1;
    upd(i<<1,l,mid,u,v,val);
    upd(i<<1|1,mid+1,r,u,v,val);
}
ll get(ll i, ll l, ll r, ll p)
{
    if(l==r) return st[i];
    down(i,l,r);
    ll mid=(l+r)>>1;
    if(p<=mid) return get(i<<1,l,mid,p);
    else return get(i<<1|1,mid+1,r,p);
}
void solved()
{
    cin>>n>>q>>s>>t;
    s=-s;
    ll ans=0;
    ++n;
    FOR(i,1,n)
    {
        cin>>a[i];
        upd(1,1,n,i,i,a[i]);
    }
    FOR(i,1,n-1)
    {
        if(a[i]<a[i+1]) ans+=s*(a[i+1]-a[i]);
        else ans+=t*(a[i]-a[i+1]);
    }
    while(q--)
    {
        ll l,r,x;
        cin>>l>>r>>x;
        ++l,++r;
        ll p1=get(1,1,n,l-1), p2=get(1,1,n,l);
        if(l>1&&p1<p2) ans-=s*(p2-p1);
        else ans-=t*(p1-p2);
//        cout<<s*(p2-p1)<<endl;s
        p1=get(1,1,n,r), p2=get(1,1,n,r+1);
        if(r<n&&p1<p2) ans-=s*(p2-p1);
        else ans-=t*(p1-p2);
//        cout<<ans<<endl;
        upd(1,1,n,l,r,x);
        p1=get(1,1,n,l-1), p2=get(1,1,n,l);
        if(l>1&&p1<p2) ans+=s*(p2-p1);
        else ans+=t*(p1-p2);
        p1=get(1,1,n,r), p2=get(1,1,n,r+1);
        if(r<n&&p1<p2) ans+=s*(p2-p1);
        else ans+=t*(p1-p2);
        cout<<ans<<'\n';
        /*FOR(i,1,n) cout<<get(1,1,n,i)<<' ';
        cout<<endl;*/
    }
}
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if(fopen(task".inp","r"))
    {
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    solved();
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:99:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   99 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:100:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  100 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 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 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 468 ms 11516 KB Output is correct
2 Correct 455 ms 12280 KB Output is correct
3 Correct 455 ms 12920 KB Output is correct
4 Correct 446 ms 11896 KB Output is correct
5 Correct 456 ms 12920 KB Output is correct
6 Correct 363 ms 13180 KB Output is correct
7 Correct 363 ms 13048 KB Output is correct
8 Correct 437 ms 13176 KB Output is correct
9 Correct 427 ms 13304 KB Output is correct
10 Correct 424 ms 12128 KB Output is correct
11 Correct 304 ms 13212 KB Output is correct
12 Correct 346 ms 13556 KB Output is correct
13 Correct 384 ms 13944 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 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 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 468 ms 11516 KB Output is correct
23 Correct 455 ms 12280 KB Output is correct
24 Correct 455 ms 12920 KB Output is correct
25 Correct 446 ms 11896 KB Output is correct
26 Correct 456 ms 12920 KB Output is correct
27 Correct 363 ms 13180 KB Output is correct
28 Correct 363 ms 13048 KB Output is correct
29 Correct 437 ms 13176 KB Output is correct
30 Correct 427 ms 13304 KB Output is correct
31 Correct 424 ms 12128 KB Output is correct
32 Correct 304 ms 13212 KB Output is correct
33 Correct 346 ms 13556 KB Output is correct
34 Correct 384 ms 13944 KB Output is correct
35 Correct 493 ms 11684 KB Output is correct
36 Correct 472 ms 13176 KB Output is correct
37 Correct 475 ms 13944 KB Output is correct
38 Correct 468 ms 13688 KB Output is correct
39 Correct 464 ms 13688 KB Output is correct
40 Correct 484 ms 13688 KB Output is correct
41 Correct 468 ms 13560 KB Output is correct
42 Correct 456 ms 13836 KB Output is correct
43 Correct 461 ms 12920 KB Output is correct
44 Correct 456 ms 13304 KB Output is correct
45 Correct 491 ms 13304 KB Output is correct
46 Correct 496 ms 13816 KB Output is correct
47 Correct 397 ms 13688 KB Output is correct
48 Correct 261 ms 13924 KB Output is correct
49 Correct 441 ms 13432 KB Output is correct
50 Correct 287 ms 13688 KB Output is correct
51 Correct 346 ms 13852 KB Output is correct
52 Correct 378 ms 13688 KB Output is correct