oj.uz

답안 #835274

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
835274 2023-08-23T11:34:34 Z Anthony_Liu 은행 (IZhO14_bank) C++11
100 / 100
 91 ms 8540 KB 
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//#pragma GCC optimization ("unroll-loops")
#define f first
#define s second
#define ll long long
#define pb push_back
#define pi pair <int,int>
#define vi vector <int>
#define size(x) (int)(x).size()
#define all(x) x.begin(), x.end()
void setIO(string name = "") {
	cin.tie(0)->sync_with_stdio(0);
	if (size(name)) {
		freopen((name + ".in").c_str(), "r", stdin);
		freopen((name + ".out").c_str(), "w", stdout);
	}
}

int N, M;
vi a, b;

int main()
{
	//setIO();
	cin >> N >> M;
	a.resize(N);
	b.resize(M);
	for (auto &ww : a) cin >> ww;
	for (auto &ww : b) cin >> ww;
	
	vector <pi> dp(1 << M, make_pair(INT_MAX, 0)); 
	//on '.f' th person, that person already paid '.s'
	dp[0] = {0, 0};
	
	for (int mask = 0; mask < (1 << M); mask++) {
		for (int i = 0; i < M; i++) {
			if (mask & (1 << i)) continue;
			int newmask = mask | (1 << i);
			
			int nf = dp[mask].f;
			if (nf == INT_MAX) continue;
			int ns = dp[mask].s + b[i];
			
			if (ns > a[nf]) continue;
			if (ns == a[nf]) {
				nf++;
				if (nf == N) {
					cout << "YES\n";
					return 0;
				}
				ns = 0;
			}
			
			if (make_pair(nf, ns) < dp[newmask]) 
				dp[newmask] = {nf, ns};
		}
	}
	
	cout << "NO\n";
	return 0;
}

Compilation message

bank.cpp: In function 'void setIO(std::string)':
bank.cpp:17:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:18:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 300 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 468 KB Output is correct
5 Correct 71 ms 8504 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 91 ms 8504 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 288 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 300 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 468 KB Output is correct
5 Correct 71 ms 8504 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 91 ms 8504 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 288 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 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 428 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 51 ms 8504 KB Output is correct
32 Correct 45 ms 8500 KB Output is correct
33 Correct 37 ms 8404 KB Output is correct
34 Correct 42 ms 8488 KB Output is correct
35 Correct 66 ms 8504 KB Output is correct
36 Correct 68 ms 8504 KB Output is correct
37 Correct 69 ms 8404 KB Output is correct
38 Correct 73 ms 8500 KB Output is correct
39 Correct 5 ms 8408 KB Output is correct
40 Correct 66 ms 8508 KB Output is correct
41 Correct 72 ms 8504 KB Output is correct
42 Correct 86 ms 8404 KB Output is correct
43 Correct 76 ms 8500 KB Output is correct
44 Correct 67 ms 8500 KB Output is correct
45 Correct 4 ms 8404 KB Output is correct
46 Correct 39 ms 8404 KB Output is correct
47 Correct 68 ms 8504 KB Output is correct
48 Correct 4 ms 8404 KB Output is correct
49 Correct 70 ms 8404 KB Output is correct
50 Correct 42 ms 8404 KB Output is correct
51 Correct 52 ms 8504 KB Output is correct
52 Correct 41 ms 8404 KB Output is correct
53 Correct 50 ms 8500 KB Output is correct
54 Correct 46 ms 8404 KB Output is correct
55 Correct 45 ms 8480 KB Output is correct
56 Correct 54 ms 8492 KB Output is correct
57 Correct 82 ms 8500 KB Output is correct
58 Correct 44 ms 8540 KB Output is correct