oj.uz

답안 #656411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
656411 2022-11-07T10:59:57 Z asiat 은행 (IZhO14_bank) C++14
100 / 100
 668 ms 81028 KB 
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int N = 21;
int dp[N][(1<<N)];
main(){
	cin.tie(0)->sync_with_stdio(0);
	int n; cin >> n;
	int m; cin >> m;
	vector <int> v(n), g(m);
	vector <int> can[n+1];
	for (int i = 0; i < n; i++)cin >> v[i];
	for (int i = 0; i < m; i++)cin >> g[i];
	for (int i = 1; i < (1<<m); i++){
		int sum = 0;
		vector <int> ans;
		int x = i;
		while(x > 0){
			ans.push_back(x&1);
			x>>=1;
		}
		while(ans.size() < m)ans.push_back(0);
		reverse(ans.begin(), ans.end());
		cout << endl;
		for (int j = 0; j < m; j++)
			if(ans[j] == 1)sum+=g[j];
		for (int j = 0; j < n; j++)
			if(sum == v[j])can[j].push_back(i);
	}
	if(n > m){
		cout << "NO";
		return 0;
	}
	for (auto to : can[0]){
		dp[0][to] = 1;
	}
	for (int i = 1; i < n; i++)
		for (int mask = 1; mask < (1<<m); mask++){
			if(!dp[i-1][mask])continue;
			for (auto to : can[i])
				if(!(mask & to))
					dp[i][mask|to] |= dp[i-1][mask];
		}
	for (int i = 0; i < (1<<m); i++){
		int to = dp[n-1][i];
		if(to){
			cout << "YES" << endl;
			return 0;
		}
	}
	cout << "NO" << endl;
	return 0;
}

Compilation message

bank.cpp:7:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    7 | main(){
      | ^~~~
bank.cpp: In function 'int main()':
bank.cpp:23:20: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   23 |   while(ans.size() < m)ans.push_back(0);
      |         ~~~~~~~~~~~^~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 300 ms 1412 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 286 ms 8520 KB Output is correct
9 Correct 287 ms 1348 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 9 ms 468 KB Output is correct
5 Correct 300 ms 1412 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 286 ms 8520 KB Output is correct
9 Correct 287 ms 1348 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 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 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 6 ms 324 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 5 ms 340 KB Output is correct
24 Correct 5 ms 332 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 319 ms 4780 KB Output is correct
32 Correct 353 ms 9232 KB Output is correct
33 Correct 330 ms 2672 KB Output is correct
34 Correct 309 ms 1704 KB Output is correct
35 Correct 307 ms 1664 KB Output is correct
36 Correct 332 ms 1744 KB Output is correct
37 Correct 293 ms 1412 KB Output is correct
38 Correct 288 ms 1472 KB Output is correct
39 Correct 335 ms 30268 KB Output is correct
40 Correct 293 ms 1564 KB Output is correct
41 Correct 354 ms 1680 KB Output is correct
42 Correct 295 ms 12596 KB Output is correct
43 Correct 296 ms 2252 KB Output is correct
44 Correct 315 ms 1692 KB Output is correct
45 Correct 303 ms 11772 KB Output is correct
46 Correct 303 ms 5068 KB Output is correct
47 Correct 325 ms 1764 KB Output is correct
48 Correct 283 ms 6632 KB Output is correct
49 Correct 324 ms 1336 KB Output is correct
50 Correct 428 ms 72520 KB Output is correct
51 Correct 343 ms 7936 KB Output is correct
52 Correct 302 ms 4524 KB Output is correct
53 Correct 668 ms 22488 KB Output is correct
54 Correct 478 ms 64432 KB Output is correct
55 Correct 439 ms 72432 KB Output is correct
56 Correct 426 ms 81028 KB Output is correct
57 Correct 435 ms 76116 KB Output is correct
58 Correct 434 ms 76196 KB Output is correct