oj.uz

답안 #464069

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464069 2021-08-12T10:41:50 Z vantablack27 은행 (IZhO14_bank) C++14
100 / 100
 130 ms 8584 KB 
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>

using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vll = vector<ll>;
using vi = vector<int>;

#define newl "\n"
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define INF 1e10
#define EPS 1e-9
#define MOD 1000000007
#define FOR(i, j, k, in) for (ll i = j; i < k; i += in)
#define REP(i, j) FOR(i, 0, j, 1)
#define PRINT_VEC(vec)    \
	for (auto x : vec)    \
	{                     \
		cout << x << " "; \
	}                     \
	cout << "\n";
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << " is " << x << newl

string resp[] = {"NO", "YES"};

template <typename T>
T read()
{
	T toRead;
	cin >> toRead;
	assert(cin);
	return toRead;
}

const int MAXN = 25;
int a[MAXN], b[MAXN];
pii dp[1<<MAXN];

void solve()
{
	int n,m;
	cin>>n>>m;

	REP(i,n) cin>>a[i];
	REP(i,m) cin>>b[i];
	
	REP(mask,1<<m) {
		REP(i,m) {
			if ((mask&(1<<i)) == 0) continue;

			int oth=mask^(1<<i);
			int emp=dp[oth].fir, rem=dp[oth].sec;

			if (rem+b[i] == a[emp]) {
				dp[mask] = max(dp[mask], {emp+1, 0});
			} else {
				dp[mask] = max(dp[mask], {emp, rem+b[i]});
			}
		}
	}

	cout << resp[dp[(1<<m)-1].fir == n] << newl;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int tc=1;
	/* int tc = read<int>(); */
	while (tc--)
	{
		solve();
	}
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 98 ms 8452 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 111 ms 8424 KB Output is correct
9 Correct 105 ms 8408 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 98 ms 8452 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 111 ms 8424 KB Output is correct
9 Correct 105 ms 8408 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 452 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 448 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 444 KB Output is correct
31 Correct 106 ms 8556 KB Output is correct
32 Correct 110 ms 8500 KB Output is correct
33 Correct 108 ms 8584 KB Output is correct
34 Correct 101 ms 8444 KB Output is correct
35 Correct 109 ms 8488 KB Output is correct
36 Correct 99 ms 8396 KB Output is correct
37 Correct 100 ms 8528 KB Output is correct
38 Correct 98 ms 8392 KB Output is correct
39 Correct 103 ms 8444 KB Output is correct
40 Correct 98 ms 8392 KB Output is correct
41 Correct 97 ms 8516 KB Output is correct
42 Correct 130 ms 8428 KB Output is correct
43 Correct 111 ms 8420 KB Output is correct
44 Correct 97 ms 8508 KB Output is correct
45 Correct 127 ms 8504 KB Output is correct
46 Correct 116 ms 8492 KB Output is correct
47 Correct 96 ms 8516 KB Output is correct
48 Correct 113 ms 8488 KB Output is correct
49 Correct 95 ms 8496 KB Output is correct
50 Correct 99 ms 8388 KB Output is correct
51 Correct 106 ms 8480 KB Output is correct
52 Correct 98 ms 8500 KB Output is correct
53 Correct 116 ms 8484 KB Output is correct
54 Correct 116 ms 8416 KB Output is correct
55 Correct 98 ms 8412 KB Output is correct
56 Correct 98 ms 8516 KB Output is correct
57 Correct 97 ms 8572 KB Output is correct
58 Correct 107 ms 8412 KB Output is correct