oj.uz

Submission #94242

# Submission time Handle Problem Language Result Execution time Memory
94242 2019-01-17T04:51:40 Z qkxwsm Bank (IZhO14_bank) C++14
100 / 100
 92 ms 8696 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 20

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, M;
vi A, B;
multiset<int> temp;
int sum[(1 << MAXN)], dp[(1 << MAXN)];

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> M;
	FOR(i, 0, N)
	{
		int x;
		cin >> x;
		A.PB(x);
	}
	FOR(i, 0, M)
	{
		int x;
		cin >> x;
		B.PB(x);
		// temp.insert(x);
	}
	// FOR(i, 0, N)
	// {
	// 	if (temp.find(A[i]) == temp.end())
	// 	{
	// 		B.PB(A[i]);
	// 	}
	// 	else
	// 	{
	// 		temp.erase(temp.find(A[i]));
	// 	}
	// }
	// A = B; B.clear();
	// B.insert(B.end(), temp.begin(), temp.end());
	// if (SZ(B) < 2 * SZ(A))
	// {
	// 	cout << "NO\n";
	// 	return 0;
	// }
	A.PB(0);
	sort(ALL(A)); sort(ALL(B));
	FOR(i, 1, SZ(A))
	{
		A[i] += A[i - 1];
		// DBG(A[i]);
	}
	FOR(i, 1, (1 << M))
	{
		FOR(j, 0, M)
		{
			if (!(i & (1 << j))) continue;
			sum[i] = B[j] + sum[i ^ (1 << j)];
			break;
		}
	}
	FOR(i, 0, (1 << M))
	{
		// DBG(sum[i]);
		// DBG(dp[i]);
		if (dp[i] == SZ(A) - 1)
		{
			cout << "YES\n";
			return 0;
		}
		FOR(j, 0, M)
		{
			if ((i & (1 << j))) continue;
			int val = dp[i];
			if (sum[i + (1 << j)] == A[val + 1])
			{
				ckmax(dp[i + (1 << j)], val + 1);
			}
			else
			{
				ckmax(dp[i + (1 << j)], val);
			}
		}
	}
	cout << "NO\n";
	//N <= 10, M <= 20
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1
19.0 / 19.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 504 KB Output is correct
5 Correct 90 ms 8696 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 9 ms 4988 KB Output is correct
9 Correct 88 ms 8568 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 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.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 504 KB Output is correct
5 Correct 90 ms 8696 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 9 ms 4988 KB Output is correct
9 Correct 88 ms 8568 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 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 3 ms 504 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 3 ms 504 KB Output is correct
29 Correct 3 ms 504 KB Output is correct
30 Correct 3 ms 504 KB Output is correct
31 Correct 89 ms 8620 KB Output is correct
32 Correct 92 ms 8576 KB Output is correct
33 Correct 92 ms 8568 KB Output is correct
34 Correct 90 ms 8568 KB Output is correct
35 Correct 90 ms 8568 KB Output is correct
36 Correct 89 ms 8568 KB Output is correct
37 Correct 90 ms 8568 KB Output is correct
38 Correct 89 ms 8568 KB Output is correct
39 Correct 7 ms 4604 KB Output is correct
40 Correct 90 ms 8568 KB Output is correct
41 Correct 89 ms 8568 KB Output is correct
42 Correct 90 ms 8568 KB Output is correct
43 Correct 90 ms 8568 KB Output is correct
44 Correct 90 ms 8572 KB Output is correct
45 Correct 18 ms 6136 KB Output is correct
46 Correct 90 ms 8568 KB Output is correct
47 Correct 90 ms 8568 KB Output is correct
48 Correct 8 ms 4728 KB Output is correct
49 Correct 92 ms 8696 KB Output is correct
50 Correct 92 ms 8480 KB Output is correct
51 Correct 90 ms 8592 KB Output is correct
52 Correct 92 ms 8468 KB Output is correct
53 Correct 92 ms 8568 KB Output is correct
54 Correct 88 ms 8568 KB Output is correct
55 Correct 88 ms 8568 KB Output is correct
56 Correct 89 ms 8568 KB Output is correct
57 Correct 89 ms 8568 KB Output is correct
58 Correct 89 ms 8568 KB Output is correct