oj.uz

Submission #885494

# Submission time Handle Problem Language Result Execution time Memory
885494 2023-12-09T20:58:01 Z vjudge1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 515 ms 13888 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e15 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

int ans = 0, n, q, s, t; 

int f(int a, int b)
{
    if(a < b)
        return (a - b) * s; 
    else 
        return (a - b) * t; 
}

struct SegmentTreeLazy
{
    struct node
    {
        int value, lazy;

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

    vector <node> tree; int l;

    void update(int v, int s, int e, int k)
    {
        if(tree[v].lazy == -Inf) tree[v].lazy = 0; 
        tree[v].lazy += k;
        tree[v].value += (e - s + 1) * k;
    }

    void push(int v, int s, int e)
    {
        if (tree[v].lazy != -Inf)
        {
            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 = -Inf;
        }
    }

    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); }

    SegmentTreeLazy(int n)
    {
        for (l = 1; l < n; l = (l << 1));
        tree.resize(2 * l);
    }
};

void solve()
{
    cin >> n >> q >> s >> t; 
    SegmentTreeLazy St(n+2); 
    vector <int> v(n+1); 
    
    for(int i = 0; i <= n; i++)
    {
        cin >> v[i]; 
        St.increase(i+1, i+1, v[i]); 
        if(i != 0) ans += f(v[i-1], v[i]); 
    }

    //cerr << ans << endl; 

    while (q--)
    {
        int l, r, x, a, b, c, d; cin >> l >> r >> x; l++; r++; 

        a = St.query(l-1), b = St.query(l), c = St.query(r), d = St.query(r+1); 
        ans -= f(a, b); if(r != n+1) ans -= f(c, d); 

        St.increase(l, r, x);

        a = St.query(l-1), b = St.query(l), c = St.query(r), d = St.query(r+1); 
        ans += f(a, b); if(r != n+1) ans += f(c, d); 

        cout << ans << endl; 

        /*cout << endl; 
        for(int i = 1; i <= n+1; i++)
            cout << St.query(i) << " "; 
        break; */
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 556 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 5 ms 552 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 556 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 11780 KB Output is correct
2 Correct 467 ms 12268 KB Output is correct
3 Correct 463 ms 12644 KB Output is correct
4 Correct 442 ms 12028 KB Output is correct
5 Correct 436 ms 12688 KB Output is correct
6 Correct 284 ms 13188 KB Output is correct
7 Correct 276 ms 13164 KB Output is correct
8 Correct 418 ms 13140 KB Output is correct
9 Correct 416 ms 13308 KB Output is correct
10 Correct 417 ms 12132 KB Output is correct
11 Correct 252 ms 13056 KB Output is correct
12 Correct 283 ms 13472 KB Output is correct
13 Correct 268 ms 13828 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 556 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 5 ms 552 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 556 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 458 ms 11780 KB Output is correct
23 Correct 467 ms 12268 KB Output is correct
24 Correct 463 ms 12644 KB Output is correct
25 Correct 442 ms 12028 KB Output is correct
26 Correct 436 ms 12688 KB Output is correct
27 Correct 284 ms 13188 KB Output is correct
28 Correct 276 ms 13164 KB Output is correct
29 Correct 418 ms 13140 KB Output is correct
30 Correct 416 ms 13308 KB Output is correct
31 Correct 417 ms 12132 KB Output is correct
32 Correct 252 ms 13056 KB Output is correct
33 Correct 283 ms 13472 KB Output is correct
34 Correct 268 ms 13828 KB Output is correct
35 Correct 450 ms 11748 KB Output is correct
36 Correct 467 ms 13364 KB Output is correct
37 Correct 472 ms 13888 KB Output is correct
38 Correct 515 ms 13684 KB Output is correct
39 Correct 447 ms 13824 KB Output is correct
40 Correct 444 ms 13656 KB Output is correct
41 Correct 473 ms 13520 KB Output is correct
42 Correct 457 ms 13744 KB Output is correct
43 Correct 449 ms 12828 KB Output is correct
44 Correct 458 ms 13268 KB Output is correct
45 Correct 462 ms 13300 KB Output is correct
46 Correct 446 ms 13808 KB Output is correct
47 Correct 276 ms 13824 KB Output is correct
48 Correct 251 ms 13804 KB Output is correct
49 Correct 447 ms 13044 KB Output is correct
50 Correct 262 ms 13564 KB Output is correct
51 Correct 289 ms 13748 KB Output is correct
52 Correct 277 ms 13652 KB Output is correct