oj.uz

답안 #972804

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972804 2024-05-01T08:03:28 Z saidpon 은행 (IZhO14_bank) C++14
71 / 100
 1000 ms 35856 KB 
#include <bits/stdc++.h>
#define ordered_set tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nemeshay ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define allr(pon) pon.rbegin(), pon.rend()
#include <ext/pb_ds/assoc_container.hpp>
#define all(pon) pon.begin(), pon.end()
#include <ext/pb_ds/tree_policy.hpp>
#define pii pair <int, int>
#define nosolve puts("-1")
#define YES puts("YES")
#define pb push_back
#define pf push_front
#define int long long
#define OK puts("OK")
#define NO puts("NO")
#define sigma signed
#define sc second
#define fr first
using namespace __gnu_pbds;
using namespace std;
const int N = 1e6 + 20, INF = 2e9 + 7;
int a[N], b[N], dp[N];
vector <int> pon[N];
sigma main(){
    nemeshay
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    for (int i = 0; i < n; i++){
        for (int l = 0; l < (1 << m); l++){
            int sum = 0;
            for (int j = 0; j < m; j++){
                if (l & (1 << j)) sum += b[j];
            }
            if (sum == a[i]) pon[i].pb(l);
        }
    }
    for (int i = 1; i < N; i++) dp[i] = -1;
    for (int i = 0; i < n; i++){
        for (int l = (1 << m) - 1; l >= 0; l--){
            if (dp[l] != -1){
                for (auto j: pon[i]){
                    if (!(l & j)){
                        dp[l | j] = dp[l] + 1;
                    }
                    if (dp[l | j] == n){
                        YES;
                        return 0;
                    }
                }
            }
        }
    }
    NO;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35420 KB Output is correct
2 Correct 8 ms 35420 KB Output is correct
3 Correct 8 ms 35420 KB Output is correct
4 Correct 11 ms 35420 KB Output is correct
5 Correct 76 ms 35412 KB Output is correct
6 Correct 8 ms 35420 KB Output is correct
7 Correct 8 ms 35416 KB Output is correct
8 Correct 86 ms 35624 KB Output is correct
9 Correct 73 ms 35488 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 35512 KB Output is correct
2 Correct 10 ms 35420 KB Output is correct
3 Correct 18 ms 35508 KB Output is correct
4 Correct 21 ms 35516 KB Output is correct
5 Correct 17 ms 35420 KB Output is correct
6 Correct 14 ms 35420 KB Output is correct
7 Correct 13 ms 35420 KB Output is correct
8 Correct 13 ms 33628 KB Output is correct
9 Correct 16 ms 35676 KB Output is correct
10 Correct 14 ms 35420 KB Output is correct
11 Correct 23 ms 35420 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35420 KB Output is correct
2 Correct 8 ms 35420 KB Output is correct
3 Correct 8 ms 35420 KB Output is correct
4 Correct 11 ms 35420 KB Output is correct
5 Correct 76 ms 35412 KB Output is correct
6 Correct 8 ms 35420 KB Output is correct
7 Correct 8 ms 35416 KB Output is correct
8 Correct 86 ms 35624 KB Output is correct
9 Correct 73 ms 35488 KB Output is correct
10 Correct 8 ms 35420 KB Output is correct
11 Correct 9 ms 35416 KB Output is correct
12 Correct 8 ms 35672 KB Output is correct
13 Correct 9 ms 35416 KB Output is correct
14 Correct 8 ms 35432 KB Output is correct
15 Correct 8 ms 35420 KB Output is correct
16 Correct 8 ms 35420 KB Output is correct
17 Correct 9 ms 35420 KB Output is correct
18 Correct 8 ms 35420 KB Output is correct
19 Correct 8 ms 35468 KB Output is correct
20 Correct 15 ms 35512 KB Output is correct
21 Correct 10 ms 35420 KB Output is correct
22 Correct 18 ms 35508 KB Output is correct
23 Correct 21 ms 35516 KB Output is correct
24 Correct 17 ms 35420 KB Output is correct
25 Correct 14 ms 35420 KB Output is correct
26 Correct 13 ms 35420 KB Output is correct
27 Correct 13 ms 33628 KB Output is correct
28 Correct 16 ms 35676 KB Output is correct
29 Correct 14 ms 35420 KB Output is correct
30 Correct 23 ms 35420 KB Output is correct
31 Correct 205 ms 35408 KB Output is correct
32 Correct 520 ms 35856 KB Output is correct
33 Correct 506 ms 35744 KB Output is correct
34 Correct 690 ms 35412 KB Output is correct
35 Correct 769 ms 35412 KB Output is correct
36 Execution timed out 1082 ms 29276 KB Time limit exceeded
37 Halted 0 ms 0 KB -