oj.uz

Submission #48571

# Submission time Handle Problem Language Result Execution time Memory
48571 2018-05-16T16:55:32 Z rkocharyan Bank (IZhO14_bank) C++14
71 / 100
 89 ms 24188 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <bitset>
#include <iomanip>
#include <memory>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <climits>
#include <cassert>
using namespace std;

#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define mp make_pair
#define add push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mem(a,b) memset(a, b, sizeof(a))
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:20000007")
#pragma GCC optimize("unroll-loops")

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> lnum;

const int N = (int)1e6 + 100;
const int maxn = (int)1e3 + 100;
const int base = (int)1e9;
const int mod = (int)1e9 + 7;
const int inf = INT_MAX;
const long long ll_inf = LLONG_MAX;
const long double PI = acos((long double)-1.0);
const long double eps = 1e-8;

int n, m;
vector <int> A, M;

bitset <36> B[N];
vector <int> can[N];

void rec(int step, int msk) {
	if (step == n) {
		cout << "YES\n";
		exit(false);
	}
	else {
		if (B[step][msk]) return;
		B[step][msk] = true;
		for (int i : can[step]) {
			if (!(i & msk)) rec(step + 1, i ^ msk);
		}
	}
}

void solve() {
	cin >> n >> m;
	A.resize(n), M.resize(m);
	for (int i = 0; i < n; ++i) cin >> A[i];
	for (int i = 0; i < m; ++i) cin >> M[i];
	for (int msk = 0; msk < (1 << m); ++msk) {
		int cur = 0;
		for (int i = 0; i < m; ++i) if (1 & (msk >> i)) cur += M[i];
		for (int i = 0; i < n; ++i) if (A[i] == cur) can[i].add(msk);
	}
	rec(0, 0);
	cout << "NO\n";
}

int main() {
	//ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

	//#define Freopen
#ifdef Freopen
#ifndef _MSC_VER 
#define TASK ""
	freopen(TASK".in", "r", stdin);
	freopen(TASK".out", "w", stdout);
#endif
#endif

	int T = 1;
	//scanf("%d", &T);

	for (; T; --T) solve();

#ifdef DEBUG
	cerr << double(1.0 * clock() / CLOCKS_PER_SEC) << '\n';
#endif 

	return 0;
}

Compilation message

bank.cpp:31:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)
 
bank.cpp:32:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:20000007")

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23800 KB Output is correct
2 Correct 23 ms 23972 KB Output is correct
3 Correct 23 ms 23972 KB Output is correct
4 Correct 22 ms 23972 KB Output is correct
5 Correct 84 ms 23972 KB Output is correct
6 Correct 19 ms 24020 KB Output is correct
7 Correct 19 ms 24020 KB Output is correct
8 Correct 85 ms 24020 KB Output is correct
9 Correct 83 ms 24020 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24020 KB Output is correct
2 Correct 23 ms 24020 KB Output is correct
3 Correct 23 ms 24020 KB Output is correct
4 Correct 23 ms 24020 KB Output is correct
5 Correct 23 ms 24020 KB Output is correct
6 Correct 22 ms 24020 KB Output is correct
7 Correct 22 ms 24116 KB Output is correct
8 Correct 22 ms 24116 KB Output is correct
9 Correct 22 ms 24116 KB Output is correct
10 Correct 23 ms 24116 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23800 KB Output is correct
2 Correct 23 ms 23972 KB Output is correct
3 Correct 23 ms 23972 KB Output is correct
4 Correct 22 ms 23972 KB Output is correct
5 Correct 84 ms 23972 KB Output is correct
6 Correct 19 ms 24020 KB Output is correct
7 Correct 19 ms 24020 KB Output is correct
8 Correct 85 ms 24020 KB Output is correct
9 Correct 83 ms 24020 KB Output is correct
10 Correct 23 ms 24020 KB Output is correct
11 Correct 23 ms 24020 KB Output is correct
12 Correct 23 ms 24020 KB Output is correct
13 Correct 23 ms 24020 KB Output is correct
14 Correct 23 ms 24020 KB Output is correct
15 Correct 22 ms 24020 KB Output is correct
16 Correct 22 ms 24116 KB Output is correct
17 Correct 22 ms 24116 KB Output is correct
18 Correct 22 ms 24116 KB Output is correct
19 Correct 23 ms 24116 KB Output is correct
20 Correct 23 ms 24116 KB Output is correct
21 Correct 23 ms 24116 KB Output is correct
22 Correct 23 ms 24116 KB Output is correct
23 Correct 23 ms 24116 KB Output is correct
24 Correct 23 ms 24116 KB Output is correct
25 Correct 23 ms 24116 KB Output is correct
26 Correct 24 ms 24116 KB Output is correct
27 Correct 24 ms 24184 KB Output is correct
28 Correct 20 ms 24184 KB Output is correct
29 Correct 20 ms 24184 KB Output is correct
30 Correct 24 ms 24184 KB Output is correct
31 Correct 82 ms 24184 KB Output is correct
32 Correct 85 ms 24184 KB Output is correct
33 Correct 88 ms 24184 KB Output is correct
34 Incorrect 89 ms 24188 KB Output isn't correct
35 Halted 0 ms 0 KB -