답안 #887027

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887027	2023-12-13T13:45:14 Z	a_l_i_r_e_z_a	은행 (IZhO14_bank)	C++17	100 / 100	85 ms	8668 KB

bank

// In the name of Allah
// Khodaya khodet komak kon
// Hope is last to die
// Let's go
// Hello today I decided to solve at least 4 great problems per day
// 2023/11/24

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define set_dec(x) cout << fixed << setprecision(x);
#define sz(x) ((int)(x).size())
#define file_io freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

const int maxn = 20 + 5, maxB = (1ll << 20);
const int inf = 1e9 + 7;
int a[maxn], b[maxn];
pii dp[maxB];

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m; cin >> n >> m;
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];
    for(int mask = 0; mask < (1ll << m); mask++) dp[mask].F = -1;
    dp[0].F = 0;
    for(int mask = 0; mask < (1ll << m); mask++){
        if(dp[mask].F == -1) continue;
        if(dp[mask].F == n && dp[mask].S == 0){
            cout << "YES\n";
            return 0;
        }
        for(int i = 0; i < m; i++){
            if((1ll << i) & mask) continue;
            if(dp[mask].S + b[i] > a[dp[mask].F]) continue;
            else if(dp[mask].S + b[i] == a[dp[mask].F]){
                dp[mask | (1ll << i)] = mp(dp[mask].F + 1, 0);
            }
            else{
                dp[mask | (1ll << i)] = mp(dp[mask].F, dp[mask].S + b[i]);
            }
        }
    }
    cout << "NO\n";

    return 0;
}

Subtask #1
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 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	2652 KB	Output is correct
5	Correct	3 ms	8540 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	2 ms	8540 KB	Output is correct
9	Correct	71 ms	8540 KB	Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 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	2652 KB	Output is correct
5	Correct	3 ms	8540 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	2 ms	8540 KB	Output is correct
9	Correct	71 ms	8540 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	432 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	61 ms	8540 KB	Output is correct
32	Correct	74 ms	8540 KB	Output is correct
33	Correct	8 ms	8664 KB	Output is correct
34	Correct	3 ms	8648 KB	Output is correct
35	Correct	3 ms	8668 KB	Output is correct
36	Correct	3 ms	8540 KB	Output is correct
37	Correct	3 ms	8540 KB	Output is correct
38	Correct	3 ms	8540 KB	Output is correct
39	Correct	2 ms	8540 KB	Output is correct
40	Correct	3 ms	8656 KB	Output is correct
41	Correct	3 ms	8540 KB	Output is correct
42	Correct	47 ms	8540 KB	Output is correct
43	Correct	4 ms	8540 KB	Output is correct
44	Correct	3 ms	8540 KB	Output is correct
45	Correct	3 ms	8540 KB	Output is correct
46	Correct	20 ms	8664 KB	Output is correct
47	Correct	3 ms	8540 KB	Output is correct
48	Correct	2 ms	8540 KB	Output is correct
49	Correct	3 ms	8540 KB	Output is correct
50	Correct	74 ms	8644 KB	Output is correct
51	Correct	4 ms	8540 KB	Output is correct
52	Correct	6 ms	8540 KB	Output is correct
53	Correct	85 ms	8636 KB	Output is correct
54	Correct	74 ms	8540 KB	Output is correct
55	Correct	71 ms	8540 KB	Output is correct
56	Correct	75 ms	8536 KB	Output is correct
57	Correct	76 ms	8540 KB	Output is correct
58	Correct	79 ms	8540 KB	Output is correct

답안 #887027

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 29.0 / 29.0

Subtask #1
19.0 / 19.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
29.0 / 29.0