# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
275314 | 2020-08-20T05:22:50 Z | 임성재(#5103) | Happiness (Balkan15_HAPPINESS) | C++17 | 2000 ms | 7032 KB |
#include "happiness.h" #include<bits/stdc++.h> using namespace std; #define fast ios::sync_with_stdio(false); cin.tie(0); #define fi first #define se second #define em emplace #define eb emplace_back #define all(v) (v).begin(), (v).end() #define mp make_pair typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const int inf = 1e9; const ll INF = 1e18; ll n, m; map<ll,ll> cnt; bool init(int coinsCount, long long maxCoinSize, long long coins[]) { n = coinsCount; m = maxCoinSize; for(int i=0; i<n; i++) { cnt[coins[i]]++; } ll sum = 0; for(auto i : cnt) { if(sum + 1 < i.fi) return false; sum += i.fi * i.se; } return true; } bool is_happy(int event, int coinsCount, long long coins[]) { n = coinsCount; for(int i=0; i<n; i++) { cnt[coins[i]] += event; } ll sum = 0; for(auto i : cnt) { if(i.se && sum + 1 < i.fi) return false; sum += i.fi * i.se; } return true; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 256 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 256 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 2 ms | 384 KB | Output is correct |
7 | Correct | 2 ms | 384 KB | Output is correct |
8 | Correct | 211 ms | 1024 KB | Output is correct |
9 | Correct | 208 ms | 1024 KB | Output is correct |
10 | Correct | 194 ms | 1088 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 256 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Execution timed out | 2093 ms | 7032 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 256 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 2 ms | 384 KB | Output is correct |
7 | Correct | 2 ms | 384 KB | Output is correct |
8 | Correct | 211 ms | 1024 KB | Output is correct |
9 | Correct | 208 ms | 1024 KB | Output is correct |
10 | Correct | 194 ms | 1088 KB | Output is correct |
11 | Execution timed out | 2093 ms | 7032 KB | Time limit exceeded |
12 | Halted | 0 ms | 0 KB | - |