oj.uz

Submission #885517

# Submission time Handle Problem Language Result Execution time Memory
885517 2023-12-09T22:32:26 Z Marco_Escandon Foehn Phenomena (JOI17_foehn_phenomena) C++11
30 / 100
 1000 ms 34348 KB 
#include<bits/stdc++.h>
using namespace std;
#define int __int128
int asdf=0;
struct node
{
    int value, lazy;

    node(int v = asdf)
    {
        value = v;
        lazy = asdf;
    }
};

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 = asdf;
    }
}

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 asdf;

    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()
{
    int64_t n,q,s,t;
    cin>>n>>q>>s>>t;
    int64_t cad[n+1];
    Segment_tree (n+5);
    for(int i=asdf; i<n+1; i++)
    {
        cin>>cad[i];
    }
    int sol=asdf;
    for(int i=1; i<=n; i++)
    {
        sol-=s*max((__int128)cad[i]-cad[i-1],asdf);
        sol+=t*max((__int128)cad[i-1]-cad[i],asdf);
        increase(i+1,i+1,cad[i]);
    }
    while(q--)
    {
        int64_t a,b,c;
        cin>>a>>b>>c;
        a++;
        b++;
        sol+=s*max(query(a)-query(a-1),asdf);
        sol-=t*max(query(a-1)-query(a),asdf);
        if(b!=n+1){
        sol+=s*max(query(b+1)-query(b),asdf);
        sol-=t*max(query(b)-query(b+1),asdf);}

        increase(a,b,c);
        
        sol-=s*max(query(a)-query(a-1),asdf);
        sol+=t*max(query(a-1)-query(a),asdf);
        if(b!=n+1){
        sol-=s*max(query(b+1)-query(b),asdf);
        sol+=t*max(query(b)-query(b+1),asdf);}
        cout<<(long long) sol<<"\n";
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31580 KB Output is correct
2 Correct 16 ms 31580 KB Output is correct
3 Correct 15 ms 31580 KB Output is correct
4 Correct 15 ms 31784 KB Output is correct
5 Correct 16 ms 31580 KB Output is correct
6 Correct 15 ms 31580 KB Output is correct
7 Correct 15 ms 31580 KB Output is correct
8 Correct 15 ms 31576 KB Output is correct
9 Correct 15 ms 31576 KB Output is correct
10 Correct 15 ms 31580 KB Output is correct
11 Correct 15 ms 31580 KB Output is correct
12 Correct 15 ms 31580 KB Output is correct
13 Correct 11 ms 31580 KB Output is correct
14 Correct 13 ms 31580 KB Output is correct
15 Correct 15 ms 31580 KB Output is correct
16 Correct 13 ms 31580 KB Output is correct
17 Correct 11 ms 31580 KB Output is correct
18 Correct 13 ms 31604 KB Output is correct
19 Correct 4 ms 31580 KB Output is correct
20 Correct 4 ms 31580 KB Output is correct
21 Correct 4 ms 31580 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1034 ms 34348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31580 KB Output is correct
2 Correct 16 ms 31580 KB Output is correct
3 Correct 15 ms 31580 KB Output is correct
4 Correct 15 ms 31784 KB Output is correct
5 Correct 16 ms 31580 KB Output is correct
6 Correct 15 ms 31580 KB Output is correct
7 Correct 15 ms 31580 KB Output is correct
8 Correct 15 ms 31576 KB Output is correct
9 Correct 15 ms 31576 KB Output is correct
10 Correct 15 ms 31580 KB Output is correct
11 Correct 15 ms 31580 KB Output is correct
12 Correct 15 ms 31580 KB Output is correct
13 Correct 11 ms 31580 KB Output is correct
14 Correct 13 ms 31580 KB Output is correct
15 Correct 15 ms 31580 KB Output is correct
16 Correct 13 ms 31580 KB Output is correct
17 Correct 11 ms 31580 KB Output is correct
18 Correct 13 ms 31604 KB Output is correct
19 Correct 4 ms 31580 KB Output is correct
20 Correct 4 ms 31580 KB Output is correct
21 Correct 4 ms 31580 KB Output is correct
22 Execution timed out 1034 ms 34348 KB Time limit exceeded
23 Halted 0 ms 0 KB -