답안 #94111 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
94111	2019-01-16T06:12:59 Z	qkxwsm	은행 (IZhO14_bank)	C++14	71 / 100	1000 ms	4832 KB

bank

#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;
int A[MAXN], B[MAXN];
int sB[(1 << MAXN)];
bitset<(1 << MAXN)> ok, cur, temp;

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;
	if (N > M)
	{
		cout << "NO\n";
		return 0;
	}
	FOR(i, 0, N)
	{
		cin >> A[i];
	}
	sort(A, A + N);
	FOR(i, 0, M)
	{
		cin >> B[i];
	}
	sort(B, B + M);
	FOR(mask, 1, (1 << M))
	{
		FOR(i, 0, M)
		{
			if (mask & (1 << i))
			{
				sB[mask] = sB[mask ^ (1 << i)] + B[i];
				if (N == 1 && sB[mask] == A[0])
				{
					cout << "YES\n";
					return 0;
				}
			}
		}
	}
	if (N == 1)
	{
		cout << "NO\n";
		return 0;
	}
	ok.set();
	FOR(i, 0, N)
	{
		cur.reset();
		temp.reset();
		FOR(mask, 0, (1 << M))
		{
			if (sB[mask] == A[i])
			{
				cur[mask] = true;
			}
		}
		FOR(mask, 0, (1 << M))
		{
			for (int j = mask; ; j = mask & (j - 1))
			{
				if (ok[mask] && cur[j])
				{
					temp[mask ^ j] = true;
				}
				if (j == 0) break;
			}
		}
		ok = temp;
		// FOR(i, 0, (1 << M))
		// {
		// 	cerr << ok[i];
		// }
		// cerr << endl;
	}
	cout << (ok[0] ? "YES" : "NO") << '\n';
	//A[mask] actually stores, can u have superset of mask?
	//B[j] stores, can u take subset of j?
	// 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

#	결과	실행 시간	메모리	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	74 ms	4468 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	376 KB	Output is correct
9	Correct	74 ms	4456 KB	Output is correct

Subtask #2
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	760 KB	Output is correct
2	Correct	2 ms	760 KB	Output is correct
3	Correct	2 ms	760 KB	Output is correct
4	Correct	2 ms	760 KB	Output is correct
5	Correct	3 ms	760 KB	Output is correct
6	Correct	2 ms	760 KB	Output is correct
7	Correct	3 ms	760 KB	Output is correct
8	Correct	3 ms	760 KB	Output is correct
9	Correct	2 ms	760 KB	Output is correct
10	Correct	2 ms	760 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	31 ms	888 KB	Output is correct
2	Correct	16 ms	760 KB	Output is correct
3	Correct	41 ms	760 KB	Output is correct
4	Correct	56 ms	764 KB	Output is correct
5	Correct	41 ms	760 KB	Output is correct
6	Correct	23 ms	760 KB	Output is correct
7	Correct	20 ms	760 KB	Output is correct
8	Correct	17 ms	760 KB	Output is correct
9	Correct	36 ms	760 KB	Output is correct
10	Correct	36 ms	844 KB	Output is correct
11	Correct	56 ms	840 KB	Output is correct

Subtask #4
0 / 29.0

#	결과	실행 시간	메모리	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	74 ms	4468 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	376 KB	Output is correct
9	Correct	74 ms	4456 KB	Output is correct
10	Correct	2 ms	760 KB	Output is correct
11	Correct	2 ms	760 KB	Output is correct
12	Correct	2 ms	760 KB	Output is correct
13	Correct	2 ms	760 KB	Output is correct
14	Correct	3 ms	760 KB	Output is correct
15	Correct	2 ms	760 KB	Output is correct
16	Correct	3 ms	760 KB	Output is correct
17	Correct	3 ms	760 KB	Output is correct
18	Correct	2 ms	760 KB	Output is correct
19	Correct	2 ms	760 KB	Output is correct
20	Correct	31 ms	888 KB	Output is correct
21	Correct	16 ms	760 KB	Output is correct
22	Correct	41 ms	760 KB	Output is correct
23	Correct	56 ms	764 KB	Output is correct
24	Correct	41 ms	760 KB	Output is correct
25	Correct	23 ms	760 KB	Output is correct
26	Correct	20 ms	760 KB	Output is correct
27	Correct	17 ms	760 KB	Output is correct
28	Correct	36 ms	760 KB	Output is correct
29	Correct	36 ms	844 KB	Output is correct
30	Correct	56 ms	840 KB	Output is correct
31	Execution timed out	1069 ms	4832 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

답안 #94111

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 0 / 29.0

Subtask #1
19.0 / 19.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
0 / 29.0