oj.uz

답안 #684629

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684629 2023-01-22T07:51:14 Z CyberCow 은행 (IZhO14_bank) C++17
100 / 100
 113 ms 8544 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <string>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <stack>
#include <deque>
#define fi first
#define se second
using namespace std;
using ll = long long;
vector<int> a, b;

void solve()
{
	int n, m, i, j, x, y;
	cin >> n >> m;
	for ( i = 0; i < n; i++)
	{
		cin >> x;
		a.push_back(x);
	}
	for ( i = 0; i < m; i++)
	{
		cin >> x;
		b.push_back(x);
	}
	vector<int> dp(1 << m, -1);
	vector<int> mnac(1 << m, -1);
	dp[0] = 0;
	mnac[0] = 0;
	for (int mask = 0; mask < (1 << m); mask++)
	{
		for ( j = 0; j < m; j++)
		{
			if (((1 << j) & mask) == 0)
				continue;
			int ent = mask ^ (1 << j);
			if (dp[ent] == -1)
				continue;
			int unem = mnac[ent] + b[j];
			if (unem == a[dp[ent]])
			{
				dp[mask] = dp[ent] + 1;
				mnac[mask] = 0;
			}
			else if(unem < a[dp[ent]] && dp[mask] <= dp[ent])
			{
				dp[mask] = dp[ent];
				mnac[mask] = unem;
			}
		}
		if (dp[mask] == n)
		{
			cout << "YES\n";
			return;
		}
	}
	cout << "NO\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int tt = 1;
	//cin >> tt;
	while (tt--)
	{
		solve();
	}
	return 0;
}

Compilation message

bank.cpp: In function 'void solve()':
bank.cpp:24:21: warning: unused variable 'y' [-Wunused-variable]
   24 |  int n, m, i, j, x, y;
      |                     ^

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 61 ms 8540 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 97 ms 8532 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 61 ms 8540 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 97 ms 8532 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 448 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 448 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 444 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 1 ms 452 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 105 ms 8532 KB Output is correct
32 Correct 103 ms 8520 KB Output is correct
33 Correct 72 ms 8532 KB Output is correct
34 Correct 62 ms 8532 KB Output is correct
35 Correct 64 ms 8532 KB Output is correct
36 Correct 61 ms 8512 KB Output is correct
37 Correct 62 ms 8544 KB Output is correct
38 Correct 62 ms 8532 KB Output is correct
39 Correct 4 ms 8532 KB Output is correct
40 Correct 62 ms 8544 KB Output is correct
41 Correct 61 ms 8528 KB Output is correct
42 Correct 113 ms 8536 KB Output is correct
43 Correct 64 ms 8512 KB Output is correct
44 Correct 62 ms 8532 KB Output is correct
45 Correct 4 ms 8532 KB Output is correct
46 Correct 88 ms 8508 KB Output is correct
47 Correct 64 ms 8532 KB Output is correct
48 Correct 3 ms 8532 KB Output is correct
49 Correct 63 ms 8532 KB Output is correct
50 Correct 81 ms 8532 KB Output is correct
51 Correct 62 ms 8540 KB Output is correct
52 Correct 65 ms 8532 KB Output is correct
53 Correct 104 ms 8532 KB Output is correct
54 Correct 94 ms 8532 KB Output is correct
55 Correct 81 ms 8532 KB Output is correct
56 Correct 78 ms 8532 KB Output is correct
57 Correct 81 ms 8532 KB Output is correct
58 Correct 81 ms 8532 KB Output is correct