oj.uz

Submission #153357

# Submission time Handle Problem Language Result Execution time Memory
153357 2019-09-13T15:57:37 Z Vladden Bank (IZhO14_bank) C++14
100 / 100
 497 ms 15480 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define po(x) (1<<x)
#define schnell ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL)
#define forn(i,n) for(ll i = 1;i<=n;i++)
typedef long long ll;
typedef long double ld;
#define DIM 25
#define DIM2 DIM*150
#define MODULO 998244353 
#define MAXN 1000000
#define MS 302
#define BigNumSize 250
#define AddLimit 151
const ll INF = 10E16;
const ll mask = po(9) - 1;
const ll base = 100000000000;
const ld eps = 0.0000001;
const ll masksz = 1048576;
struct pp {
	ll fi, sc;
	bool const operator < (const pp& b) {
		if (fi == b.fi)return sc < b.sc;
		return fi < b.fi;
	}
	bool const operator > (const pp& b) {
		if (fi == b.fi)return sc > b.sc;
		return fi > b.fi;
	}
	bool const operator == (const pp& b) {
		if (fi == b.fi && sc == b.sc)return 1;
		return 0;
	}
};
bool const operator<(const pp& a, const pp& b) {
	if (a.fi == b.fi)return a.sc < b.sc;
	return a.fi < b.fi;
}
ll n, m, A[DIM], B[DIM], flag = 0;
bool D[DIM][1048579];
vector<ll> G[DIM];
void dfs(ll x, ll mask) {
	if (x == n) {
		flag = 1;
		return;
	}
	if (D[x][mask])return;
	D[x][mask] = 1;
	for (ll to : G[x+1]) {
		if ((to & mask) == 0)dfs(x + 1, to ^ mask);
	}
}
int main() {
	schnell;
	cin >> n >> m;
	forn(i, n)cin >> A[i];
	forn(i, m)cin >> B[i];
	for (ll i = 0; i < (1 << m); i++) {
		ll r=0,mask = i,pos = 1;
		while (mask > 0) {
			if (mask&1)r += B[pos];
			pos++;
			mask /= 2;
		}
		for (ll j = 1; j <= n; j++) {
			if (A[j] == r)G[j].pb(i);
		}
	}
	dfs(0,0);
	if (flag == 1) {
		cout << "YES\n";
	}
	else {
		cout << "NO\n";
	}
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 80 ms 504 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 80 ms 504 KB Output is correct
9 Correct 80 ms 408 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 80 ms 504 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 80 ms 504 KB Output is correct
9 Correct 80 ms 408 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 380 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 4 ms 376 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 83 ms 1272 KB Output is correct
32 Correct 134 ms 2552 KB Output is correct
33 Correct 89 ms 1656 KB Output is correct
34 Correct 89 ms 504 KB Output is correct
35 Correct 91 ms 476 KB Output is correct
36 Correct 101 ms 504 KB Output is correct
37 Correct 82 ms 376 KB Output is correct
38 Correct 84 ms 376 KB Output is correct
39 Correct 111 ms 4392 KB Output is correct
40 Correct 88 ms 376 KB Output is correct
41 Correct 100 ms 376 KB Output is correct
42 Correct 92 ms 3704 KB Output is correct
43 Correct 88 ms 1016 KB Output is correct
44 Correct 95 ms 384 KB Output is correct
45 Correct 85 ms 1804 KB Output is correct
46 Correct 88 ms 2236 KB Output is correct
47 Correct 95 ms 504 KB Output is correct
48 Correct 81 ms 504 KB Output is correct
49 Correct 81 ms 632 KB Output is correct
50 Correct 239 ms 15480 KB Output is correct
51 Correct 90 ms 632 KB Output is correct
52 Correct 95 ms 3704 KB Output is correct
53 Correct 497 ms 8100 KB Output is correct
54 Correct 276 ms 15116 KB Output is correct
55 Correct 244 ms 15480 KB Output is correct
56 Correct 248 ms 15428 KB Output is correct
57 Correct 243 ms 14536 KB Output is correct
58 Correct 243 ms 14612 KB Output is correct