# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526884 | peuch | Happiness (Balkan15_HAPPINESS) | C++17 | 987 ms | 56420 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;
long long m, sum;
vector<long long> seg, lzy, e, d;
bool init(int coinsCount, long long maxCoinSize, long long coins[]);
bool is_happy(int event, int coinsCount, long long coins[]);
int create(long long fim);
void refresh(int pos, long long ini, long long fim);
void update(int pos, long long ini, long long fim, long long p, long long q, long long val);
int query(int pos, long long ini, long long fim, long long p, long long q);
bool init(int coinsCount, long long maxCoinSize, long long coins[]) {
m = maxCoinSize;
create(m);
create(m);
return is_happy(1, coinsCount, coins);;
}
bool is_happy(int event, int coinsCount, long long coins[]) {
for(int i = 0; i < coinsCount; i++){
sum += event * coins[i];
update(1, 1, m, coins[i], m, event * coins[i]);
}
return query(1, 1, m, 1, sum) >= 0;
}
int create(long long fim){
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... |