oj.uz

답안 #1019699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019699 2024-07-11T07:42:36 Z NoLove Happiness (Balkan15_HAPPINESS) C++14
30 / 100
 2000 ms 6736 KB 
/**
 *    author : Lăng Trọng Đạt
 *    created: 11-07-2024 
**/
#include <bits/stdc++.h>
#include "happiness.h"
using namespace std;
#ifndef LANG_DAT
#define db(...) ;
#endif // LANG_DAT
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
using pii = pair<int, int>;
using vi = vector<int>;
#define FOR(i, a, b) for (int (i) = a; (i) <= (b); i++)
void mx(int& a, int b) { if (b > a) a = b; }
void mi(int& a, int b) { if (b < a) a = b; }
#define si(x) (int)(x.size())
const int INF = 1e18;
const int MOD = 1e9 + 7;


multiset<long long> vals;
bool check() {
    if (si(vals) <= 1) return true;
    db(vals)
    long long s = 1;
    for (long long i : vals) {
        if (s < i) return false;
        s += i;
    }
	return *vals.begin() == 1;
}
bool init(int coinsCount, long long maxCoinSize, long long coins[]) {
    FOR(i, 0, coinsCount - 1)
        vals.insert(coins[i]);
	return check();
}
bool is_happy(int event, int coinsCount, long long coins[]) {
    db(vals)
    FOR(i, 0, coinsCount - 1)
        if (event == 1)
            vals.insert(coins[i]);
        else vals.erase(vals.find(coins[i]));
    return check();
}

Compilation message

happiness.cpp:22:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   22 | const int INF = 1e18;
      |                 ^~~~
happiness.cpp: In function 'bool init(int, long long int, long long int*)':
happiness.cpp:18:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   18 | #define FOR(i, a, b) for (int (i) = a; (i) <= (b); i++)
      |                               ^
happiness.cpp:38:5: note: in expansion of macro 'FOR'
   38 |     FOR(i, 0, coinsCount - 1)
      |     ^~~
happiness.cpp:18:22: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   18 | #define FOR(i, a, b) for (int (i) = a; (i) <= (b); i++)
      |                      ^~~
happiness.cpp:38:5: note: in expansion of macro 'FOR'
   38 |     FOR(i, 0, coinsCount - 1)
      |     ^~~
happiness.cpp:40:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   40 |  return check();
      |  ^~~~~~
happiness.cpp: In function 'bool is_happy(int, int, long long int*)':
happiness.cpp:18:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   18 | #define FOR(i, a, b) for (int (i) = a; (i) <= (b); i++)
      |                               ^
happiness.cpp:44:5: note: in expansion of macro 'FOR'
   44 |     FOR(i, 0, coinsCount - 1)
      |     ^~~
grader.cpp: In function 'int main()':
grader.cpp:16:12: warning: unused variable 'max_code' [-Wunused-variable]
   16 |  long long max_code;
      |            ^~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 81 ms 1116 KB Output is correct
9 Correct 75 ms 1116 KB Output is correct
10 Correct 84 ms 1116 KB Output is correct

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Execution timed out 2029 ms 6736 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 81 ms 1116 KB Output is correct
9 Correct 75 ms 1116 KB Output is correct
10 Correct 84 ms 1116 KB Output is correct
11 Execution timed out 2029 ms 6736 KB Time limit exceeded
12 Halted 0 ms 0 KB -