Submission #751557

# Submission time Handle Problem Language Result Execution time Memory
751557 2023-05-31T18:30:54 Z hanlulu Bank (IZhO14_bank) C++14
100 / 100
77 ms 8532 KB
//https://oj.uz/problem/view/IZhO14_bank
#include <bits/stdc++.h>
using namespace std; 
const int MOD = 1e9+7;
 
int main()
{
	//freopen("bank.in","r",stdin);
	//freopen("bank.out","w",stdout);
  	int n, m;
  	cin >> m >> n;
  	vector< int > notes(n),salary(m);
 	for (int i = 0; i < m ;i++)
  	{
  		cin >> salary[i];
  	} 	
	for (int i = 0; i < n ;i++)
  	{
  		cin >> notes[i];
  	}

	vector< pair<int,int> > dp(1<<n,{-1,0});
	/*
	dp[00001011b] ={x,y} means select first,second and 4th notes can satisfy first x people
	and also has y money left.  
	we add new note as the last one to cover the current people.
	*/
 
	dp[0] = {0,0} ;//empty, dealing with salary[0],no money left. 
	for (int s = 0; s < (1<<n); s++)
	{
		//cout << s << " " << dp[s].first << " " << dp[s].second << endl;
		if(dp[s].first == -1) continue;	//should not use invalid status.
		//cout <<salary[dp[s].first]  << endl;
		for (int i = 0 ;i < n; i++) {
			if ( (1<<i) & s ) //already has ith notes, skip
				continue;
	
			//try to finish people dp[s].first	using current notes[i]
 			if (salary[dp[s].first] == dp[s].second + notes[i])//just enough to pay
 			{
 				dp[(1<<i) | s].first = dp[s].first+1;
 				dp[(1<<i) | s].second = 0;
			 	if (dp[(1<<i) | s].first == m ) {
						cout <<  "YES" << endl;
						return 0;
					}						
			}
			else if (salary[dp[s].first] > dp[s].second + notes[i])
			{
				dp[(1<<i) | s].first = dp[s].first;
 				dp[(1<<i) | s].second  =  dp[s].second + notes[i];	
							
			}
			//cout <<((1<<i) | s) <<" "<< dp[(1<<i) | s].first << " dp " << dp[(1<<i) | s].second << endl;
			//if bigger do nothing, as we can not use it.
		}

	}	
 
	cout << "NO" << endl;		
    return 0;
}
# Verdict Execution time Memory 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 468 KB Output is correct
5 Correct 5 ms 8404 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 77 ms 8404 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 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 428 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 428 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory 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 468 KB Output is correct
5 Correct 5 ms 8404 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 77 ms 8404 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 428 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 428 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 49 ms 8404 KB Output is correct
32 Correct 49 ms 8404 KB Output is correct
33 Correct 9 ms 8488 KB Output is correct
34 Correct 5 ms 8404 KB Output is correct
35 Correct 6 ms 8404 KB Output is correct
36 Correct 5 ms 8404 KB Output is correct
37 Correct 5 ms 8404 KB Output is correct
38 Correct 5 ms 8404 KB Output is correct
39 Correct 4 ms 8404 KB Output is correct
40 Correct 6 ms 8492 KB Output is correct
41 Correct 6 ms 8532 KB Output is correct
42 Correct 51 ms 8404 KB Output is correct
43 Correct 7 ms 8404 KB Output is correct
44 Correct 5 ms 8532 KB Output is correct
45 Correct 5 ms 8492 KB Output is correct
46 Correct 13 ms 8492 KB Output is correct
47 Correct 6 ms 8464 KB Output is correct
48 Correct 5 ms 8404 KB Output is correct
49 Correct 6 ms 8528 KB Output is correct
50 Correct 42 ms 8520 KB Output is correct
51 Correct 6 ms 8404 KB Output is correct
52 Correct 7 ms 8404 KB Output is correct
53 Correct 51 ms 8504 KB Output is correct
54 Correct 45 ms 8404 KB Output is correct
55 Correct 45 ms 8532 KB Output is correct
56 Correct 42 ms 8500 KB Output is correct
57 Correct 77 ms 8508 KB Output is correct
58 Correct 38 ms 8508 KB Output is correct