oj.uz

답안 #216325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
216325 2020-03-27T05:33:55 Z KoalaMuch Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 627 ms 26496 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
long long s,t;
struct A
{
    long long l,r;
    long long ans;
};
A sm[N*4];
long long lz[N*4];
void apply(long long now,long long l,long long r)
{
    if(!lz[now])    return ;
    sm[now].l+=lz[now];
    sm[now].r+=lz[now];
    if(l!=r)    lz[now<<1]+=lz[now],lz[now<<1|1]+=lz[now];
    lz[now] = 0;
}
A Merge(A a,A b)
{
    if(a.r<b.l) return {a.l,b.r,a.ans+b.ans-s*(b.l-a.r)};
    else        return {a.l,b.r,a.ans+b.ans+t*(a.r-b.l)};
}
void upd(long long l,long long r,long long ll,long long rr,long long now,long long v)
{
    apply(now,l,r);
    if(l>rr||r<ll)return ;
    if(l>=ll&&r<=rr)
    {
        lz[now]+=v;
        apply(now,l,r);
        return ;
    }
    long long mid = (l+r) >> 1;
    upd(l,mid,ll,rr,now<<1,v),upd(mid+1,r,ll,rr,now<<1|1,v);
    sm[now] = Merge(sm[now<<1],sm[now<<1|1]);
//    printf("%lld %lld %lld %lld %lld\n",l,r,sm[now].l,sm[now].r,sm[now].ans);
}
int main()
{
    long long n,q,l,r,x;
    scanf("%lld %lld %lld %lld",&n,&q,&s,&t);
    for(long long i=0;i<=n;i++)   scanf("%lld",&x),upd(0,n,i,i,1,x);
//    printf("%lld\n",sm[1].ans);
    while(q--)
    {
        scanf("%lld %lld %lld",&l,&r,&x);
        upd(0,n,l,r,1,x);
        printf("%lld\n",sm[1].ans);
    }
    return 0;
}
/*
3 5 1 2
0 4 1 8
1 2 2
1 1 -2
2 3 5
1 2 -1
1 3 5
*/

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld %lld %lld",&n,&q,&s,&t);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:44:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(long long i=0;i<=n;i++)   scanf("%lld",&x),upd(0,n,i,i,1,x);
                                   ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld %lld",&l,&r,&x);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 512 KB Output is correct
2 Correct 8 ms 512 KB Output is correct
3 Correct 9 ms 512 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 10 ms 512 KB Output is correct
6 Correct 10 ms 512 KB Output is correct
7 Correct 9 ms 512 KB Output is correct
8 Correct 10 ms 488 KB Output is correct
9 Correct 11 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 8 ms 512 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 9 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 360 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 534 ms 18288 KB Output is correct
2 Correct 600 ms 18824 KB Output is correct
3 Correct 609 ms 19472 KB Output is correct
4 Correct 527 ms 24324 KB Output is correct
5 Correct 509 ms 25396 KB Output is correct
6 Correct 315 ms 23420 KB Output is correct
7 Correct 323 ms 23312 KB Output is correct
8 Correct 575 ms 25184 KB Output is correct
9 Correct 494 ms 25464 KB Output is correct
10 Correct 507 ms 24224 KB Output is correct
11 Correct 327 ms 23200 KB Output is correct
12 Correct 357 ms 23948 KB Output is correct
13 Correct 262 ms 24160 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 512 KB Output is correct
2 Correct 8 ms 512 KB Output is correct
3 Correct 9 ms 512 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 10 ms 512 KB Output is correct
6 Correct 10 ms 512 KB Output is correct
7 Correct 9 ms 512 KB Output is correct
8 Correct 10 ms 488 KB Output is correct
9 Correct 11 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 8 ms 512 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 9 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 360 KB Output is correct
22 Correct 534 ms 18288 KB Output is correct
23 Correct 600 ms 18824 KB Output is correct
24 Correct 609 ms 19472 KB Output is correct
25 Correct 527 ms 24324 KB Output is correct
26 Correct 509 ms 25396 KB Output is correct
27 Correct 315 ms 23420 KB Output is correct
28 Correct 323 ms 23312 KB Output is correct
29 Correct 575 ms 25184 KB Output is correct
30 Correct 494 ms 25464 KB Output is correct
31 Correct 507 ms 24224 KB Output is correct
32 Correct 327 ms 23200 KB Output is correct
33 Correct 357 ms 23948 KB Output is correct
34 Correct 262 ms 24160 KB Output is correct
35 Correct 613 ms 23736 KB Output is correct
36 Correct 565 ms 25208 KB Output is correct
37 Correct 577 ms 25948 KB Output is correct
38 Correct 572 ms 25852 KB Output is correct
39 Correct 627 ms 25836 KB Output is correct
40 Correct 617 ms 25808 KB Output is correct
41 Correct 596 ms 25524 KB Output is correct
42 Correct 556 ms 25800 KB Output is correct
43 Correct 588 ms 25044 KB Output is correct
44 Correct 576 ms 25352 KB Output is correct
45 Correct 573 ms 25444 KB Output is correct
46 Correct 566 ms 26496 KB Output is correct
47 Correct 318 ms 24032 KB Output is correct
48 Correct 335 ms 23932 KB Output is correct
49 Correct 559 ms 24184 KB Output is correct
50 Correct 302 ms 23800 KB Output is correct
51 Correct 290 ms 24296 KB Output is correct
52 Correct 342 ms 24040 KB Output is correct