oj.uz

답안 #776927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
776927 2023-07-08T11:58:27 Z Halym2007 은행 (IZhO14_bank) C++11
44 / 100
 1000 ms 19416 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define sz size()
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 25;
// const int mod = 1e9+7;
// ll bigmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}

void solve();
int n, m, a[N], b[N];
int main() {
	ios::sync_with_stdio(false);
 	cin.tie(0), cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    //  clock_t tStart = clock();
    // printf("Time taken: %.2fs\n", (double)(clock() - tStart)/CLOCKS_PER_SEC);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}    
	for (int i = 1; i <= m; ++i) {
		cin >> b[i];
	}
	if (n == 1) {
		int sum;
		for (int i = 1; i <= m; ++i) sum += b[i];
		vector <int> dp(sum+1, 0);
		dp[0] = 1;
		for (int i = 1; i <= m; ++i) {
			for (int j = sum - b[i]; j >= 0; j--) {
				if (dp[j]) {
					dp[j + b[i]] = 1;
				}
			}	
		}
		if (dp[a[1]]&1) {
			cout << "YES\n";
			return 0;
		} 
		cout << "NO\n";
		return 0;
	}
	sort (b + 1, b + m + 1);
	do {
		int pos = 1;
		int sum = 0;
		int bolonok = 0;
		for (int i = 1; i <= m; ++i) {
			if (pos == n + 1) break; 
			if (sum < a[pos]) {
				sum += b[i];
			}
			else if (sum > a[pos]) {
				bolonok = 1;
				break;
			}
			else {
				if (pos == n) break;
				pos++;
				sum = 0;
				sum += b[i];
			}
		}
		if (pos <= n) {
			if (sum == a[pos]) pos++;
		}
		if (bolonok or pos != (n + 1)) {
			continue;
		}
		return cout << "YES\n", 0;
	}while (next_permutation(b + 1, b + m + 1));
	cout << "NO\n";
}
/*
██╗░░██╗░█████╗░██╗░░░░░██╗░░░██╗███╗░░░███╗██████╗░░█████╗░░█████╗░███████╗
██║░░██║██╔══██╗██║░░░░░╚██╗░██╔╝████╗░████║╚════██╗██╔══██╗██╔══██╗╚════██║
███████║███████║██║░░░░░░╚████╔╝░██╔████╔██║░░███╔═╝██║░░██║██║░░██║░░░░██╔╝
██╔══██║██╔══██║██║░░░░░░░╚██╔╝░░██║╚██╔╝██║██╔══╝░░██║░░██║██║░░██║░░░██╔╝░
██║░░██║██║░░██║███████╗░░░██║░░░██║░╚═╝░██║███████╗╚█████╔╝╚█████╔╝░░██╔╝░░
╚═╝░░╚═╝╚═╝░░╚═╝╚══════╝░░░╚═╝░░░╚═╝░░░░░╚═╝╚══════╝░╚════╝░░╚════╝░░░╚═╝░░░
*/

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:34:13: warning: 'sum' may be used uninitialized in this function [-Wmaybe-uninitialized]
   34 |    for (int j = sum - b[i]; j >= 0; j--) {
      |             ^

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 19412 KB Output is correct
2 Correct 24 ms 19396 KB Output is correct
3 Correct 44 ms 19412 KB Output is correct
4 Correct 61 ms 19412 KB Output is correct
5 Correct 85 ms 19320 KB Output is correct
6 Correct 42 ms 19412 KB Output is correct
7 Correct 47 ms 19412 KB Output is correct
8 Correct 77 ms 19416 KB Output is correct
9 Correct 77 ms 19412 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 316 KB Output is correct
5 Correct 20 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 2 ms 212 KB Output is correct
9 Correct 34 ms 296 KB Output is correct
10 Correct 3 ms 212 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1062 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 19412 KB Output is correct
2 Correct 24 ms 19396 KB Output is correct
3 Correct 44 ms 19412 KB Output is correct
4 Correct 61 ms 19412 KB Output is correct
5 Correct 85 ms 19320 KB Output is correct
6 Correct 42 ms 19412 KB Output is correct
7 Correct 47 ms 19412 KB Output is correct
8 Correct 77 ms 19416 KB Output is correct
9 Correct 77 ms 19412 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 4 ms 316 KB Output is correct
14 Correct 20 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 2 ms 212 KB Output is correct
18 Correct 34 ms 296 KB Output is correct
19 Correct 3 ms 212 KB Output is correct
20 Execution timed out 1062 ms 212 KB Time limit exceeded
21 Halted 0 ms 0 KB -