oj.uz

Submission #1006728

# Submission time Handle Problem Language Result Execution time Memory
1006728 2024-06-24T07:50:29 Z vjudge1 Bank (IZhO14_bank) C++17
100 / 100
 81 ms 17880 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

#pragma GCC target("avx,avx2,fma")
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ff(x,a,b,c) for (auto x=a;x<=b;x+=c)
#define fd(x,a,b,c) for (auto x=a;x>=b;x-=c)
#define int ll

using namespace std;

const int N = 1e6+5;
const int mod = 1e9+7;
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

void solve()
{
	int n,m;
	cin>>n>>m;
	vector<int> a(n),b(m);
	for (int i=0;i<n;i++) cin>>a[i];
	for (int j=0;j<m;j++) cin>>b[j];
	vector<pair<int,int>> dp((1<<m),{0,0});
	bool check[1<<m] {false}; check[0] = true;
	for (int mask=0;mask<(1<<m);mask++)
	{
		for (int i=0;i<m;i++)
		{
			if (mask & (1<<i) && check[mask ^ (1<<i)])
			{
				int nmask = mask ^ (1<<i);
				int cur = dp[nmask].second+b[i];
				if (cur==a[dp[nmask].first]) dp[mask] = {dp[nmask].first+1,0}, check[mask] = true;
				else if (cur<a[dp[nmask].first]) dp[mask] = {dp[nmask].first,cur},check[mask] = true;

			}
		}
		if (dp[mask].first==n)
		{
			cout<<"YES"; return;
		}
	}
	cout<<"NO";
}

signed main()
{
	bruh
	int t = 1;
	//cin>>t;
	while (t--)
	{
		solve();
		//cout<<"\n";
	}
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 67 ms 17756 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 17756 KB Output is correct
9 Correct 81 ms 17756 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 67 ms 17756 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 17756 KB Output is correct
9 Correct 81 ms 17756 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 74 ms 17752 KB Output is correct
32 Correct 76 ms 17752 KB Output is correct
33 Correct 60 ms 17752 KB Output is correct
34 Correct 64 ms 17756 KB Output is correct
35 Correct 63 ms 17756 KB Output is correct
36 Correct 62 ms 17756 KB Output is correct
37 Correct 65 ms 17756 KB Output is correct
38 Correct 61 ms 17752 KB Output is correct
39 Correct 3 ms 17756 KB Output is correct
40 Correct 62 ms 17756 KB Output is correct
41 Correct 58 ms 17752 KB Output is correct
42 Correct 75 ms 17752 KB Output is correct
43 Correct 56 ms 17752 KB Output is correct
44 Correct 58 ms 17752 KB Output is correct
45 Correct 5 ms 17756 KB Output is correct
46 Correct 65 ms 17756 KB Output is correct
47 Correct 59 ms 17752 KB Output is correct
48 Correct 3 ms 17756 KB Output is correct
49 Correct 59 ms 17880 KB Output is correct
50 Correct 62 ms 17752 KB Output is correct
51 Correct 62 ms 17756 KB Output is correct
52 Correct 61 ms 17752 KB Output is correct
53 Correct 70 ms 17752 KB Output is correct
54 Correct 73 ms 17756 KB Output is correct
55 Correct 68 ms 17756 KB Output is correct
56 Correct 62 ms 17752 KB Output is correct
57 Correct 62 ms 17756 KB Output is correct
58 Correct 60 ms 17756 KB Output is correct