답안 #718763

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718763	2023-04-04T17:40:58 Z	sysia	은행 (IZhO14_bank)	C++17	100 / 100	114 ms	16836 KB

bank

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

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;

void solve(){
	int n, m; cin >> n >> m;
	vector<T>dp ((1<<m), {-oo, -oo});
	dp[0] = T{0, 0};
	vector<int>a(n), b(m);
	for (int i = 0; i<n; i++) cin >> a[i];
	for (int i = 0; i<m; i++) cin >> b[i];
	
	for (int mask = 1; mask < (1<<m); mask++){
		for (int i = 0; i<m; i++){
			if (mask&(1<<i)){
				if (dp[mask^(1<<i)].second + b[i] == a[dp[mask^(1<<i)].first]){
					dp[mask] = max(dp[mask], T{dp[mask^(1<<i)].first+1, 0});
				} else {
					dp[mask] = max(dp[mask], T{dp[mask^(1<<i)].first, dp[mask^(1<<i)].second + b[i]});
				}		
			}
		}
        if (dp[mask].first == n) {
            cout << "YES\n";
            return;
        }
	}
    cout << "NO\n";
}

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

	solve();
	
	return 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	0 ms	212 KB	Output is correct
4	Correct	1 ms	724 KB	Output is correct
5	Correct	79 ms	16668 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	8 ms	16724 KB	Output is correct
9	Correct	78 ms	16712 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	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	1 ms	340 KB	Output is correct
10	Correct	1 ms	244 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	468 KB	Output is correct
2	Correct	2 ms	468 KB	Output is correct
3	Correct	2 ms	468 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	2 ms	468 KB	Output is correct
6	Correct	2 ms	536 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	468 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	2 ms	468 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	0 ms	212 KB	Output is correct
4	Correct	1 ms	724 KB	Output is correct
5	Correct	79 ms	16668 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	8 ms	16724 KB	Output is correct
9	Correct	78 ms	16712 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	244 KB	Output is correct
20	Correct	2 ms	468 KB	Output is correct
21	Correct	2 ms	468 KB	Output is correct
22	Correct	2 ms	468 KB	Output is correct
23	Correct	2 ms	468 KB	Output is correct
24	Correct	2 ms	468 KB	Output is correct
25	Correct	2 ms	536 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	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	2 ms	468 KB	Output is correct
31	Correct	98 ms	16672 KB	Output is correct
32	Correct	91 ms	16724 KB	Output is correct
33	Correct	90 ms	16724 KB	Output is correct
34	Correct	83 ms	16724 KB	Output is correct
35	Correct	92 ms	16724 KB	Output is correct
36	Correct	76 ms	16724 KB	Output is correct
37	Correct	82 ms	16724 KB	Output is correct
38	Correct	90 ms	16724 KB	Output is correct
39	Correct	7 ms	16724 KB	Output is correct
40	Correct	87 ms	16656 KB	Output is correct
41	Correct	75 ms	16644 KB	Output is correct
42	Correct	114 ms	16724 KB	Output is correct
43	Correct	90 ms	16724 KB	Output is correct
44	Correct	100 ms	16724 KB	Output is correct
45	Correct	8 ms	16704 KB	Output is correct
46	Correct	98 ms	16724 KB	Output is correct
47	Correct	77 ms	16724 KB	Output is correct
48	Correct	7 ms	16724 KB	Output is correct
49	Correct	82 ms	16728 KB	Output is correct
50	Correct	92 ms	16724 KB	Output is correct
51	Correct	85 ms	16724 KB	Output is correct
52	Correct	78 ms	16724 KB	Output is correct
53	Correct	97 ms	16724 KB	Output is correct
54	Correct	105 ms	16724 KB	Output is correct
55	Correct	83 ms	16712 KB	Output is correct
56	Correct	83 ms	16724 KB	Output is correct
57	Correct	85 ms	16836 KB	Output is correct
58	Correct	88 ms	16724 KB	Output is correct

답안 #718763

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