답안 #751921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751921 2023-06-01T20:08:01 Z benjaminkleyn 은행 (IZhO14_bank) C++17
100 / 100
179 ms 8544 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int uint;

int n, m, a[20], b[20];
pair<int, int> dp[1 << 20];
// dp[mask] = {number of people paid with these notes, auxiliary coins left over}.

int main()
{
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> m;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i < m; i++)
        cin >> b[i];

    dp[0] = {0, 0};
    for (uint mask = 1; mask < (1 << m); mask++)
    {
        dp[mask] = {0, 0};
        for (int i = 0; i < m; i++)
            if (mask & (1 << i))
                dp[mask].second += b[i];

        for (int i = 0; i < m; i++)
            if (mask & (1 << i))
            {
                auto [num, aux] = dp[mask ^ (1 << i)];
                dp[mask] = max(dp[mask], make_pair(num + (aux + b[i] == a[num]), (aux + b[i]) * (aux + b[i] != a[num])));
            }

        if (dp[mask].first == n)
            return cout << "YES\n", 0;
    }
    cout << "NO\n";

    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:21:30: warning: comparison of integer expressions of different signedness: 'uint' {aka 'unsigned int'} and 'int' [-Wsign-compare]
   21 |     for (uint mask = 1; mask < (1 << m); mask++)
      |                         ~~~~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 134 ms 8544 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 130 ms 8504 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 3 ms 424 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 134 ms 8544 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 130 ms 8504 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 3 ms 424 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 171 ms 8472 KB Output is correct
32 Correct 151 ms 8396 KB Output is correct
33 Correct 158 ms 8436 KB Output is correct
34 Correct 140 ms 8488 KB Output is correct
35 Correct 147 ms 8396 KB Output is correct
36 Correct 142 ms 8392 KB Output is correct
37 Correct 143 ms 8412 KB Output is correct
38 Correct 141 ms 8396 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 138 ms 8468 KB Output is correct
41 Correct 131 ms 8396 KB Output is correct
42 Correct 167 ms 8396 KB Output is correct
43 Correct 144 ms 8480 KB Output is correct
44 Correct 134 ms 8496 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 179 ms 8520 KB Output is correct
47 Correct 156 ms 8428 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 136 ms 8420 KB Output is correct
50 Correct 138 ms 8400 KB Output is correct
51 Correct 138 ms 8396 KB Output is correct
52 Correct 137 ms 8424 KB Output is correct
53 Correct 146 ms 8436 KB Output is correct
54 Correct 137 ms 8396 KB Output is correct
55 Correct 134 ms 8476 KB Output is correct
56 Correct 161 ms 8452 KB Output is correct
57 Correct 137 ms 8508 KB Output is correct
58 Correct 133 ms 8396 KB Output is correct