Submission #1145441

#TimeUsernameProblemLanguageResultExecution timeMemory
1145441Trisanu_DasHappiness (Balkan15_HAPPINESS)C++20
10 / 100
2094 ms6212 KiB
#include <bits/stdc++.h>
#include "happiness.h"
using namespace std;
#define ll long long

int n;
ll m;
multiset<ll> s;

bool check(){
    if(s.empty()) return true;
    vector<int> a(s.begin(), s.end());
    n = a.size();
    if(a[0] != 1) return false;
    int sum = 1;
    bool flag = true;
    for(int i = 0; i < n - 1; i++){
        sum += a[i];
        if(sum >= a[i + 1]) continue;
        flag = false; break;
    }
    return flag;
}

bool init(int N, ll M, ll notes[]){
    n = N; m = M;
    for(int i = 0; i < n; i++) s.insert(notes[i]);
    return check();
}

bool is_happy(int event, int n_, ll notes[]){
    if(event == -1)
        for(int i = 0; i < n_; i++) s.erase(s.find(notes[i]));
    else
        for(int i = 0; i < n_; i++) s.insert(notes[i]);

    return check();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...