oj.uz

답안 #885515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885515 2023-12-09T22:17:47 Z vjudge1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
30 / 100
 1000 ms 97152 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long

struct node
{
    int value, lazy;

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

node tree[(int)6e6]; 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 = 0;
    }
}

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

    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=0; i<n+1; i++)
    {
        cin>>cad[i];
    }
    ll sol=0;
    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++;
        sol+=s*max(query(a)-query(a-1),0LL);
        sol-=t*max(query(a-1)-query(a),0LL);
        if(b!=n+1){
        sol+=s*max(query(b+1)-query(b),0LL);
        sol-=t*max(query(b)-query(b+1),0LL);}

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

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 94300 KB Output is correct
2 Correct 22 ms 94408 KB Output is correct
3 Correct 22 ms 94300 KB Output is correct
4 Correct 22 ms 94372 KB Output is correct
5 Correct 22 ms 94300 KB Output is correct
6 Correct 21 ms 94300 KB Output is correct
7 Correct 22 ms 94300 KB Output is correct
8 Correct 22 ms 94300 KB Output is correct
9 Correct 22 ms 94300 KB Output is correct
10 Correct 26 ms 94300 KB Output is correct
11 Correct 22 ms 94296 KB Output is correct
12 Correct 22 ms 94384 KB Output is correct
13 Correct 22 ms 94300 KB Output is correct
14 Correct 20 ms 94212 KB Output is correct
15 Correct 22 ms 94348 KB Output is correct
16 Correct 19 ms 94308 KB Output is correct
17 Correct 18 ms 94300 KB Output is correct
18 Correct 20 ms 94300 KB Output is correct
19 Correct 14 ms 94300 KB Output is correct
20 Correct 14 ms 94300 KB Output is correct
21 Correct 13 ms 94228 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1008 ms 97152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 94300 KB Output is correct
2 Correct 22 ms 94408 KB Output is correct
3 Correct 22 ms 94300 KB Output is correct
4 Correct 22 ms 94372 KB Output is correct
5 Correct 22 ms 94300 KB Output is correct
6 Correct 21 ms 94300 KB Output is correct
7 Correct 22 ms 94300 KB Output is correct
8 Correct 22 ms 94300 KB Output is correct
9 Correct 22 ms 94300 KB Output is correct
10 Correct 26 ms 94300 KB Output is correct
11 Correct 22 ms 94296 KB Output is correct
12 Correct 22 ms 94384 KB Output is correct
13 Correct 22 ms 94300 KB Output is correct
14 Correct 20 ms 94212 KB Output is correct
15 Correct 22 ms 94348 KB Output is correct
16 Correct 19 ms 94308 KB Output is correct
17 Correct 18 ms 94300 KB Output is correct
18 Correct 20 ms 94300 KB Output is correct
19 Correct 14 ms 94300 KB Output is correct
20 Correct 14 ms 94300 KB Output is correct
21 Correct 13 ms 94228 KB Output is correct
22 Execution timed out 1008 ms 97152 KB Time limit exceeded
23 Halted 0 ms 0 KB -