oj.uz

Submission #540375

# Submission time Handle Problem Language Result Execution time Memory
540375 2022-03-20T07:59:55 Z krit3379 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 353 ms 31032 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 400005

struct A{
    long long l,r,up,dow;
};

A t[4*N];
long long a[N],lazy[N],s,tt,ll,rr,val;

void push(int x){
    if(lazy[x]){
        lazy[x*2]+=lazy[x];
        lazy[x*2+1]+=lazy[x];
        t[x*2].l+=lazy[x];
        t[x*2].r+=lazy[x];
        t[x*2+1].l+=lazy[x];
        t[x*2+1].r+=lazy[x];
        lazy[x]=0;
    }
}

void cre(int x,int l,int r){
    if(l==r){t[x].l=t[x].r=a[l];return ;}
    int mid=(l+r)/2;
    cre(x*2,l,mid);
    cre(x*2+1,mid+1,r);
    t[x].l=t[x*2].l;
    t[x].r=t[x*2+1].r;
    t[x].up=t[x*2].up+t[x*2+1].up;
    t[x].dow=t[x*2].dow+t[x*2+1].dow;
    if(t[x*2].r<t[x*2+1].l)t[x].up+=t[x*2+1].l-t[x*2].r;
    else t[x].dow+=t[x*2].r-t[x*2+1].l;
}

void upd(int x,int l,int r){
    if(l>rr||ll>r)return ;
    if(ll<=l&&r<=rr){
        t[x].l+=val;
        t[x].r+=val;
        lazy[x]+=val;
        return ;
    }
    push(x);
    int mid=(l+r)/2;
    upd(x*2,l,mid);
    upd(x*2+1,mid+1,r);
    t[x].l=t[x*2].l;
    t[x].r=t[x*2+1].r;
    t[x].up=t[x*2].up+t[x*2+1].up;
    t[x].dow=t[x*2].dow+t[x*2+1].dow;
    if(t[x*2].r<t[x*2+1].l)t[x].up+=t[x*2+1].l-t[x*2].r;
    else t[x].dow+=t[x*2].r-t[x*2+1].l;
}

A sol(int x,int l,int r){
    if(l>rr||ll>r)return {(long long)1e18};
    if(ll<=l&&r<=rr)return t[x];
    push(x);
    int mid=(l+r)/2;
    A tl=sol(x*2,l,mid),tr=sol(x*2+1,mid+1,r),tx;
    if(tl.l==1e18)return tr;
    else if(tr.l==1e18)return tl;
    tx.l=tl.l;
    tx.r=tr.r;
    tx.up=tl.up+tr.up;
    tx.dow=tl.dow+tr.dow;
    if(tl.r<tr.l)tx.up+=tr.l-tl.r;
    else tr.dow+=tl.r-tr.l;
}

int main(){
    int n,q,i;
    scanf("%d %d %lld %lld",&n,&q,&s,&tt);
    n++;
    for(i=1;i<=n;i++)scanf("%lld",&a[i]);
    cre(1,1,n);
    while(q--){
        scanf("%d %d %lld",&ll,&rr,&val);
        ll++,rr++;
        upd(1,1,n);
        //A ans=sol(1,1,n);
        A ans=t[1];
        printf("%lld\n",-ans.up*s+ans.dow*tt);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:80:17: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
   80 |         scanf("%d %d %lld",&ll,&rr,&val);
      |                ~^          ~~~
      |                 |          |
      |                 int*       long long int*
      |                %lld
foehn_phenomena.cpp:80:20: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long int*' [-Wformat=]
   80 |         scanf("%d %d %lld",&ll,&rr,&val);
      |                   ~^           ~~~
      |                    |           |
      |                    int*        long long int*
      |                   %lld
foehn_phenomena.cpp: In function 'A sol(int, int, int)':
foehn_phenomena.cpp:71:1: warning: control reaches end of non-void function [-Wreturn-type]
   71 | }
      | ^
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:75:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     scanf("%d %d %lld %lld",&n,&q,&s,&tt);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:77:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     for(i=1;i<=n;i++)scanf("%lld",&a[i]);
      |                      ~~~~~^~~~~~~~~~~~~~
foehn_phenomena.cpp:80:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |         scanf("%d %d %lld",&ll,&rr,&val);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 22780 KB Output is correct
2 Correct 298 ms 28852 KB Output is correct
3 Correct 310 ms 29516 KB Output is correct
4 Correct 291 ms 28764 KB Output is correct
5 Correct 298 ms 29936 KB Output is correct
6 Correct 158 ms 25904 KB Output is correct
7 Correct 162 ms 25928 KB Output is correct
8 Correct 265 ms 29784 KB Output is correct
9 Correct 267 ms 30092 KB Output is correct
10 Correct 262 ms 28876 KB Output is correct
11 Correct 169 ms 25836 KB Output is correct
12 Correct 162 ms 26540 KB Output is correct
13 Correct 151 ms 26728 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 338 ms 22780 KB Output is correct
23 Correct 298 ms 28852 KB Output is correct
24 Correct 310 ms 29516 KB Output is correct
25 Correct 291 ms 28764 KB Output is correct
26 Correct 298 ms 29936 KB Output is correct
27 Correct 158 ms 25904 KB Output is correct
28 Correct 162 ms 25928 KB Output is correct
29 Correct 265 ms 29784 KB Output is correct
30 Correct 267 ms 30092 KB Output is correct
31 Correct 262 ms 28876 KB Output is correct
32 Correct 169 ms 25836 KB Output is correct
33 Correct 162 ms 26540 KB Output is correct
34 Correct 151 ms 26728 KB Output is correct
35 Correct 316 ms 28488 KB Output is correct
36 Correct 305 ms 29784 KB Output is correct
37 Correct 314 ms 30796 KB Output is correct
38 Correct 302 ms 30324 KB Output is correct
39 Correct 310 ms 30328 KB Output is correct
40 Correct 314 ms 30360 KB Output is correct
41 Correct 310 ms 30132 KB Output is correct
42 Correct 312 ms 30532 KB Output is correct
43 Correct 353 ms 29612 KB Output is correct
44 Correct 313 ms 29972 KB Output is correct
45 Correct 293 ms 30100 KB Output is correct
46 Correct 304 ms 31032 KB Output is correct
47 Correct 170 ms 26520 KB Output is correct
48 Correct 154 ms 26488 KB Output is correct
49 Correct 293 ms 28656 KB Output is correct
50 Correct 172 ms 26292 KB Output is correct
51 Correct 162 ms 26752 KB Output is correct
52 Correct 197 ms 26572 KB Output is correct