| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 682237 | MilosMilutinovic | Happiness (Balkan15_HAPPINESS) | C++14 | 2052 ms | 13984 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "happiness.h"
#include <bits/stdc++.h>
using namespace std;
multiset<long long> c;
bool Process(multiset<long long> st) {
  vector<long long> v;
  for (auto x : st) {
    v.push_back(x);
  }
  vector<long long> pref(1, 1);
  for (auto x : st) {
    pref.push_back(pref.back() + x);
  }
  for (int i = 0; i < (int) v.size(); i++) {
    if (pref[i] < v[i]) {
      return false;
    }
  }
  return true;
}
bool init(int coinsCount, long long maxCoinSize, long long coins[]) {
  for (int i = 0; i < coinsCount; i++) {
    c.insert(coins[i]);
  }
  return Process(c);
}
bool is_happy(int event, int coinsCount, long long coins[]) {
  if (event == -1) {
    for (int i = 0; i < coinsCount; i++) {
      c.erase(c.find(coins[i]));
    }
  } else {
    for (int i = 0; i < coinsCount; i++) {
      c.insert(coins[i]);
    }
  }
  return Process(c);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
