oj.uz

Submission #931118

# Submission time Handle Problem Language Result Execution time Memory
931118 2024-02-21T09:25:29 Z De3b0o Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 409 ms 22508 KB 
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define er erase
#define pb push_back
#define ppb pop_back()
#define ph push
#define pp pop()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "YES" << "\n";
#define no cout << "NO" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid (l+r)/2

using namespace std;

ll seg[800009];
ll lazy[800009];
ll a[200009];

void sb(ll n , ll l , ll r)
{
    if(l==r)
    {
        seg[n]=a[l];
        return;
    }
    sb(2*n,l,mid);
    sb(2*n+1,mid+1,r);
    seg[n]=seg[2*n]+seg[2*n+1];
}

ll sg(ll n , ll l , ll r , ll i)
{
    if(l>i||r<i)
        return 0;
    seg[n]+=lazy[n]*(r-l+1);
    if(l!=r)
    {
        lazy[2*n]+=lazy[n];
        lazy[2*n+1]+=lazy[n];
    }
    lazy[n]=0;
    if(l==r)
        return seg[n];
    return sg(2*n,l,mid,i)+sg(2*n+1,mid+1,r,i);
}

void su(ll n , ll l , ll r , ll l1 , ll r1 , ll x)
{
    if(l>r1||r<l1)
        return;
    if(l>=l1&&r<=r1)
    {
        lazy[n]+=x;
        return;
    }
    su(2*n,l,mid,l1,r1,x);
    su(2*n+1,mid+1,r,l1,r1,x);
}

int main()
{
    d3
    ll n , q , s , t;
    cin >> n >> q >> s >> t;
    for(int i = 0 ; n>=i ; i++)
        cin >> a[i];
    sb(1,0,n);
    ll ans = 0;
    for(int i = 0 ; n>i ; i++)
    {
        ll ans1 = a[i]-a[i+1];
        if(a[i]<a[i+1])
            ans1*=s;
        else
            ans1*=t;
        ans+=ans1;
    }
    while(q--)
    {
        ll l , r , x;
        cin >> l >> r >> x;
        if(l)
        {
            ll x1 = sg(1,0,n,l-1);
            ll x2 = sg(1,0,n,l);
            ll ans1 = x1-x2;
            if(x1<x2)
                ans1*=s;
            else
                ans1*=t;
            ans-=ans1;
        }
        if(r<n)
        {
            ll x1 = sg(1,0,n,r);
            ll x2 = sg(1,0,n,r+1);
            ll ans1 = x1-x2;
            if(x1<x2)
                ans1*=s;
            else
                ans1*=t;
            ans-=ans1;
        }
        su(1,0,n,l,r,x);
        if(l)
        {
            ll x1 = sg(1,0,n,l-1);
            ll x2 = sg(1,0,n,l);
            ll ans1 = x1-x2;
            if(x1<x2)
                ans1*=s;
            else
                ans1*=t;
            ans+=ans1;
        }
        if(r<n)
        {
            ll x1 = sg(1,0,n,r);
            ll x2 = sg(1,0,n,r+1);
            ll ans1 = x1-x2;
            if(x1<x2)
                ans1*=s;
            else
                ans1*=t;
            ans+=ans1;
        }
        cans
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 4 ms 2648 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 3 ms 2652 KB Output is correct
6 Correct 3 ms 2528 KB Output is correct
7 Correct 4 ms 2652 KB Output is correct
8 Correct 3 ms 2396 KB Output is correct
9 Correct 3 ms 2396 KB Output is correct
10 Correct 3 ms 2524 KB Output is correct
11 Correct 3 ms 2648 KB Output is correct
12 Correct 3 ms 2652 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 3 ms 2396 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 19676 KB Output is correct
2 Correct 368 ms 20276 KB Output is correct
3 Correct 383 ms 20976 KB Output is correct
4 Correct 348 ms 20224 KB Output is correct
5 Correct 347 ms 21328 KB Output is correct
6 Correct 169 ms 18516 KB Output is correct
7 Correct 169 ms 18244 KB Output is correct
8 Correct 308 ms 21468 KB Output is correct
9 Correct 289 ms 21552 KB Output is correct
10 Correct 288 ms 20308 KB Output is correct
11 Correct 239 ms 18328 KB Output is correct
12 Correct 170 ms 19284 KB Output is correct
13 Correct 165 ms 19148 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 4 ms 2648 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 3 ms 2652 KB Output is correct
6 Correct 3 ms 2528 KB Output is correct
7 Correct 4 ms 2652 KB Output is correct
8 Correct 3 ms 2396 KB Output is correct
9 Correct 3 ms 2396 KB Output is correct
10 Correct 3 ms 2524 KB Output is correct
11 Correct 3 ms 2648 KB Output is correct
12 Correct 3 ms 2652 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 3 ms 2396 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2512 KB Output is correct
22 Correct 409 ms 19676 KB Output is correct
23 Correct 368 ms 20276 KB Output is correct
24 Correct 383 ms 20976 KB Output is correct
25 Correct 348 ms 20224 KB Output is correct
26 Correct 347 ms 21328 KB Output is correct
27 Correct 169 ms 18516 KB Output is correct
28 Correct 169 ms 18244 KB Output is correct
29 Correct 308 ms 21468 KB Output is correct
30 Correct 289 ms 21552 KB Output is correct
31 Correct 288 ms 20308 KB Output is correct
32 Correct 239 ms 18328 KB Output is correct
33 Correct 170 ms 19284 KB Output is correct
34 Correct 165 ms 19148 KB Output is correct
35 Correct 365 ms 19940 KB Output is correct
36 Correct 359 ms 21328 KB Output is correct
37 Correct 370 ms 22116 KB Output is correct
38 Correct 361 ms 21740 KB Output is correct
39 Correct 371 ms 21840 KB Output is correct
40 Correct 379 ms 22140 KB Output is correct
41 Correct 355 ms 21588 KB Output is correct
42 Correct 353 ms 21844 KB Output is correct
43 Correct 360 ms 21076 KB Output is correct
44 Correct 356 ms 21332 KB Output is correct
45 Correct 354 ms 21620 KB Output is correct
46 Correct 356 ms 22508 KB Output is correct
47 Correct 177 ms 18984 KB Output is correct
48 Correct 214 ms 18936 KB Output is correct
49 Correct 362 ms 20236 KB Output is correct
50 Correct 222 ms 18872 KB Output is correct
51 Correct 169 ms 19280 KB Output is correct
52 Correct 253 ms 21072 KB Output is correct