oj.uz

Submission #889159

# Submission time Handle Problem Language Result Execution time Memory
889159 2023-12-19T04:00:08 Z dimashhh Feast (NOI19_feast) C++17
30 / 100
 296 ms 29564 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 1, MOD = 998244353;
typedef long long ll;
#define int long long
int n, k, a[N],p[N];
bool ok[N];
vector<ll> b, sum(N);
set<int> pos;
set<pair<ll,ll>> st;
ll res = 0,col = 0;
void del(int i){
    if(i >= 0 && i < n){
        st.erase({abs(sum[i]),i});
        pos.erase(i);
        ok[i] = 1;
        if(sum[i] >= 0){
            res -= sum[i];
            col--;
        }
    }
}
void test()
{
    cin >> n >> k;
    ll lst = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        ok[i] = (a[i] >= 0);
    }
    ll cur = 0;
    ok[0] = 1;
    for (int i = 1; i <= n; i++)
    {
        if (ok[i] == ok[i - 1])
        {
            cur += a[i];
        }
        else
        {
            if(b.empty() && cur < 0){
            }
            else b.push_back(cur);
            cur = a[i];
        }
    }
    if(cur >= 0) b.push_back(cur);
    n = (int)b.size();
    for(int i = 0;i < n;i++){
        p[i] = i;
        sum[i] = b[i];
        if(b[i] >= 0){
            col++;
            res += b[i];
        }
        pos.insert(i);
        st.insert({abs(b[i]),i});
    }
    int it = 0;
    while(col > k){
        auto [x,y] = (*st.begin());
        st.erase({x,y});
        // cout << x << ' ' << y << ' ' << res << ' ' << col << '\n';
        auto it = pos.upper_bound(y);
        ll nv = sum[y];
        del(y);
        if(it != pos.end()){
            nv += sum[*it];
            del(*it);
        }
        auto it1 = pos.lower_bound(y);
        if(it1 != pos.begin()){
            it1--;
            nv += sum[*it1];
            del(*it1);
        }
        sum[y] = nv;
        if(sum[y] >= 0){
            pos.insert(y);
            st.insert({abs(sum[y]),y});
            col++;
            res += sum[y];
        }else{
            if(!pos.empty() && *pos.begin() < y){
                pos.insert(y);
                st.insert({abs(sum[y]),y});               
            }
        }
    }
    cout << res;
}
main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1; // cin >> T;
    while (T--)
        test();
}

Compilation message

feast.cpp: In function 'void test()':
feast.cpp:26:8: warning: unused variable 'lst' [-Wunused-variable]
   26 |     ll lst = 0;
      |        ^~~
feast.cpp:60:9: warning: unused variable 'it' [-Wunused-variable]
   60 |     int it = 0;
      |         ^~
feast.cpp: At global scope:
feast.cpp:93:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   93 | main()
      | ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 9044 KB Output is correct
2 Correct 27 ms 9052 KB Output is correct
3 Correct 24 ms 9044 KB Output is correct
4 Correct 24 ms 9040 KB Output is correct
5 Correct 24 ms 8912 KB Output is correct
6 Correct 23 ms 8796 KB Output is correct
7 Correct 24 ms 8796 KB Output is correct
8 Correct 24 ms 8796 KB Output is correct
9 Correct 23 ms 8904 KB Output is correct
10 Correct 27 ms 9316 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 8796 KB Output is correct
2 Correct 16 ms 9052 KB Output is correct
3 Correct 16 ms 8924 KB Output is correct
4 Correct 15 ms 8944 KB Output is correct
5 Correct 23 ms 8796 KB Output is correct
6 Correct 16 ms 8944 KB Output is correct
7 Correct 15 ms 9048 KB Output is correct
8 Correct 24 ms 9052 KB Output is correct
9 Correct 23 ms 8908 KB Output is correct
10 Correct 19 ms 9052 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 26280 KB Output is correct
2 Correct 262 ms 28868 KB Output is correct
3 Correct 267 ms 29468 KB Output is correct
4 Correct 262 ms 28988 KB Output is correct
5 Correct 276 ms 29076 KB Output is correct
6 Correct 257 ms 29356 KB Output is correct
7 Correct 259 ms 29268 KB Output is correct
8 Correct 263 ms 29304 KB Output is correct
9 Correct 257 ms 29564 KB Output is correct
10 Correct 296 ms 29404 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8484 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Incorrect 2 ms 8280 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8484 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Incorrect 2 ms 8280 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8284 KB Output is correct
4 Correct 2 ms 8484 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Incorrect 2 ms 8280 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 9044 KB Output is correct
2 Correct 27 ms 9052 KB Output is correct
3 Correct 24 ms 9044 KB Output is correct
4 Correct 24 ms 9040 KB Output is correct
5 Correct 24 ms 8912 KB Output is correct
6 Correct 23 ms 8796 KB Output is correct
7 Correct 24 ms 8796 KB Output is correct
8 Correct 24 ms 8796 KB Output is correct
9 Correct 23 ms 8904 KB Output is correct
10 Correct 27 ms 9316 KB Output is correct
11 Correct 15 ms 8796 KB Output is correct
12 Correct 16 ms 9052 KB Output is correct
13 Correct 16 ms 8924 KB Output is correct
14 Correct 15 ms 8944 KB Output is correct
15 Correct 23 ms 8796 KB Output is correct
16 Correct 16 ms 8944 KB Output is correct
17 Correct 15 ms 9048 KB Output is correct
18 Correct 24 ms 9052 KB Output is correct
19 Correct 23 ms 8908 KB Output is correct
20 Correct 19 ms 9052 KB Output is correct
21 Correct 257 ms 26280 KB Output is correct
22 Correct 262 ms 28868 KB Output is correct
23 Correct 267 ms 29468 KB Output is correct
24 Correct 262 ms 28988 KB Output is correct
25 Correct 276 ms 29076 KB Output is correct
26 Correct 257 ms 29356 KB Output is correct
27 Correct 259 ms 29268 KB Output is correct
28 Correct 263 ms 29304 KB Output is correct
29 Correct 257 ms 29564 KB Output is correct
30 Correct 296 ms 29404 KB Output is correct
31 Correct 2 ms 8284 KB Output is correct
32 Correct 2 ms 8284 KB Output is correct
33 Correct 2 ms 8284 KB Output is correct
34 Correct 2 ms 8484 KB Output is correct
35 Correct 2 ms 8284 KB Output is correct
36 Correct 2 ms 8536 KB Output is correct
37 Correct 2 ms 8284 KB Output is correct
38 Incorrect 2 ms 8280 KB Output isn't correct
39 Halted 0 ms 0 KB -