oj.uz

답안 #659856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
659856 2022-11-19T14:21:43 Z meiron03 은행 (IZhO14_bank) C++17
100 / 100
 215 ms 12600 KB 
#include <bits/stdc++.h>
using namespace std;
 
 
typedef pair<int,int> point;
#define Rd(r) freopen(r, "r", stdin);
#define Wt(w) freopen(w, "w", stdout);
#define x first
#define y second
#define INF 1<<30
#define MAXI 20
vector<int> MASK[MAXI];
int dp[1 << MAXI], rem[1 << MAXI], mark[1 << MAXI], y;
bool flag = false;
 
bool ZiwenZapper(int n, int m, int a[], int b[]) {
  y = 0;
	mark[0] = 1;
	for(int mask = 0; mask < (1 << m); mask++){
		for(int	i = 0; i < m; i++){
			if(mark[mask ^ (1 << i)] and (mask & (1 << i))){
				int last = dp[mask ^ (1 << i)];
				int curr = rem[mask ^ (1 << i)] + b[i];
				if(curr > a[last]) continue;
				dp[mask] = last + (curr == a[last] ? 1 : 0);
				rem[mask] = (curr == a[last] ? 0 : curr);
				mark[mask] = 1;
			}
		}
		if(dp[mask] == n) y = 1;
	}
	return y ? true : false;
 
}
 
int main()
{
    //Rd("ziwenzapper.in");
    int n, m;
    int a[MAXI], b[MAXI];

	cin >> m >> n;
	for (int i = 0; i < m; i++) cin >> b[i];
	for (int j = 0; j < n; j++) cin >> a[j];
	bool val = ZiwenZapper(m, n, b, a);
	cout << (val ? "YES" : "NO") << "\n";

    return 0;
 
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 696 KB Output is correct
5 Correct 36 ms 376 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 108 ms 12496 KB Output is correct
9 Correct 188 ms 12568 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 696 KB Output is correct
5 Correct 36 ms 376 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 108 ms 12496 KB Output is correct
9 Correct 188 ms 12568 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 304 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 440 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 163 ms 12564 KB Output is correct
32 Correct 205 ms 12540 KB Output is correct
33 Correct 59 ms 12412 KB Output is correct
34 Correct 38 ms 3472 KB Output is correct
35 Correct 36 ms 3712 KB Output is correct
36 Correct 34 ms 924 KB Output is correct
37 Correct 34 ms 1312 KB Output is correct
38 Correct 34 ms 344 KB Output is correct
39 Correct 101 ms 12500 KB Output is correct
40 Correct 40 ms 588 KB Output is correct
41 Correct 44 ms 820 KB Output is correct
42 Correct 121 ms 12600 KB Output is correct
43 Correct 45 ms 7620 KB Output is correct
44 Correct 38 ms 396 KB Output is correct
45 Correct 124 ms 12508 KB Output is correct
46 Correct 75 ms 12492 KB Output is correct
47 Correct 38 ms 1020 KB Output is correct
48 Correct 74 ms 12136 KB Output is correct
49 Correct 36 ms 684 KB Output is correct
50 Correct 215 ms 12504 KB Output is correct
51 Correct 41 ms 1492 KB Output is correct
52 Correct 56 ms 12552 KB Output is correct
53 Correct 211 ms 12488 KB Output is correct
54 Correct 186 ms 12572 KB Output is correct
55 Correct 178 ms 12520 KB Output is correct
56 Correct 190 ms 12488 KB Output is correct
57 Correct 171 ms 12520 KB Output is correct
58 Correct 169 ms 12580 KB Output is correct