Submission #1208643

#	Time	Username	Problem	Language	Result	Execution time	Memory
1208643		phungmanager0	Happiness (Balkan15_HAPPINESS)	C++20	40 / 100	197 ms	10008 KiB

happiness

#include "happiness.h"
#include <bits/stdc++.h>
using namespace std;
multiset<long long> s[40];
long long sum[40];
void update(int x, bool del) {
    int k = 63 - __builtin_clzll(x);
    if(del) {
        auto it = s[k].find(x);
        if(it != s[k].end()) {
            s[k].erase(it);
            sum[k] -= x;
        }
    } else {
        s[k].insert(x);
        sum[k] += x;
    }
}
bool get() {
    long long tmp = 0;
    for(int i = 0; i < 40; i++) {
        if(s[i].size()) {
            auto it = s[i].begin();
            if(*it <= tmp + 1) {
                if(s[i].size() > 1) {
                    auto nextValue = next(it);
                    if(tmp + *it + 1 < *nextValue) return 0;
                    else tmp += sum[i]; 
                } else tmp += sum[i];
            } else return false;
        }
    }
    return true;
}
bool is_happy(int event, int coinsCount, long long coins[]) {
    for(int i = 0; i < coinsCount; i++) {
        if(event == -1) update(coins[i], true);
        else update(coins[i], false);
    }
    return get();
}

bool init(int coinsCount, long long maxCoinSize, long long coins[]) {
    for(int i = 0; i < coinsCount; i++) update(coins[i], false);
    return get();
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 30 / 30
• Subtask 4: 0 / 40