oj.uz

Submission #998302

# Submission time Handle Problem Language Result Execution time Memory
998302 2024-06-13T14:51:26 Z LOLOLO Feast (NOI19_feast) C++17
30 / 100
 164 ms 20544 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 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];
    val[a] += val[b];
    p[b] = a;
    l[a] = min(l[a], l[b]);
    r[a] = max(r[a], r[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)]), i});
 
    int ss = 1;
    while (sz(st) > k * 2) {
        auto it = *st.begin();
        st.erase(it);
        int p = it.s;
 
        if (l[p] > ss) {
            int x = get(l[p] - 1);
            st.erase({abs(val[x]), x});
            unite(p, x);
        }
 
        if (r[p] < n) {
            int x = get(r[p] + 1);
            st.erase({abs(val[x]), x});
            unite(p, x);
        }
 
        p = get(p);
        st.insert({abs(val[p]), p});
 
        while (val[get(n)] < 0) {
            st.erase({abs(val[get(n)]), get(n)});
            n = l[get(n)] - 1;
        }
 
        while (val[get(ss)] < 0) {
            st.erase({abs(val[get(ss)]), get(ss)});
            ss = r[get(ss)] + 1;
        }
    }
 
    ll ans = 0;
    for (auto x : st)
        ans += max((ll)0, val[x.s]);

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

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 10844 KB Output is correct
2 Correct 24 ms 11140 KB Output is correct
3 Correct 23 ms 11088 KB Output is correct
4 Correct 24 ms 11072 KB Output is correct
5 Correct 24 ms 10992 KB Output is correct
6 Correct 23 ms 10836 KB Output is correct
7 Correct 29 ms 10800 KB Output is correct
8 Correct 24 ms 11088 KB Output is correct
9 Correct 33 ms 10836 KB Output is correct
10 Correct 23 ms 11152 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 9564 KB Output is correct
2 Correct 16 ms 9564 KB Output is correct
3 Correct 16 ms 9560 KB Output is correct
4 Correct 16 ms 9564 KB Output is correct
5 Correct 23 ms 10808 KB Output is correct
6 Correct 16 ms 9560 KB Output is correct
7 Correct 16 ms 9564 KB Output is correct
8 Correct 25 ms 11088 KB Output is correct
9 Correct 23 ms 10836 KB Output is correct
10 Correct 17 ms 9564 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 20320 KB Output is correct
2 Correct 142 ms 20052 KB Output is correct
3 Correct 142 ms 20308 KB Output is correct
4 Correct 134 ms 20232 KB Output is correct
5 Correct 147 ms 20368 KB Output is correct
6 Correct 145 ms 20316 KB Output is correct
7 Correct 164 ms 20360 KB Output is correct
8 Correct 139 ms 20308 KB Output is correct
9 Correct 149 ms 20424 KB Output is correct
10 Correct 149 ms 20544 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 1 ms 4440 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 4440 KB Output is correct
2 Incorrect 1 ms 4440 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 4440 KB Output is correct
2 Incorrect 1 ms 4440 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 10844 KB Output is correct
2 Correct 24 ms 11140 KB Output is correct
3 Correct 23 ms 11088 KB Output is correct
4 Correct 24 ms 11072 KB Output is correct
5 Correct 24 ms 10992 KB Output is correct
6 Correct 23 ms 10836 KB Output is correct
7 Correct 29 ms 10800 KB Output is correct
8 Correct 24 ms 11088 KB Output is correct
9 Correct 33 ms 10836 KB Output is correct
10 Correct 23 ms 11152 KB Output is correct
11 Correct 16 ms 9564 KB Output is correct
12 Correct 16 ms 9564 KB Output is correct
13 Correct 16 ms 9560 KB Output is correct
14 Correct 16 ms 9564 KB Output is correct
15 Correct 23 ms 10808 KB Output is correct
16 Correct 16 ms 9560 KB Output is correct
17 Correct 16 ms 9564 KB Output is correct
18 Correct 25 ms 11088 KB Output is correct
19 Correct 23 ms 10836 KB Output is correct
20 Correct 17 ms 9564 KB Output is correct
21 Correct 144 ms 20320 KB Output is correct
22 Correct 142 ms 20052 KB Output is correct
23 Correct 142 ms 20308 KB Output is correct
24 Correct 134 ms 20232 KB Output is correct
25 Correct 147 ms 20368 KB Output is correct
26 Correct 145 ms 20316 KB Output is correct
27 Correct 164 ms 20360 KB Output is correct
28 Correct 139 ms 20308 KB Output is correct
29 Correct 149 ms 20424 KB Output is correct
30 Correct 149 ms 20544 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Incorrect 1 ms 4440 KB Output isn't correct
33 Halted 0 ms 0 KB -