oj.uz

Submission #518932

# Submission time Handle Problem Language Result Execution time Memory
518932 2022-01-25T08:29:05 Z Lam_lai_cuoc_doi Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 400 ms 17812 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T>
void read(T &x)
{
    x = 0;
    register int c;
    while ((c = getchar()) && (c > '9' || c < '0'))
        ;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = x * 10 + c - '0';
}

constexpr bool typetest = 0;
constexpr int N = 2e5 + 5;

struct SegmentTree
{
    int n;
    ll st[N * 4];
    SegmentTree()
    {
        memset(st, 0, sizeof st);
    }

    void Push(int id)
    {
        if (st[id])
        {
            st[id << 1] += st[id];
            st[id << 1 | 1] += st[id];
            st[id] = 0;
        }
    }

    void Build(int id, int l, int r, ll a[N])
    {
        if (l == r)
        {
            st[id] = a[l];
            return;
        }

        Build(id << 1, l, (l + r) / 2, a);
        Build(id << 1 | 1, (l + r) / 2 + 1, r, a);
    }

    void Build(ll a[N])
    {
        Build(1, 1, n, a);
    }

    void Update(int id, int l, int r, const int &a, const int &b, const ll &v)
    {
        if (l > b || r < a)
            return;
        if (l >= a && r <= b)
        {
            st[id] += v;
            return;
        }
        Push(id);

        Update(id << 1, l, (l + r) / 2, a, b, v);
        Update(id << 1 | 1, (l + r) / 2 + 1, r, a, b, v);
    }

    void Update(int l, int r, ll v)
    {
        Update(1, 1, n, l, r, v);
    }

    ll Get(int x)
    {
        int l = 1, r = n, id = 1;

        while (1)
        {
            if (l == r)
                break;

            Push(id);

            if ((l + r) / 2 >= x)
            {
                id = id << 1;
                r = (l + r) / 2;
            }
            else
            {
                id = id << 1 | 1;
                l = (l + r) / 2 + 1;
            }
        }

        return st[id];
    }
} f;

int n, q;
ll s, t, a[N], ans;

void Read()
{
    cin >> n >> q >> s >> t;

    for (int i = 0; i <= n; ++i)
        cin >> a[i];
}

void Remove(int l, int r)
{
    if (r > n)
        return;

    ll u = l == 0 ? 0 : f.Get(l),
       v = f.Get(r);

    if (u < v)
        ans += (v - u) * s;
    else
        ans -= (u - v) * t;
}

void Add(int l, int r)
{
    if (r > n)
        return;

    ll u = l == 0 ? 0 : f.Get(l),
       v = f.Get(r);

    // cerr << l << " " << r << ": " << u << " " << v << "\n";

    if (u < v)
        ans -= (v - u) * s;
    else
        ans += (u - v) * t;
}

void Solve()
{
    f.n = n;
    f.Build(a);

    for (int i = 1; i <= n; ++i)
    {
        Add(i - 1, i);

        // cout << i << ": " << ans << "\n";
    }

    while (q--)
    {
        int l, r, x;
        cin >> l >> r >> x;

        Remove(l - 1, l);
        Remove(r, r + 1);

        f.Update(l, r, x);

        Add(l - 1, l);
        Add(r, r + 1);

        cout << ans << '\n';
    }
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen("tests.inp", "r"))
    {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    int t(1);
    if (typetest)
        cin >> t;
    for (int _ = 1; _ <= t; ++_)
    {
        // cout << "Case " << _ << ": ";
        Read();
        Solve();
    }
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}

/*
 */

Compilation message

foehn_phenomena.cpp: In function 'void read(T&)':
foehn_phenomena.cpp:12:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   12 |     register int c;
      |                  ^
