oj.uz

Submission #887150

# Submission time Handle Problem Language Result Execution time Memory
887150 2023-12-13T21:52:51 Z BBart888 Bank (IZhO14_bank) C++17
100 / 100
 126 ms 20920 KB 
#include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <fstream>
#include <cmath>
#include <queue>
#include <stack>
#include <cassert>
#include <cstring>
#include <climits>
#include <functional>
#include<cstdlib>
//#include "arc.h"
//#include "dreaming.h"


using namespace std;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long LL;



const int MAXN = 3e6 + 11; 
using ll = long long;
const ll mod1 = 1e9 + 7;
const ll mod2 = 1000000021;
const ll P = 31;



/*
void setIO(string name = "") {
	cin.tie(0)->sync_with_stdio(0); // see /general/fast-io
	if ((name.size())) {
		freopen((name + ".in").c_str(), "r", stdin); // see /general/input-output
		freopen((name + ".out").c_str(), "w", stdout);
	}
}
*/



int n, m;
int a[MAXN];
int b[MAXN];
pair<int, ll> dp[MAXN];
int flag;


int main()
{
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(false);
	//setIO("movie");
	
	cin >> n >> m;

	for (int i = 0; i < n; i++)
		cin >> a[i];

	for (int i = 0; i < m; i++)
		cin >> b[i];


	for (int mask = 0; mask < (1 << m); mask++)
	{
		for (int j = 0; j < m; j++)
		{
			pair<int, int> cur = dp[mask ^ (1 << j)];
			if (((1 << j) & mask) == 0)
				continue;
			int C = b[j];

			if (cur.second + C == a[cur.first])
			{
				dp[mask] = max(dp[mask], make_pair(cur.first + 1, 0ll));
			}
			else if(cur.second + C < a[cur.first])
			{
				dp[mask] = max(dp[mask], make_pair(cur.first,(ll)cur.second + C));
			}
		}
	//	for (int j = 0; j < m; j++)
			//if ((1 << j) & mask)
				//cout << 1;
			//else
		//		cout << 0;
		
		//cout << " " << dp[mask].first << " " << dp[mask].second << '\n';
		if (dp[mask].first == n)
			flag = 1;
	}

	cout << (flag ? "YES\n" : "NO\n");





	

	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4448 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 4956 KB Output is correct
5 Correct 94 ms 20732 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 98 ms 20728 KB Output is correct
9 Correct 89 ms 20872 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4596 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4456 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 2 ms 4816 KB Output is correct
5 Correct 3 ms 4696 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 2 ms 4696 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 2 ms 4768 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4448 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 4 ms 4956 KB Output is correct
5 Correct 94 ms 20732 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 98 ms 20728 KB Output is correct
9 Correct 89 ms 20872 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4596 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4456 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 2 ms 4700 KB Output is correct
23 Correct 2 ms 4816 KB Output is correct
24 Correct 3 ms 4696 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 2 ms 4696 KB Output is correct
27 Correct 2 ms 4700 KB Output is correct
28 Correct 2 ms 4700 KB Output is correct
29 Correct 2 ms 4700 KB Output is correct
30 Correct 2 ms 4768 KB Output is correct
31 Correct 101 ms 20752 KB Output is correct
32 Correct 99 ms 20760 KB Output is correct
33 Correct 124 ms 20896 KB Output is correct
34 Correct 113 ms 20724 KB Output is correct
35 Correct 117 ms 20820 KB Output is correct
36 Correct 97 ms 20820 KB Output is correct
37 Correct 116 ms 20804 KB Output is correct
38 Correct 91 ms 20816 KB Output is correct
39 Correct 69 ms 20816 KB Output is correct
40 Correct 97 ms 20732 KB Output is correct
41 Correct 97 ms 20820 KB Output is correct
42 Correct 125 ms 20812 KB Output is correct
43 Correct 121 ms 20920 KB Output is correct
44 Correct 93 ms 20916 KB Output is correct
45 Correct 126 ms 20820 KB Output is correct
46 Correct 126 ms 20816 KB Output is correct
47 Correct 100 ms 20816 KB Output is correct
48 Correct 97 ms 20816 KB Output is correct
49 Correct 91 ms 20732 KB Output is correct
50 Correct 64 ms 20812 KB Output is correct
51 Correct 96 ms 20824 KB Output is correct
52 Correct 88 ms 20816 KB Output is correct
53 Correct 95 ms 20916 KB Output is correct
54 Correct 82 ms 20856 KB Output is correct
55 Correct 66 ms 20780 KB Output is correct
56 Correct 69 ms 20816 KB Output is correct
57 Correct 69 ms 20820 KB Output is correct
58 Correct 79 ms 20824 KB Output is correct