oj.uz

Submission #654064

# Submission time Handle Problem Language Result Execution time Memory
654064 2022-10-29T17:43:31 Z sofija6 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 187 ms 13120 KB 
#include <bits/stdc++.h>
#define ll long long
#define MAXN 200010
using namespace std;
ll a[MAXN];
struct bit
{
    vector<ll> v;
    void Init()
    {
        v.resize(MAXN,0ll);
    }
    void Add(ll pos,ll val)
    {
        for (ll i=pos;i<MAXN;i+=i&(-i))
            v[i]+=val;
    }
    ll Calc(ll pos)
    {
        ll sum=0;
        for (ll i=pos;i>0;i-=i&(-i))
            sum+=v[i];
        return sum;
    }
    ll Query(ll l,ll r)
    {
        return Calc(r)-Calc(l-1);
    }
};
bit b;
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,q,s,t,ans=0,l,r,x;
    cin >> n >> q >> s >> t;
    for (ll i=0;i<=n;i++)
    {
        cin >> a[i];
        if (i)
        {
            if (a[i]>a[i-1])
                ans-=s*(a[i]-a[i-1]);
            else
                ans+=t*(a[i-1]-a[i]);
        }
    }
    b.Init();
    while (q--)
    {
        cin >> l >> r >> x;
        if (l)
        {
            ll val1=a[l-1]+b.Query(1,l-1),val2=a[l]+b.Query(1,l);
            if (val1<val2)
                ans+=s*(val2-val1);
            else
                ans-=t*(val1-val2);
        }
        r++;
        if (r<=n)
        {
            ll val1=a[r-1]+b.Query(1,r-1),val2=a[r]+b.Query(1,r);
            if (val1<val2)
                ans+=s*(val2-val1);
            else
                ans-=t*(val1-val2);
        }
        b.Add(l,x);
        b.Add(r,-x);
        if (l)
        {
            ll val1=a[l-1]+b.Query(1,l-1),val2=a[l]+b.Query(1,l);
            if (val1<val2)
                ans-=s*(val2-val1);
            else
                ans+=t*(val1-val2);
        }
        if (r<=n)
        {
            ll val1=a[r-1]+b.Query(1,r-1),val2=a[r]+b.Query(1,r);
            if (val1<val2)
                ans-=s*(val2-val1);
            else
                ans+=t*(val1-val2);
        }
        cout << ans << "\n";
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1876 KB Output is correct
2 Correct 4 ms 1932 KB Output is correct
3 Correct 3 ms 1920 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1872 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 2 ms 2004 KB Output is correct
8 Correct 2 ms 2004 KB Output is correct
9 Correct 2 ms 1876 KB Output is correct
10 Correct 3 ms 1876 KB Output is correct
11 Correct 3 ms 2004 KB Output is correct
12 Correct 4 ms 2004 KB Output is correct
13 Correct 2 ms 1876 KB Output is correct
14 Correct 3 ms 2004 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 2 ms 1876 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 3 ms 1876 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 2 ms 1864 KB Output is correct
21 Correct 2 ms 1876 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 4876 KB Output is correct
2 Correct 131 ms 5484 KB Output is correct
3 Correct 125 ms 6004 KB Output is correct
4 Correct 154 ms 5184 KB Output is correct
5 Correct 143 ms 5976 KB Output is correct
6 Correct 84 ms 6444 KB Output is correct
7 Correct 88 ms 6288 KB Output is correct
8 Correct 140 ms 6296 KB Output is correct
9 Correct 122 ms 6604 KB Output is correct
10 Correct 129 ms 5424 KB Output is correct
11 Correct 91 ms 6376 KB Output is correct
12 Correct 91 ms 6784 KB Output is correct
13 Correct 79 ms 7120 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1876 KB Output is correct
2 Correct 4 ms 1932 KB Output is correct
3 Correct 3 ms 1920 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 2 ms 1872 KB Output is correct
6 Correct 2 ms 1876 KB Output is correct
7 Correct 2 ms 2004 KB Output is correct
8 Correct 2 ms 2004 KB Output is correct
9 Correct 2 ms 1876 KB Output is correct
10 Correct 3 ms 1876 KB Output is correct
11 Correct 3 ms 2004 KB Output is correct
12 Correct 4 ms 2004 KB Output is correct
13 Correct 2 ms 1876 KB Output is correct
14 Correct 3 ms 2004 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 2 ms 1876 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 3 ms 1876 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 2 ms 1864 KB Output is correct
21 Correct 2 ms 1876 KB Output is correct
22 Correct 125 ms 4876 KB Output is correct
23 Correct 131 ms 5484 KB Output is correct
24 Correct 125 ms 6004 KB Output is correct
25 Correct 154 ms 5184 KB Output is correct
26 Correct 143 ms 5976 KB Output is correct
27 Correct 84 ms 6444 KB Output is correct
28 Correct 88 ms 6288 KB Output is correct
29 Correct 140 ms 6296 KB Output is correct
30 Correct 122 ms 6604 KB Output is correct
31 Correct 129 ms 5424 KB Output is correct
32 Correct 91 ms 6376 KB Output is correct
33 Correct 91 ms 6784 KB Output is correct
34 Correct 79 ms 7120 KB Output is correct
35 Correct 141 ms 10388 KB Output is correct
36 Correct 161 ms 11892 KB Output is correct
37 Correct 134 ms 12640 KB Output is correct
38 Correct 140 ms 12452 KB Output is correct
39 Correct 152 ms 12488 KB Output is correct
40 Correct 149 ms 12468 KB Output is correct
41 Correct 187 ms 12204 KB Output is correct
42 Correct 130 ms 12392 KB Output is correct
43 Correct 149 ms 11644 KB Output is correct
44 Correct 133 ms 12024 KB Output is correct
45 Correct 135 ms 12056 KB Output is correct
46 Correct 146 ms 13120 KB Output is correct
47 Correct 86 ms 11668 KB Output is correct
48 Correct 102 ms 11816 KB Output is correct
49 Correct 144 ms 10700 KB Output is correct
50 Correct 90 ms 11460 KB Output is correct
51 Correct 86 ms 11980 KB Output is correct
52 Correct 89 ms 11596 KB Output is correct