답안 #970563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970563 2024-04-26T17:39:13 Z starchan 은행 (IZhO14_bank) C++17
100 / 100
85 ms 9044 KB
#include<bits/stdc++.h>
using namespace std;
#define in array<int, 2>
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define MX (int)3e5+5
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)

const int SMX = 1e3+3;

int dp[1<<21];
int S[1<<21];

signed main()
{
	fast();
	int n, m;
	cin >> n >> m;
	vector<int> a(n+1, 0);
	vector<int> b(m);
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
		a[i]+=a[i-1];
	}
	for(int i = 0; i < m; i++)
		cin >> b[i];
	for(int i = 0; i < m; i++)
		S[1<<i] = b[i];
	for(int i = 0; i < (1<<m); i++)
		S[i] = S[(i&-i)] + S[i-(i&-i)];\
	for(int i = 0; i < (1<<m); i++)
	{
		for(int j = 0; j < m; j++)
		{
			if((i>>j)&1ll)
				dp[i] = max(dp[i], dp[i^(1<<j)]);
		}
		if((dp[i] < n) && (a[dp[i]+1] == S[i]))
			dp[i]++;
	}
	if(dp[(1<<m)-1] == n)
		cout << "YES\n";
	else
		cout << "NO\n";
	return 0;
}	
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 67 ms 8612 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 69 ms 8832 KB Output is correct
9 Correct 68 ms 8784 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 584 KB Output is correct
3 Correct 1 ms 356 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 2 ms 608 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 552 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 552 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 67 ms 8612 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 69 ms 8832 KB Output is correct
9 Correct 68 ms 8784 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 356 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 584 KB Output is correct
22 Correct 1 ms 356 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 2 ms 608 KB Output is correct
26 Correct 1 ms 352 KB Output is correct
27 Correct 1 ms 552 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 552 KB Output is correct
31 Correct 67 ms 8784 KB Output is correct
32 Correct 66 ms 8820 KB Output is correct
33 Correct 67 ms 8608 KB Output is correct
34 Correct 85 ms 8788 KB Output is correct
35 Correct 67 ms 8712 KB Output is correct
36 Correct 67 ms 8784 KB Output is correct
37 Correct 73 ms 8608 KB Output is correct
38 Correct 67 ms 8788 KB Output is correct
39 Correct 61 ms 8784 KB Output is correct
40 Correct 68 ms 8756 KB Output is correct
41 Correct 70 ms 8808 KB Output is correct
42 Correct 66 ms 8664 KB Output is correct
43 Correct 72 ms 8616 KB Output is correct
44 Correct 67 ms 8788 KB Output is correct
45 Correct 63 ms 8784 KB Output is correct
46 Correct 66 ms 8752 KB Output is correct
47 Correct 68 ms 8760 KB Output is correct
48 Correct 62 ms 9044 KB Output is correct
49 Correct 67 ms 8784 KB Output is correct
50 Correct 68 ms 8728 KB Output is correct
51 Correct 67 ms 8612 KB Output is correct
52 Correct 69 ms 8776 KB Output is correct
53 Correct 66 ms 8788 KB Output is correct
54 Correct 65 ms 8788 KB Output is correct
55 Correct 63 ms 8688 KB Output is correct
56 Correct 66 ms 8788 KB Output is correct
57 Correct 64 ms 8784 KB Output is correct
58 Correct 69 ms 8840 KB Output is correct