oj.uz

답안 #890329

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890329 2023-12-21T03:29:55 Z ByeWorld 은행 (IZhO14_bank) C++14
100 / 100
 85 ms 8756 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define bupol __builtin_popcount
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = (1<<20)+5;
const int LOG = 20;
const int MOD = 1e9+7;
const int SQRT = 520;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;

int n, m;
int a[25], b[25];
int dp[MAXN], le[MAXN];

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i=1; i<=n; i++) cin >> a[i];
    for(int i=0; i<m; i++) cin >> b[i];
    memset(dp, -1, sizeof dp);

    dp[0] = 0; le[0] = 0;
    for(int mask=1; mask<(1<<m); mask++){
        for(int i=0; i<m; i++){
            if((mask>>i) & 1){
                int pre = mask ^ (1<<i);
                int prans = dp[pre];

                if(le[pre]+b[i] == a[prans+1]){
                    dp[mask] = prans+1;
                    le[mask] = 0;
                } else if(le[pre]+b[i] < a[prans+1]){
                    dp[mask] = prans;
                    le[mask] = le[pre]+b[i];
                }
            }
        }
        if(dp[mask] == n){
            cout << "YES\n"; exit(0);
        }
    }
    cout << "NO\n";
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6236 KB Output is correct
2 Correct 1 ms 6236 KB Output is correct
3 Correct 1 ms 6236 KB Output is correct
4 Correct 2 ms 6232 KB Output is correct
5 Correct 71 ms 6644 KB Output is correct
6 Correct 1 ms 6236 KB Output is correct
7 Correct 1 ms 6236 KB Output is correct
8 Correct 1 ms 6236 KB Output is correct
9 Correct 70 ms 8540 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6236 KB Output is correct
2 Correct 1 ms 6236 KB Output is correct
3 Correct 1 ms 6236 KB Output is correct
4 Correct 2 ms 6232 KB Output is correct
5 Correct 71 ms 6644 KB Output is correct
6 Correct 1 ms 6236 KB Output is correct
7 Correct 1 ms 6236 KB Output is correct
8 Correct 1 ms 6236 KB Output is correct
9 Correct 70 ms 8540 KB Output is correct
10 Correct 2 ms 6236 KB Output is correct
11 Correct 1 ms 6236 KB Output is correct
12 Correct 1 ms 6236 KB Output is correct
13 Correct 1 ms 6236 KB Output is correct
14 Correct 1 ms 6236 KB Output is correct
15 Correct 2 ms 6236 KB Output is correct
16 Correct 1 ms 6236 KB Output is correct
17 Correct 1 ms 6236 KB Output is correct
18 Correct 1 ms 6404 KB Output is correct
19 Correct 2 ms 6236 KB Output is correct
20 Correct 2 ms 6236 KB Output is correct
21 Correct 2 ms 6236 KB Output is correct
22 Correct 2 ms 6236 KB Output is correct
23 Correct 2 ms 6236 KB Output is correct
24 Correct 3 ms 6236 KB Output is correct
25 Correct 2 ms 6236 KB Output is correct
26 Correct 2 ms 6236 KB Output is correct
27 Correct 1 ms 6236 KB Output is correct
28 Correct 2 ms 6236 KB Output is correct
29 Correct 2 ms 6236 KB Output is correct
30 Correct 2 ms 6236 KB Output is correct
31 Correct 78 ms 8540 KB Output is correct
32 Correct 82 ms 8756 KB Output is correct
33 Correct 69 ms 8456 KB Output is correct
34 Correct 69 ms 6992 KB Output is correct
35 Correct 69 ms 6992 KB Output is correct
36 Correct 76 ms 6492 KB Output is correct
37 Correct 75 ms 6736 KB Output is correct
38 Correct 76 ms 6232 KB Output is correct
39 Correct 2 ms 6232 KB Output is correct
40 Correct 75 ms 6480 KB Output is correct
41 Correct 73 ms 6500 KB Output is correct
42 Correct 85 ms 8636 KB Output is correct
43 Correct 76 ms 7664 KB Output is correct
44 Correct 73 ms 6236 KB Output is correct
45 Correct 2 ms 6232 KB Output is correct
46 Correct 74 ms 8560 KB Output is correct
47 Correct 73 ms 6516 KB Output is correct
48 Correct 1 ms 6236 KB Output is correct
49 Correct 76 ms 6504 KB Output is correct
50 Correct 70 ms 8540 KB Output is correct
51 Correct 70 ms 6640 KB Output is correct
52 Correct 70 ms 8640 KB Output is correct
53 Correct 82 ms 8636 KB Output is correct
54 Correct 82 ms 8636 KB Output is correct
55 Correct 76 ms 8640 KB Output is correct
56 Correct 78 ms 8536 KB Output is correct
57 Correct 75 ms 8636 KB Output is correct
58 Correct 79 ms 8536 KB Output is correct