oj.uz

Submission #885520

# Submission time Handle Problem Language Result Execution time Memory
885520 2023-12-09T22:47:54 Z vjudge1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 863 ms 21436 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
struct node
{
    int value, lazy;
 
    node(int v = 0LL)
    {
        value = v;
        lazy = 0LL;
    }
};
 
node tree[(int)1e6]; int l;
 
void update(int v, int s, int e, int k)
{
    tree[v].lazy += k;
    tree[v].value += (e - s + 1) * k;
}
 
void push(int v, int s, int e)
{
    if (tree[v].lazy)
    {
        int middle = (s + e) / 2;
 
        update(2 * v, s, middle, tree[v].lazy);
        update(2 * v + 1, middle + 1, e, tree[v].lazy);
 
        tree[v].lazy = 0LL;
    }
}
 
void increase(int node, int v, int x, int y, int s, int e)
{
    if (x > e || y < s) return;
 
    if (s >= x && e <= y)
    {
        update(node, s, e, v);
        return;
    }
 
    push(node, s, e);
 
    int middle = (s + e) / 2;
 
    increase(node * 2, v, x, y, s, middle);
    increase(node * 2 + 1, v, x, y, middle + 1, e);
 
    tree[node].value = tree[node * 2].value
        + tree[node * 2 + 1].value;
}
 
void increase(int x, int y, int v) { increase(1, v, x, y, 1, l); }
 
int sum(int node, int x, int y, int s, int e)
{
    if (x > e || y < s) return 0LL;
 
    if (s >= x && e <= y)
        return tree[node].value;
 
    push(node, s, e);
    int middle = (s + e) / 2;
 
    return sum(node * 2, x, y, s, middle) +
        sum(node * 2 + 1, x, y, middle + 1, e);
}
 
int query(int x) { return sum(1, x, x, 1, l); }
 
