oj.uz

Submission #83669

# Submission time Handle Problem Language Result Execution time Memory
83669 2018-11-09T18:00:42 Z nikolapesic2802 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 591 ms 75136 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define pb push_back

using namespace std;
using namespace __gnu_pbds;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; ///find_by_order(),order_of_key()
int n;
struct SegmentTree{
    vector<ll> lazy;
    void init(int nn)
    {
        lazy.resize(4*nn);
    }
    void prop(int i)
    {
        lazy[2*i]+=lazy[i];
        lazy[2*i+1]+=lazy[i];
        lazy[i]=0;
    }
    void set(int l,int r,ll x,int i=1,int lo=0,int hi=n+1)
    {
        if(hi<l||lo>r)
            return;
        if(l<=lo&&r>=hi)
        {
            lazy[i]+=x;
            return;
        }
        int mid=(lo+hi)/2;
        prop(i);
        set(l,r,x,2*i,lo,mid);
        set(l,r,x,2*i+1,mid+1,hi);
    }
    ll get(int p,int i=1,int lo=0,int hi=n+1)
    {
        if(p<lo||p>hi)
            return 0;
        if(hi==lo&&hi==p)
            return lazy[i];
        int mid=(lo+hi)/2;
        prop(i);
        return get(p,2*i,lo,mid)+get(p,2*i+1,mid+1,hi);
    }
} ST;
int main()
{
    int q,s,t;
    scanf("%i %i %i %i",&n,&q,&s,&t);
    ST.init(n+2);
    ST.set(n+1,n+1,LLONG_MIN/10);
    //printf("%lld\n",ST.get(n+1));
    vector<int> alt(n+1);
    for(int i=0;i<=n;i++)
    {
        scanf("%i",&alt[i]);
        ST.set(i,i,alt[i]);
    }
    /*for(int i=0;i<=n+1;i++)
    {
        printf("%lld ",ST.get(i));
    }*/
    ll temp=0;
    for(int i=1;i<=n;i++)
    {
        if(alt[i]>alt[i-1])
            temp-=(ll)s*(alt[i]-alt[i-1]);
        else
            temp+=(ll)t*(alt[i-1]-alt[i]);
    }
    for(int i=0;i<q;i++)
    {
        int l,r,x;
        scanf("%i %i %i",&l,&r,&x);
        ll levo=ST.get(l);
        ll desno=ST.get(r);
        ll levo1=ST.get(l-1);
        ll desno1=ST.get(r+1);
        //printf("%lld %lld %lld %lld\n",levo1,levo,desno,desno1);
        if(levo>levo1)
            temp+=(ll)s*(levo-levo1);
        else
            temp-=(ll)t*(levo1-levo);
        levo+=x;
        if(levo>levo1)
            temp-=(ll)s*(levo-levo1);
        else
            temp+=(ll)t*(levo1-levo);
        if(desno1!=LLONG_MIN/10)
        {
            if(desno1>desno)
                temp+=(ll)s*(desno1-desno);
            else
                temp-=(ll)t*(desno-desno1);
            desno+=x;
            if(desno1>desno)
                temp-=(ll)s*(desno1-desno);
            else
                temp+=(ll)t*(desno-desno1);
        }
        ST.set(l,r,x);
        printf("%lld\n",temp);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i %i %i %i",&n,&q,&s,&t);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i",&alt[i]);
         ~~~~~^~~~~~~~~~~~~~
foehn_phenomena.cpp:78:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i %i %i",&l,&r,&x);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 676 KB Output is correct
3 Correct 6 ms 748 KB Output is correct
4 Correct 6 ms 816 KB Output is correct
5 Correct 7 ms 900 KB Output is correct
6 Correct 6 ms 1024 KB Output is correct
7 Correct 6 ms 1192 KB Output is correct
8 Correct 6 ms 1244 KB Output is correct
9 Correct 6 ms 1420 KB Output is correct
10 Correct 6 ms 1420 KB Output is correct
11 Correct 5 ms 1420 KB Output is correct
12 Correct 6 ms 1420 KB Output is correct
13 Correct 5 ms 1420 KB Output is correct
14 Correct 6 ms 1460 KB Output is correct
15 Correct 8 ms 1460 KB Output is correct
16 Correct 4 ms 1548 KB Output is correct
17 Correct 5 ms 1548 KB Output is correct
18 Correct 5 ms 1640 KB Output is correct
19 Correct 2 ms 1640 KB Output is correct
20 Correct 2 ms 1640 KB Output is correct
21 Correct 2 ms 1640 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 15456 KB Output is correct
2 Correct 535 ms 21552 KB Output is correct
3 Correct 572 ms 27388 KB Output is correct
4 Correct 487 ms 32112 KB Output is correct
5 Correct 506 ms 38980 KB Output is correct
6 Correct 425 ms 44048 KB Output is correct
7 Correct 394 ms 48568 KB Output is correct
8 Correct 529 ms 54236 KB Output is correct
9 Correct 560 ms 59912 KB Output is correct
10 Correct 517 ms 64156 KB Output is correct
11 Correct 312 ms 69680 KB Output is correct
12 Correct 410 ms 74768 KB Output is correct
13 Correct 396 ms 75108 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 676 KB Output is correct
3 Correct 6 ms 748 KB Output is correct
4 Correct 6 ms 816 KB Output is correct
5 Correct 7 ms 900 KB Output is correct
6 Correct 6 ms 1024 KB Output is correct
7 Correct 6 ms 1192 KB Output is correct
8 Correct 6 ms 1244 KB Output is correct
9 Correct 6 ms 1420 KB Output is correct
10 Correct 6 ms 1420 KB Output is correct
11 Correct 5 ms 1420 KB Output is correct
12 Correct 6 ms 1420 KB Output is correct
13 Correct 5 ms 1420 KB Output is correct
14 Correct 6 ms 1460 KB Output is correct
15 Correct 8 ms 1460 KB Output is correct
16 Correct 4 ms 1548 KB Output is correct
17 Correct 5 ms 1548 KB Output is correct
18 Correct 5 ms 1640 KB Output is correct
19 Correct 2 ms 1640 KB Output is correct
20 Correct 2 ms 1640 KB Output is correct
21 Correct 2 ms 1640 KB Output is correct
22 Correct 548 ms 15456 KB Output is correct
23 Correct 535 ms 21552 KB Output is correct
24 Correct 572 ms 27388 KB Output is correct
25 Correct 487 ms 32112 KB Output is correct
26 Correct 506 ms 38980 KB Output is correct
27 Correct 425 ms 44048 KB Output is correct
28 Correct 394 ms 48568 KB Output is correct
29 Correct 529 ms 54236 KB Output is correct
30 Correct 560 ms 59912 KB Output is correct
31 Correct 517 ms 64156 KB Output is correct
32 Correct 312 ms 69680 KB Output is correct
33 Correct 410 ms 74768 KB Output is correct
34 Correct 396 ms 75108 KB Output is correct
35 Correct 542 ms 75108 KB Output is correct
36 Correct 542 ms 75108 KB Output is correct
37 Correct 552 ms 75108 KB Output is correct
38 Correct 563 ms 75108 KB Output is correct
39 Correct 543 ms 75136 KB Output is correct
40 Correct 522 ms 75136 KB Output is correct
41 Correct 564 ms 75136 KB Output is correct
42 Correct 522 ms 75136 KB Output is correct
43 Correct 518 ms 75136 KB Output is correct
44 Correct 591 ms 75136 KB Output is correct
45 Correct 543 ms 75136 KB Output is correct
46 Correct 527 ms 75136 KB Output is correct
47 Correct 399 ms 75136 KB Output is correct
48 Correct 355 ms 75136 KB Output is correct
49 Correct 509 ms 75136 KB Output is correct
50 Correct 318 ms 75136 KB Output is correct
51 Correct 390 ms 75136 KB Output is correct
52 Correct 406 ms 75136 KB Output is correct