foehn_phenomena.cpp: In function 'int32_t main()':
foehn_phenomena.cpp:182:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  182 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:183:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  183 |         freopen("test.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6604 KB Output is correct
2 Correct 8 ms 6676 KB Output is correct
3 Correct 6 ms 6604 KB Output is correct
4 Correct 6 ms 6604 KB Output is correct
5 Correct 5 ms 6604 KB Output is correct
6 Correct 6 ms 6604 KB Output is correct
7 Correct 5 ms 6604 KB Output is correct
8 Correct 5 ms 6600 KB Output is correct
9 Correct 7 ms 6620 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 5 ms 6604 KB Output is correct
12 Correct 5 ms 6528 KB Output is correct
13 Correct 4 ms 6604 KB Output is correct
14 Correct 4 ms 6604 KB Output is correct
15 Correct 6 ms 6600 KB Output is correct
16 Correct 4 ms 6604 KB Output is correct
17 Correct 4 ms 6600 KB Output is correct
18 Correct 7 ms 6604 KB Output is correct
19 Correct 3 ms 6476 KB Output is correct
20 Correct 3 ms 6476 KB Output is correct
21 Correct 3 ms 6476 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 400 ms 9460 KB Output is correct
2 Correct 378 ms 10128 KB Output is correct
3 Correct 386 ms 10660 KB Output is correct
4 Correct 369 ms 9860 KB Output is correct
5 Correct 378 ms 16800 KB Output is correct
6 Correct 139 ms 15780 KB Output is correct
7 Correct 152 ms 15664 KB Output is correct
8 Correct 324 ms 16432 KB Output is correct
9 Correct 328 ms 16868 KB Output is correct
10 Correct 342 ms 15572 KB Output is correct
11 Correct 182 ms 15540 KB Output is correct
12 Correct 128 ms 16324 KB Output is correct
13 Correct 156 ms 16580 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6604 KB Output is correct
2 Correct 8 ms 6676 KB Output is correct
3 Correct 6 ms 6604 KB Output is correct
4 Correct 6 ms 6604 KB Output is correct
5 Correct 5 ms 6604 KB Output is correct
6 Correct 6 ms 6604 KB Output is correct
7 Correct 5 ms 6604 KB Output is correct
8 Correct 5 ms 6600 KB Output is correct
9 Correct 7 ms 6620 KB Output is correct
10 Correct 5 ms 6604 KB Output is correct
11 Correct 5 ms 6604 KB Output is correct
12 Correct 5 ms 6528 KB Output is correct
13 Correct 4 ms 6604 KB Output is correct
14 Correct 4 ms 6604 KB Output is correct
15 Correct 6 ms 6600 KB Output is correct
16 Correct 4 ms 6604 KB Output is correct
17 Correct 4 ms 6600 KB Output is correct
18 Correct 7 ms 6604 KB Output is correct
19 Correct 3 ms 6476 KB Output is correct
20 Correct 3 ms 6476 KB Output is correct
21 Correct 3 ms 6476 KB Output is correct
22 Correct 400 ms 9460 KB Output is correct
23 Correct 378 ms 10128 KB Output is correct
24 Correct 386 ms 10660 KB Output is correct
25 Correct 369 ms 9860 KB Output is correct
26 Correct 378 ms 16800 KB Output is correct
27 Correct 139 ms 15780 KB Output is correct
28 Correct 152 ms 15664 KB Output is correct
29 Correct 324 ms 16432 KB Output is correct
30 Correct 328 ms 16868 KB Output is correct
31 Correct 342 ms 15572 KB Output is correct
32 Correct 182 ms 15540 KB Output is correct
33 Correct 128 ms 16324 KB Output is correct
34 Correct 156 ms 16580 KB Output is correct
35 Correct 373 ms 15212 KB Output is correct
36 Correct 383 ms 16544 KB Output is correct
37 Correct 393 ms 17360 KB Output is correct
38 Correct 379 ms 17096 KB Output is correct
39 Correct 381 ms 17064 KB Output is correct
40 Correct 379 ms 17196 KB Output is correct
41 Correct 363 ms 16908 KB Output is correct
42 Correct 366 ms 17024 KB Output is correct
43 Correct 373 ms 16288 KB Output is correct
44 Correct 368 ms 16768 KB Output is correct
45 Correct 373 ms 16784 KB Output is correct
46 Correct 392 ms 17812 KB Output is correct
47 Correct 130 ms 16432 KB Output is correct
48 Correct 174 ms 16324 KB Output is correct
49 Correct 379 ms 15324 KB Output is correct
50 Correct 183 ms 16176 KB Output is correct
51 Correct 144 ms 16524 KB Output is correct
52 Correct 207 ms 16476 KB Output is correct