oj.uz

Submission #558659

# Submission time Handle Problem Language Result Execution time Memory
558659 2022-05-07T22:04:33 Z Pulgster Bank (IZhO14_bank) C++17
100 / 100
 628 ms 90636 KB 
#include "bits/stdc++.h"
// #pragma GCC optimize("Ofast")
	// #pragma GCC optimize("O3,unroll-loops")
// 	#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
typedef long long ll;
using namespace std;

	#define sim template < class c
	#define ris return * this
	#define dor > debug & operator <<
	#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
	sim > struct rge { c b, e; };
	sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
	sim > auto dud(c* x) -> decltype(cerr << *x, 0);
	sim > char dud(...);
	struct debug {
			// #ifdef LOCAL
		~debug() { cerr << endl; }
		eni(!=) cerr << boolalpha << i; ris; }
		eni(==) ris << range(begin(i), end(i)); }
		sim, class b dor(pair < b, c > d) {
			ris << "(" << d.first << ", " << d.second << ")";
		}
		sim dor(rge<c> d) {
			*this << "[";
			for (auto it = d.b; it != d.e; ++it)
				*this << ", " + 2 * (it == d.b) << *it;
			ris << "]";
		}

			// sim dor(const c&) { ris; }
	};
	#ifdef ASJKD
}
	#endif
	#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
	#define read(x) for(auto &i : (x)){cin>>i;}
	#define all(x) begin(x), end(x)
	#define pb push_back
	#define pii pair<int,int>
	#define pll pair<ll, ll>
ll mod = 1e9+7;
int INF = 1e9+1e8+1e7;
ll INF64 = 1e18;
// vector<string> every;
void test_case(int test){
	int n,m;
	cin>>n>>m; 
	vector<vector<int>> dp(n+1,vector<int>(1<<m, -1));
	vector<int> a(n);
	vector<int> b(m);
	read(a);
	read(b);
	dp[0][0] = 0;
	for(int i=0;i<n;i++){
		for(int j=0;j<1<<m;j++){
			if(dp[i][j] == -1){
				continue;
			}
			for(int k=0;k<m;k++){
				if((j & (1<<k)) == 0){
					if(dp[i][j] + b[k] == a[i]){
						dp[i+1][j+(1<<k)] = 0; 
					} else{
						// assert(dp[i][j+(1<<k)] == -1 or dp[i][j+(1<<k)] == dp[i][j]);
						dp[i][j+(1<<k)] = dp[i][j] + b[k];
						// debug() << imie(b[k]);
						// debug() << imie(dp[i][j+(1<<k)]);
					}
				}
			}
		}
	}
	// bool ok = 0;
	for(int i=0;i<1<<m;i++){
		if(dp[n][i] >= 0){
			cout << "YES\n";
			return;
		}
	}
	cout << "NO\n";
}	

int main(){
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(false);
	int t=1;
	// cin>>t;

	// debug() << imie(every);

	// init();
	for(int test=1;test<=t;test++){
		test_case(test);

	}
	return 0;
}

Subtask #1
19.0 / 19.0

# 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 3 ms 724 KB Output is correct
5 Correct 76 ms 12608 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 80 ms 12628 KB Output is correct
9 Correct 75 ms 12628 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 316 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 1340 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 704 KB Output is correct
7 Correct 2 ms 708 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 828 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 3 ms 1348 KB Output is correct

Subtask #4
29.0 / 29.0

# 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 3 ms 724 KB Output is correct
5 Correct 76 ms 12608 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 80 ms 12628 KB Output is correct
9 Correct 75 ms 12628 KB Output is correct
10 Correct 1 ms 340 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 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 2 ms 852 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 2 ms 1340 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 2 ms 704 KB Output is correct
26 Correct 2 ms 708 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 2 ms 828 KB Output is correct
29 Correct 2 ms 852 KB Output is correct
30 Correct 3 ms 1348 KB Output is correct
31 Correct 116 ms 16664 KB Output is correct
32 Correct 133 ms 20820 KB Output is correct
33 Correct 148 ms 37228 KB Output is correct
34 Correct 161 ms 49508 KB Output is correct
35 Correct 171 ms 53652 KB Output is correct
36 Correct 189 ms 90636 KB Output is correct
37 Correct 102 ms 16724 KB Output is correct
38 Correct 78 ms 24892 KB Output is correct
39 Correct 33 ms 41324 KB Output is correct
40 Correct 100 ms 49524 KB Output is correct
41 Correct 136 ms 90572 KB Output is correct
42 Correct 187 ms 28984 KB Output is correct
43 Correct 122 ms 41300 KB Output is correct
44 Correct 104 ms 70120 KB Output is correct
45 Correct 159 ms 20820 KB Output is correct
46 Correct 157 ms 33060 KB Output is correct
47 Correct 138 ms 70100 KB Output is correct
48 Correct 69 ms 12628 KB Output is correct
49 Correct 70 ms 12628 KB Output is correct
50 Correct 575 ms 90612 KB Output is correct
51 Correct 219 ms 49620 KB Output is correct
52 Correct 326 ms 49568 KB Output is correct
53 Correct 276 ms 49600 KB Output is correct
54 Correct 628 ms 90604 KB Output is correct
55 Correct 593 ms 90572 KB Output is correct
56 Correct 559 ms 90576 KB Output is correct
57 Correct 546 ms 90576 KB Output is correct
58 Correct 531 ms 86512 KB Output is correct