oj.uz

답안 #677832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677832 2023-01-04T12:24:28 Z vjudge1 은행 (IZhO14_bank) C++17
100 / 100
 180 ms 111032 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define piii pair<pii, int>
#define pllll pair<ll, ll>
#define pb push_back
#define all(v) v.begin(), v.end()
#define size(v) v.size()
#define INF 2e18
#define f first
#define s second
 
using namespace std;
 
 
int n, m;
vector<int>costMask[30005];
int dp[2000000][25];
vector<int>a, b;
 
int Bank(int mask, int i){
    if(i == 0) return 1;
    if(dp[mask][i] != -1) return dp[mask][i];
 
    for(int Submask : costMask[a[i]]){
        if((mask & Submask) == Submask){
            if(Bank(mask ^ Submask, i - 1)){
                return dp[mask][i] = 1;
            }
        }
    }
    return dp[mask][i] = 0;
}
 
void solve(){
 
    cin >> n >> m;
    a.resize(n + 1), b.resize(m + 1);
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
    }for(int i = 1; i <= m; ++i){
        cin >> b[i];
    }
    for(int mask = 0; mask < (1 << m); ++mask){
        int Total = 0;
        for(int i = 0; i < m; ++i){
            if(mask & (1 << i)){
                Total += b[i + 1];
            }
        }
        costMask[Total].pb(mask);
    }
    for(int mask = 0; mask < (1 << m); mask++){
        for(int i = 1; i <= n; ++i){
            dp[mask][i] = -1;
        }
    }
 
    if(Bank((1 << m) - 1, n)) cout << "YES\n";
    else cout << "NO\n";
}
 
int main(){
    int t;
    t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 104 ms 110048 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 114 ms 109060 KB Output is correct
9 Correct 125 ms 109372 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 5 ms 4436 KB Output is correct
5 Correct 104 ms 110048 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 114 ms 109060 KB Output is correct
9 Correct 125 ms 109372 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 2 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 2 ms 1012 KB Output is correct
20 Correct 3 ms 2772 KB Output is correct
21 Correct 3 ms 2772 KB Output is correct
22 Correct 4 ms 2696 KB Output is correct
23 Correct 3 ms 2644 KB Output is correct
24 Correct 4 ms 2772 KB Output is correct
25 Correct 4 ms 2772 KB Output is correct
26 Correct 3 ms 2772 KB Output is correct
27 Correct 3 ms 2772 KB Output is correct
28 Correct 3 ms 2772 KB Output is correct
29 Correct 3 ms 2772 KB Output is correct
30 Correct 3 ms 2644 KB Output is correct
31 Correct 103 ms 110084 KB Output is correct
32 Correct 107 ms 109240 KB Output is correct
33 Correct 110 ms 109704 KB Output is correct
34 Correct 111 ms 110116 KB Output is correct
35 Correct 112 ms 111032 KB Output is correct
36 Correct 110 ms 110588 KB Output is correct
37 Correct 108 ms 110944 KB Output is correct
38 Correct 111 ms 110624 KB Output is correct
39 Correct 103 ms 108528 KB Output is correct
40 Correct 104 ms 110540 KB Output is correct
41 Correct 107 ms 109908 KB Output is correct
42 Correct 106 ms 109160 KB Output is correct
43 Correct 110 ms 110736 KB Output is correct
44 Correct 113 ms 110972 KB Output is correct
45 Correct 103 ms 109772 KB Output is correct
46 Correct 114 ms 110852 KB Output is correct
47 Correct 114 ms 110444 KB Output is correct
48 Correct 102 ms 109244 KB Output is correct
49 Correct 101 ms 109524 KB Output is correct
50 Correct 102 ms 108560 KB Output is correct
51 Correct 127 ms 109380 KB Output is correct
52 Correct 180 ms 108488 KB Output is correct
53 Correct 106 ms 108432 KB Output is correct
54 Correct 104 ms 108556 KB Output is correct
55 Correct 104 ms 108524 KB Output is correct
56 Correct 107 ms 108492 KB Output is correct
57 Correct 120 ms 108500 KB Output is correct
58 Correct 103 ms 108568 KB Output is correct