oj.uz

Submission #809841

# Submission time Handle Problem Language Result Execution time Memory
809841 2023-08-06T03:47:49 Z fanwen Bank (IZhO14_bank) C++17
100 / 100
 104 ms 8516 KB 
#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }

template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

int N, M, a[20], b[20], rem[MASK(20)], dp[MASK(20)];

void you_make_it(void) {
    cin >> N >> M;
    REP(i, N) cin >> a[i];
    REP(i, M) cin >> b[i];
    memset(dp, -1, sizeof dp);
    dp[0] = 0;
    REP(mask, MASK(M)) REP(i, M) if(BIT(mask, i)) {
        if(dp[mask ^ MASK(i)] == -1) continue;
        int cur = a[dp[mask ^ MASK(i)]], r = rem[mask ^ MASK(i)];
        if(r + b[i] < cur) {
            dp[mask] = dp[mask ^ MASK(i)];
            rem[mask] = r + b[i];
        } else if(r + b[i] == cur) {
            dp[mask] = dp[mask ^ MASK(i)] + 1;
            rem[mask] = 0;
        }
        if(dp[mask] == N) return void(cout << "YES");
    }
    cout << "NO";
}

signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
  	file("bank");
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:13:57: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:47:4: note: in expansion of macro 'file'
   47 |    file("bank");
      |    ^~~~
bank.cpp:13:90: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:47:4: note: in expansion of macro 'file'
   47 |    file("bank");
      |    ^~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4484 KB Output is correct
2 Correct 3 ms 4420 KB Output is correct
3 Correct 2 ms 4340 KB Output is correct
4 Correct 2 ms 4424 KB Output is correct
5 Correct 72 ms 4440 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4436 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 82 ms 8384 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4420 KB Output is correct
3 Correct 2 ms 4436 KB Output is correct
4 Correct 2 ms 4436 KB Output is correct
5 Correct 2 ms 4436 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4436 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 2 ms 4368 KB Output is correct
10 Correct 3 ms 4320 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4436 KB Output is correct
2 Correct 3 ms 4428 KB Output is correct
3 Correct 3 ms 4436 KB Output is correct
4 Correct 4 ms 4436 KB Output is correct
5 Correct 3 ms 4420 KB Output is correct
6 Correct 3 ms 4436 KB Output is correct
7 Correct 4 ms 4436 KB Output is correct
8 Correct 2 ms 4480 KB Output is correct
9 Correct 3 ms 4436 KB Output is correct
10 Correct 3 ms 4436 KB Output is correct
11 Correct 3 ms 4436 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4484 KB Output is correct
2 Correct 3 ms 4420 KB Output is correct
3 Correct 2 ms 4340 KB Output is correct
4 Correct 2 ms 4424 KB Output is correct
5 Correct 72 ms 4440 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4436 KB Output is correct
8 Correct 2 ms 4436 KB Output is correct
9 Correct 82 ms 8384 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Correct 2 ms 4420 KB Output is correct
12 Correct 2 ms 4436 KB Output is correct
13 Correct 2 ms 4436 KB Output is correct
14 Correct 2 ms 4436 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4436 KB Output is correct
17 Correct 2 ms 4436 KB Output is correct
18 Correct 2 ms 4368 KB Output is correct
19 Correct 3 ms 4320 KB Output is correct
20 Correct 3 ms 4436 KB Output is correct
21 Correct 3 ms 4428 KB Output is correct
22 Correct 3 ms 4436 KB Output is correct
23 Correct 4 ms 4436 KB Output is correct
24 Correct 3 ms 4420 KB Output is correct
25 Correct 3 ms 4436 KB Output is correct
26 Correct 4 ms 4436 KB Output is correct
27 Correct 2 ms 4480 KB Output is correct
28 Correct 3 ms 4436 KB Output is correct
29 Correct 3 ms 4436 KB Output is correct
30 Correct 3 ms 4436 KB Output is correct
31 Correct 88 ms 8480 KB Output is correct
32 Correct 90 ms 8408 KB Output is correct
33 Correct 78 ms 8444 KB Output is correct
34 Correct 77 ms 5480 KB Output is correct
35 Correct 77 ms 5572 KB Output is correct
36 Correct 69 ms 4612 KB Output is correct
37 Correct 68 ms 4744 KB Output is correct
38 Correct 72 ms 4412 KB Output is correct
39 Correct 3 ms 4436 KB Output is correct
40 Correct 76 ms 4504 KB Output is correct
41 Correct 68 ms 4552 KB Output is correct
42 Correct 104 ms 8492 KB Output is correct
43 Correct 70 ms 6848 KB Output is correct
44 Correct 76 ms 4436 KB Output is correct
45 Correct 2 ms 4436 KB Output is correct
46 Correct 85 ms 8488 KB Output is correct
47 Correct 69 ms 4644 KB Output is correct
48 Correct 2 ms 4436 KB Output is correct
49 Correct 72 ms 4616 KB Output is correct
50 Correct 98 ms 8440 KB Output is correct
51 Correct 80 ms 4704 KB Output is correct
52 Correct 73 ms 8516 KB Output is correct
53 Correct 95 ms 8468 KB Output is correct
54 Correct 90 ms 8392 KB Output is correct
55 Correct 84 ms 8444 KB Output is correct
56 Correct 84 ms 8428 KB Output is correct
57 Correct 87 ms 8508 KB Output is correct
58 Correct 86 ms 8476 KB Output is correct