void Segment_tree(int n)
{
    for (l = 1; l < n; l = (l << 1));
}
 
 
int32_t main()
{
    ll n,q,s,t;
    cin>>n>>q>>s>>t;
    ll cad[n+1];
    Segment_tree (n+2);
    for(int i=0LL; i<n+1; i++)
    {
        cin>>cad[i];
    }
    ll sol=0LL;
    for(int i=1; i<=n; i++)
    {
        sol-=s*max(cad[i]-cad[i-1],0LL);
        sol+=t*max(cad[i-1]-cad[i],0LL);
        increase(i+1,i+1,cad[i]);
    }
    while(q--)
    {
        ll a,b,c;
        cin>>a>>b>>c;
        a++;
        b++;
        ll t1=query(a),t2=query(a-1);
        sol+=s*max(t1-t2,0LL);
        sol-=t*max(t2-t1,0LL);
        if(b!=n+1){
        ll t3=query(b+1), t4=query(b);
        sol+=s*max(t3-t4,0LL);
        sol-=t*max(t4-t3,0LL);}
 
        increase(a,b,c);
        t1=query(a),t2=query(a-1);

        sol-=s*max(t1-t2,0LL);
        sol+=t*max(t2-t1,0LL);
        if(b!=n+1){
        ll t3=query(b+1), t4=query(b);
        sol-=s*max(t3-t4,0LL);
        sol+=t*max(t4-t3,0LL);}
        cout<<sol<<"\n";
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15960 KB Output is correct
2 Correct 10 ms 15960 KB Output is correct
3 Correct 9 ms 16216 KB Output is correct
4 Correct 12 ms 15964 KB Output is correct
5 Correct 13 ms 16120 KB Output is correct
6 Correct 11 ms 16100 KB Output is correct
7 Correct 10 ms 15960 KB Output is correct
8 Correct 9 ms 15960 KB Output is correct
9 Correct 9 ms 15964 KB Output is correct
10 Correct 10 ms 15980 KB Output is correct
11 Correct 10 ms 15964 KB Output is correct
12 Correct 10 ms 15964 KB Output is correct
13 Correct 9 ms 15964 KB Output is correct
14 Correct 8 ms 15964 KB Output is correct
15 Correct 9 ms 15964 KB Output is correct
16 Correct 8 ms 15964 KB Output is correct
17 Correct 8 ms 15964 KB Output is correct
18 Correct 8 ms 15960 KB Output is correct
19 Correct 3 ms 15964 KB Output is correct
20 Correct 4 ms 15988 KB Output is correct
21 Correct 3 ms 15964 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 813 ms 19172 KB Output is correct
2 Correct 814 ms 19632 KB Output is correct
3 Correct 863 ms 20456 KB Output is correct
4 Correct 819 ms 19368 KB Output is correct
5 Correct 809 ms 20000 KB Output is correct
6 Correct 557 ms 20452 KB Output is correct
7 Correct 552 ms 20700 KB Output is correct
8 Correct 755 ms 20708 KB Output is correct
9 Correct 739 ms 20660 KB Output is correct
10 Correct 736 ms 19616 KB Output is correct
11 Correct 608 ms 20564 KB Output is correct
12 Correct 560 ms 20960 KB Output is correct
13 Correct 551 ms 21212 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15960 KB Output is correct
2 Correct 10 ms 15960 KB Output is correct
3 Correct 9 ms 16216 KB Output is correct
4 Correct 12 ms 15964 KB Output is correct
5 Correct 13 ms 16120 KB Output is correct
6 Correct 11 ms 16100 KB Output is correct
7 Correct 10 ms 15960 KB Output is correct
8 Correct 9 ms 15960 KB Output is correct
9 Correct 9 ms 15964 KB Output is correct
10 Correct 10 ms 15980 KB Output is correct
11 Correct 10 ms 15964 KB Output is correct
12 Correct 10 ms 15964 KB Output is correct
13 Correct 9 ms 15964 KB Output is correct
14 Correct 8 ms 15964 KB Output is correct
15 Correct 9 ms 15964 KB Output is correct
16 Correct 8 ms 15964 KB Output is correct
17 Correct 8 ms 15964 KB Output is correct
18 Correct 8 ms 15960 KB Output is correct
19 Correct 3 ms 15964 KB Output is correct
20 Correct 4 ms 15988 KB Output is correct
21 Correct 3 ms 15964 KB Output is correct
22 Correct 813 ms 19172 KB Output is correct
23 Correct 814 ms 19632 KB Output is correct
24 Correct 863 ms 20456 KB Output is correct
25 Correct 819 ms 19368 KB Output is correct
26 Correct 809 ms 20000 KB Output is correct
27 Correct 557 ms 20452 KB Output is correct
28 Correct 552 ms 20700 KB Output is correct
29 Correct 755 ms 20708 KB Output is correct
30 Correct 739 ms 20660 KB Output is correct
31 Correct 736 ms 19616 KB Output is correct
32 Correct 608 ms 20564 KB Output is correct
33 Correct 560 ms 20960 KB Output is correct
34 Correct 551 ms 21212 KB Output is correct
35 Correct 807 ms 19236 KB Output is correct
36 Correct 806 ms 20560 KB Output is correct
37 Correct 804 ms 21328 KB Output is correct
38 Correct 806 ms 21032 KB Output is correct
39 Correct 808 ms 21160 KB Output is correct
40 Correct 806 ms 21196 KB Output is correct
41 Correct 806 ms 21044 KB Output is correct
42 Correct 829 ms 21048 KB Output is correct
43 Correct 823 ms 20204 KB Output is correct
44 Correct 808 ms 20760 KB Output is correct
45 Correct 812 ms 20564 KB Output is correct
46 Correct 827 ms 21436 KB Output is correct
47 Correct 561 ms 21200 KB Output is correct
48 Correct 596 ms 21332 KB Output is correct
49 Correct 775 ms 20208 KB Output is correct
50 Correct 608 ms 21256 KB Output is correct
51 Correct 564 ms 21072 KB Output is correct
52 Correct 620 ms 21328 KB Output is correct