oj.uz

Submission #615425

# Submission time Handle Problem Language Result Execution time Memory
615425 2022-07-31T09:07:03 Z nohaxjustsoflo Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 189 ms 13164 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen; ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN=2e5+5;
const int mod=998244353;
const int mxlogN=40;
const int mxK=26;
const int inf=2e9;
const int K=600;
ll a[mxN], ft[mxN];
void add(int i, int v)
{
    while(i<mxN)
    {
        ft[i]+=v;
        i+=i&-i;
    }
}
ll sum(int i)
{
    if(!i) return 0;
    ll s=0;
    while(i)
    {
        s+=ft[i];
        i-=i&-i;
    }
    return s;
}
ll check(int i, ll s, ll t)
{
    if(a[i+1]-a[i]>0) return -(a[i+1]-a[i])*s;
    return -(a[i+1]-a[i])*t;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n,q; ll s,t; cin >> n >> q >> s >> t;
    for(int i=1; i<=n+1; i++)
    {
        cin >> a[i];
        add(i,a[i]-a[i-1]);
    }
    ll ans=0;
    for(int i=n; i; i--) ans+=check(i,s,t);
    while(q--)
    {
        int l, r, x; cin >> l >> r >> x; l++, r++;
        a[l]=sum(l), a[l-1]=sum(l-1), a[r]=sum(r), a[r+1]=sum(r+1);
        ans-=check(l-1,s,t);
        if(r<=n) ans-=check(r,s,t);
        add(l  , x);
        add(r+1,-x);
        a[l]=sum(l), a[l-1]=sum(l-1), a[r]=sum(r), a[r+1]=sum(r+1);
        ans+=check(l-1,s,t);
        if(r<=n) ans+=check(r,s,t);
        cout << ans << "\n";
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 472 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 440 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 476 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 444 KB Output is correct
12 Correct 3 ms 436 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 436 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 476 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 10228 KB Output is correct
2 Correct 152 ms 11012 KB Output is correct
3 Correct 161 ms 11472 KB Output is correct
4 Correct 147 ms 10948 KB Output is correct
5 Correct 189 ms 12040 KB Output is correct
6 Correct 133 ms 11076 KB Output is correct
7 Correct 98 ms 10952 KB Output is correct
8 Correct 187 ms 11748 KB Output is correct
9 Correct 129 ms 12188 KB Output is correct
10 Correct 169 ms 10976 KB Output is correct
11 Correct 103 ms 10864 KB Output is correct
12 Correct 96 ms 11616 KB Output is correct
13 Correct 100 ms 11828 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 472 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 440 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 476 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 444 KB Output is correct
12 Correct 3 ms 436 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 436 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 476 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 142 ms 10228 KB Output is correct
23 Correct 152 ms 11012 KB Output is correct
24 Correct 161 ms 11472 KB Output is correct
25 Correct 147 ms 10948 KB Output is correct
26 Correct 189 ms 12040 KB Output is correct
27 Correct 133 ms 11076 KB Output is correct
28 Correct 98 ms 10952 KB Output is correct
29 Correct 187 ms 11748 KB Output is correct
30 Correct 129 ms 12188 KB Output is correct
31 Correct 169 ms 10976 KB Output is correct
32 Correct 103 ms 10864 KB Output is correct
33 Correct 96 ms 11616 KB Output is correct
34 Correct 100 ms 11828 KB Output is correct
35 Correct 147 ms 10380 KB Output is correct
36 Correct 153 ms 11792 KB Output is correct
37 Correct 173 ms 12576 KB Output is correct
38 Correct 165 ms 12356 KB Output is correct
39 Correct 159 ms 12428 KB Output is correct
40 Correct 160 ms 12416 KB Output is correct
41 Correct 160 ms 12212 KB Output is correct
42 Correct 149 ms 12380 KB Output is correct
43 Correct 162 ms 11624 KB Output is correct
44 Correct 144 ms 12084 KB Output is correct
45 Correct 162 ms 12080 KB Output is correct
46 Correct 152 ms 13164 KB Output is correct
47 Correct 100 ms 11684 KB Output is correct
48 Correct 104 ms 11636 KB Output is correct
49 Correct 135 ms 10656 KB Output is correct
50 Correct 117 ms 11636 KB Output is correct
51 Correct 96 ms 11896 KB Output is correct
52 Correct 92 ms 11668 KB Output is correct