| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 538354 | fcw | Happiness (Balkan15_HAPPINESS) | C++17 | 401 ms | 16132 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;
using lint = long long;
multiset<lint>s[40];
lint sum[40];
void add(lint x, int b){
int p = 0;
while(1ll<<(p+1) <= x) p++;
if(b == 1) s[p].insert(x), sum[p] += x;
else s[p].erase(s[p].find(x)), sum[p] -= x;
}
bool ok(){
lint cnt = 0;
for(int i=0;i<40;i++){
if(s[i].empty()) continue;
lint x = *s[i].begin();
if(cnt + 1 < x) return 0;
if(s[i].size() > 1 && cnt + x + 1 < *next(s[i].begin())) return 0;
cnt += sum[i];
}
return 1;
}
bool init(int coinsCount, lint maxCoinSize, lint coins[]) {
for(int i=0;i<coinsCount;i++) add(coins[i], 1);
return ok();
}
bool is_happy(int event, int coinsCount, lint coins[]){
for(int i=0;i<coinsCount;i++){
if(event == -1) add(coins[i], -1);
else add(coins[i], 1);
}
return ok();
}
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... | ||||
