oj.uz

Submission #337888

# Submission time Handle Problem Language Result Execution time Memory
337888 2020-12-22T04:37:30 Z kutbilim_one Bank (IZhO14_bank) C++14
100 / 100
 527 ms 12012 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define all(x) x.begin(), x.end()
#define int long long

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie();

	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];

    int maxx = *max_element(all(a));
    vector<int> pass[1 + maxx];
    for(int bin = 1; bin < (1 << m); bin++){
    	int i = 0, sum = 0, temp = bin;
    	while(temp){
    		if(temp & 1) sum += b[i];
    		temp >>= 1;
    		i++;
    	}
    	if(sum <= maxx) pass[sum].push_back(bin);
    }

    vector< vector<bool> > dp(n, vector<bool> (1 << m, false));

    for(int i = 0; i < pass[a[0]].size(); i++){
    	dp[0][pass[a[0]][i]] = true;
    }

    for(int i = 1; i < n; i++){
    	int good = 0;
    	for(int bin = 0; bin < (1 << m); bin++){
    		if(!dp[i-1][bin]) continue;
    		for(auto last : pass[a[i]])
    			if(!(last & bin)) dp[i][last|bin] = good = true;
    	}
    	if(!good) break;
    }

    bool ans = false;
    for(int i = 0; !ans && i < (1 << m); i++){
    	if(dp[n-1][i]) ans = true;
    }

    if(ans) cout << "YES";
    else cout << "NO";


	return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:34:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int i = 0; i < pass[a[0]].size(); i++){
      |                    ~~^~~~~~~~~~~~~~~~~~~
bank.cpp:43:51: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   43 |        if(!(last & bin)) dp[i][last|bin] = good = true;
      |                                                   ^~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 64 ms 620 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 71 ms 5868 KB Output is correct
9 Correct 77 ms 12012 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 64 ms 620 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 71 ms 5868 KB Output is correct
9 Correct 77 ms 12012 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 76 ms 8940 KB Output is correct
32 Correct 161 ms 5356 KB Output is correct
33 Correct 71 ms 1516 KB Output is correct
34 Correct 74 ms 1772 KB Output is correct
35 Correct 77 ms 2028 KB Output is correct
36 Correct 86 ms 3180 KB Output is correct
37 Correct 65 ms 748 KB Output is correct
38 Correct 66 ms 1004 KB Output is correct
39 Correct 85 ms 1516 KB Output is correct
40 Correct 69 ms 1772 KB Output is correct
41 Correct 68 ms 3180 KB Output is correct
42 Correct 76 ms 1772 KB Output is correct
43 Correct 72 ms 1516 KB Output is correct
44 Correct 69 ms 2560 KB Output is correct
45 Correct 70 ms 1388 KB Output is correct
46 Correct 71 ms 1772 KB Output is correct
47 Correct 81 ms 2540 KB Output is correct
48 Correct 66 ms 2540 KB Output is correct
49 Correct 64 ms 620 KB Output is correct
50 Correct 179 ms 3180 KB Output is correct
51 Correct 78 ms 4332 KB Output is correct
52 Correct 79 ms 1772 KB Output is correct
53 Correct 527 ms 1772 KB Output is correct
54 Correct 203 ms 3180 KB Output is correct
55 Correct 177 ms 3052 KB Output is correct
56 Correct 181 ms 3052 KB Output is correct
57 Correct 184 ms 3180 KB Output is correct
58 Correct 183 ms 2924 KB Output is correct