Submission #962228

#	Time	Username	Problem	Language	Result	Execution time	Memory
962228		Whisper	Feast (NOI19_feast)	C++17	100 / 100	321 ms	25804 KiB

feast

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
const int MAX = 3e5 + 5;
int nArr, numSeg;
int a[MAX], val[MAX];
void Whisper(){
    cin >> nArr >> numSeg;
    for (int i = 1; i <= nArr; ++i) cin >> a[i];
    a[0] = a[nArr + 1] = -1e18;
    int cnt = 0;
    vector<int> comp;
    for (int i = 0; i <= nArr + 1; ){
        int sum = 0; int r = i;
        while(r <= nArr + 1 && (a[r] >= 0) == (a[i] >= 0)){
            sum += a[r];
            ++r;
        }
        comp.push_back(sum);
        if(sum >= 0){
            ++cnt;
        }
        i = r;
    }
    for (int i = 0; i < (int)comp.size(); ++i) val[i] = comp[i];
    set<pair<int, int>> s; set<int> pos;
    for (int i = 0; i < (int)comp.size(); ++i){
        pos.insert(i);
        s.insert(make_pair(abs(comp[i]), i));
    }
    for (int i = cnt; i > numSeg; --i){
        int v = (*s.begin()).first;
        int id = (*s.begin()).second;
        auto new_pos = pos.lower_bound(id);
        auto l = prev(new_pos), r = next(new_pos);

        s.erase(make_pair(abs(val[*l]), *l));
        s.erase(make_pair(abs(val[*r]), *r));
        s.erase(make_pair(abs(val[id]), id));

        val[id] += val[*l]; val[id] += val[*r];

        pos.erase(*l); pos.erase(*r);
        s.insert(make_pair(abs(val[id]), id));
    }
    int ans = 0;
    for (auto&v : pos){
        if(val[v] >= 0) ans += val[v];
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Compilation message (stderr)

feast.cpp: In function 'void Whisper()':
feast.cpp:71:13: warning: unused variable 'v' [-Wunused-variable]
   71 |         int v = (*s.begin()).first;
      |             ^

• Subtask 1: 4 / 4
• Subtask 2: 8 / 8
• Subtask 3: 18 / 18
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11
• Subtask 6: 20 / 20
• Subtask 7: 29 / 29