oj.uz

답안 #777091

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777091 2023-07-08T16:11:02 Z Halym2007 은행 (IZhO14_bank) C++11
100 / 100
 148 ms 1380 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define sz size()
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 21;
// const int mod = 1e9+7;
// ll bigmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}

void solve();
int n, m, a[N], b[N], p[N], sum;
bool dp[1 << N];
int main() {
	// ios::sync_with_stdio(false);
 	// cin.tie(0), cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    //  clock_t tStart = clock();
    // printf("Time taken: %.2fs\n", (double)(clock() - tStart)/CLOCKS_PER_SEC);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		p[i] = p[i - 1] + a[i];
	}    
	for (int i = 0; i < m; ++i) {
		cin >> b[i];
	}
	dp[0] = 1;
	for (int i = 0; i < (1 << m); ++i) {
		// cout << "1" << endl;
		sum = 0;
		for (int j = 0; j < m; ++j) {
			// cout << "2" << endl;
			if (i>>j&1) {
				sum += b[j];
			}
		}
		auto pos = lower_bound (p + 1, p + n + 1, sum) - p;
		if (pos == n + 1) {
			continue;
		}
		for (int j = 0; j < m; ++j) {
			// cout << "3" << endl;
			if ((i>>j&1) and (b[j] <= sum - p[pos - 1])) dp[i] |= dp[i ^ (1 << j)];
		}
		if ((p[n] == sum) and (dp[i])) {
			cout << "YES" << endl;
			return 0;
		}
	}
	cout << "NO" << endl;
}
/*
██╗░░██╗░█████╗░██╗░░░░░██╗░░░██╗███╗░░░███╗██████╗░░█████╗░░█████╗░███████╗
██║░░██║██╔══██╗██║░░░░░╚██╗░██╔╝████╗░████║╚════██╗██╔══██╗██╔══██╗╚════██║
███████║███████║██║░░░░░░╚████╔╝░██╔████╔██║░░███╔═╝██║░░██║██║░░██║░░░░██╔╝
██╔══██║██╔══██║██║░░░░░░░╚██╔╝░░██║╚██╔╝██║██╔══╝░░██║░░██║██║░░██║░░░██╔╝░
██║░░██║██║░░██║███████╗░░░██║░░░██║░╚═╝░██║███████╗╚█████╔╝╚█████╔╝░░██╔╝░░
╚═╝░░╚═╝╚═╝░░╚═╝╚══════╝░░░╚═╝░░░╚═╝░░░░░╚═╝╚══════╝░╚════╝░░╚════╝░░░╚═╝░░░
*/

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 64 ms 312 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 212 KB Output is correct
9 Correct 132 ms 1236 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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 304 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 64 ms 312 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 212 KB Output is correct
9 Correct 132 ms 1236 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 7 ms 304 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 2 ms 316 KB Output is correct
31 Correct 129 ms 1228 KB Output is correct
32 Correct 143 ms 1232 KB Output is correct
33 Correct 147 ms 1264 KB Output is correct
34 Correct 136 ms 1224 KB Output is correct
35 Correct 142 ms 1244 KB Output is correct
36 Correct 145 ms 1208 KB Output is correct
37 Correct 64 ms 508 KB Output is correct
38 Correct 67 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 105 ms 1228 KB Output is correct
41 Correct 145 ms 1380 KB Output is correct
42 Correct 140 ms 1288 KB Output is correct
43 Correct 143 ms 1276 KB Output is correct
44 Correct 140 ms 1236 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 148 ms 1336 KB Output is correct
47 Correct 138 ms 1228 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 65 ms 324 KB Output is correct
50 Correct 145 ms 1280 KB Output is correct
51 Correct 134 ms 1300 KB Output is correct
52 Correct 134 ms 1264 KB Output is correct
53 Correct 143 ms 1224 KB Output is correct
54 Correct 140 ms 1300 KB Output is correct
55 Correct 135 ms 1204 KB Output is correct
56 Correct 135 ms 1260 KB Output is correct
57 Correct 133 ms 1280 KB Output is correct
58 Correct 134 ms 1276 KB Output is correct