oj.uz

Submission #998154

# Submission time Handle Problem Language Result Execution time Memory
998154 2024-06-13T10:46:48 Z LOLOLO Feast (NOI19_feast) C++17
30 / 100
 173 ms 17968 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 3e5 + 10;
int p[N], sz[N], l[N], r[N], a[N];
ll val[N];

set <pair <ll, ll>> st;

int sign(ll v) {
    if (v >= 0)
        return 1;

    return -1;
}

int get(int x) {
    return p[x] ? get(p[x]) : x;
}

void unite(int a, int b) {
    a = get(a), b = get(b);
    if (a == b)
        return;

    if (sz[a] < sz[b])
        swap(a, b);

    sz[a] += sz[b];
    p[b] = a;
    l[a] = min(l[a], l[b]);
    r[a] = max(r[a], r[b]);
    val[a] += val[b];
}

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

    int n, k;
    cin >> n >> k;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sz[i] = 1;
        l[i] = r[i] = i;
    }

    while (a[n] <= 0 && n)
        n--;

    if (n == 0) {
        cout << 0 << '\n';
        return 0;
    } 

    int ft = 1;
    while (a[ft] <= 0)
        ft++;

    for (int j = ft; j <= n; j++) 
        a[j - ft + 1] = a[j];

    for (int i = 1; i <= n; i++) {
        val[i] = a[i];
    }

    for (int i = 1; i < n; i++) {
        if ((a[i] >= 0) == (a[i + 1] >= 0))
            unite(i, i + 1);
    }

    for (int i = 1; i <= n; i++) {
        if (get(i) == i) {
            st.insert({abs(val[get(i)]), sign(val[i]) * i});
        }
    }

    int ss = 1;
    while (sz(st) > k * 2) {
        auto it = *st.begin();
        st.erase(it);
        int p = abs(it.s);

        if (l[p] > ss) {
            int x = get(l[p] - 1);
            st.erase({abs(val[x]), sign(val[x]) * x});
            unite(p, x);
        }

        if (r[p] < n) {
            int x = get(r[p] + 1);
            st.erase({abs(val[x]), sign(val[x]) * x});
            unite(p, x);
        }

        p = get(p);
        st.insert({abs(val[p]), sign(val[p]) * p});

        while (val[get(n)] <= 0) {
            st.erase({abs(val[get(n)]), get(n) * sign(val[get(n)])});
            n = l[get(n)] - 1;
        }

        while (val[get(ss)] <= 0) {
            st.erase({abs(val[get(ss)]), get(ss) * sign(val[get(ss)])});
            ss = r[get(ss)] + 1;
        }
    }

    ll ans = 0;
    while (sz(st)) {
        auto it = *st.begin();
        st.erase(it);
        int p = abs(it.s);
        if (val[p] >= 0)
            ans += val[p];
    }

    cout << ans << '\n';
    return 0;

}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 8532 KB Output is correct
2 Correct 21 ms 8572 KB Output is correct
3 Correct 22 ms 8652 KB Output is correct
4 Correct 22 ms 8424 KB Output is correct
5 Correct 22 ms 8536 KB Output is correct
6 Correct 30 ms 8528 KB Output is correct
7 Correct 21 ms 8532 KB Output is correct
8 Correct 22 ms 8532 KB Output is correct
9 Correct 22 ms 8536 KB Output is correct
10 Correct 24 ms 8492 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8536 KB Output is correct
2 Correct 16 ms 8664 KB Output is correct
3 Correct 17 ms 8616 KB Output is correct
4 Correct 15 ms 8540 KB Output is correct
5 Correct 24 ms 8540 KB Output is correct
6 Correct 15 ms 8412 KB Output is correct
7 Correct 15 ms 8668 KB Output is correct
8 Correct 22 ms 8540 KB Output is correct
9 Correct 22 ms 8540 KB Output is correct
10 Correct 15 ms 8556 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 17748 KB Output is correct
2 Correct 148 ms 17488 KB Output is correct
3 Correct 144 ms 17604 KB Output is correct
4 Correct 148 ms 17716 KB Output is correct
5 Correct 139 ms 17808 KB Output is correct
6 Correct 144 ms 17684 KB Output is correct
7 Correct 150 ms 17912 KB Output is correct
8 Correct 150 ms 17744 KB Output is correct
9 Correct 150 ms 17968 KB Output is correct
10 Correct 173 ms 17744 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Incorrect 1 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 8532 KB Output is correct
2 Correct 21 ms 8572 KB Output is correct
3 Correct 22 ms 8652 KB Output is correct
4 Correct 22 ms 8424 KB Output is correct
5 Correct 22 ms 8536 KB Output is correct
6 Correct 30 ms 8528 KB Output is correct
7 Correct 21 ms 8532 KB Output is correct
8 Correct 22 ms 8532 KB Output is correct
9 Correct 22 ms 8536 KB Output is correct
10 Correct 24 ms 8492 KB Output is correct
11 Correct 16 ms 8536 KB Output is correct
12 Correct 16 ms 8664 KB Output is correct
13 Correct 17 ms 8616 KB Output is correct
14 Correct 15 ms 8540 KB Output is correct
15 Correct 24 ms 8540 KB Output is correct
16 Correct 15 ms 8412 KB Output is correct
17 Correct 15 ms 8668 KB Output is correct
18 Correct 22 ms 8540 KB Output is correct
19 Correct 22 ms 8540 KB Output is correct
20 Correct 15 ms 8556 KB Output is correct
21 Correct 146 ms 17748 KB Output is correct
22 Correct 148 ms 17488 KB Output is correct
23 Correct 144 ms 17604 KB Output is correct
24 Correct 148 ms 17716 KB Output is correct
25 Correct 139 ms 17808 KB Output is correct
26 Correct 144 ms 17684 KB Output is correct
27 Correct 150 ms 17912 KB Output is correct
28 Correct 150 ms 17744 KB Output is correct
29 Correct 150 ms 17968 KB Output is correct
30 Correct 173 ms 17744 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Incorrect 1 ms 4444 KB Output isn't correct
33 Halted 0 ms 0 KB -