답안 #752577

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752577 2023-06-03T08:49:27 Z pemguimn 은행 (IZhO14_bank) C++14
100 / 100
100 ms 8572 KB
#include <bits/stdc++.h>
// #define int long long
#define pii pair<int, int>
#define pb push_back
#define gcd __gcd
#define endl "\n"
#define task "hihi"
using namespace std;
const int N = 25, MOD = 1e9 + 7, INF = 2e9 + 5;  
int n, m, a[N], b[N];
pii dp[1 << N];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(task".inp", "r", stdin);
    //freopen(task".out", "w", stdout);
    cin >> n >> m;
    a[n] = INF;
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];
    for(int mask = 0; mask < (1 << m); mask++) dp[mask] = {-1, INF};
    dp[0] = {0, 0};
    bool check = false;
    for(int mask = 0; mask < (1 << m); mask++){
        if(dp[mask].first == -1) continue;
        for(int i = 0; i < m; i++){
            if(mask & (1 << i)) continue;
            int nxt = dp[mask].first;   
            if(a[nxt] == dp[mask].second + b[i]){
                dp[mask | (1 << i)] = max(dp[mask | (1 << i)], {dp[mask].first + 1, 0});
            } else if(dp[mask].second + b[i] < a[nxt]){
                dp[mask | (1 << i)] = max(dp[mask | (1 << i)], {dp[mask].first, dp[mask].second + b[i]});
            }
        }
        if(dp[mask].first == n) check = true;
    }
    if(check) cout << "YES";
    else cout << "NO";
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 86 ms 8420 KB Output is correct
9 Correct 81 ms 8572 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 5 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 86 ms 8420 KB Output is correct
9 Correct 81 ms 8572 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 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 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 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 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 76 ms 8512 KB Output is correct
32 Correct 100 ms 8508 KB Output is correct
33 Correct 14 ms 8404 KB Output is correct
34 Correct 6 ms 8532 KB Output is correct
35 Correct 6 ms 8532 KB Output is correct
36 Correct 5 ms 8528 KB Output is correct
37 Correct 6 ms 8524 KB Output is correct
38 Correct 6 ms 8532 KB Output is correct
39 Correct 83 ms 8532 KB Output is correct
40 Correct 6 ms 8532 KB Output is correct
41 Correct 6 ms 8516 KB Output is correct
42 Correct 57 ms 8532 KB Output is correct
43 Correct 8 ms 8532 KB Output is correct
44 Correct 5 ms 8532 KB Output is correct
45 Correct 58 ms 8540 KB Output is correct
46 Correct 28 ms 8532 KB Output is correct
47 Correct 5 ms 8520 KB Output is correct
48 Correct 75 ms 8532 KB Output is correct
49 Correct 6 ms 8524 KB Output is correct
50 Correct 74 ms 8532 KB Output is correct
51 Correct 7 ms 8520 KB Output is correct
52 Correct 10 ms 8532 KB Output is correct
53 Correct 93 ms 8532 KB Output is correct
54 Correct 78 ms 8532 KB Output is correct
55 Correct 78 ms 8524 KB Output is correct
56 Correct 73 ms 8512 KB Output is correct
57 Correct 72 ms 8516 KB Output is correct
58 Correct 75 ms 8532 KB Output is correct