oj.uz

답안 #679275

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679275 2023-01-08T01:32:43 Z Hacv16 은행 (IZhO14_bank) C++17
27 / 100
 1000 ms 7336 KB 
#include<bits/stdc++.h>
using namespace std;

const int MAX = 21;
const int MAXM = 30005;
const int INF = 0x3f3f3f3f;

int n, m, a[MAX], b[MAX];
bool dp[MAX][1 << MAX];
vector<int> g[MAXM];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;

    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];

    for(int mask = 0; mask < (1 << m); mask++){
        int cur = 0;

        for(int i = 0; i < m; i++)
            if(mask & (1 << i)) cur += b[i];

        g[cur].push_back(mask);   
    }

    dp[0][0] = true;

    for(int i = 1; i <= n; i++){
        for(int mask = 0; mask < (1 << m); mask++){
            int curVal = a[i];

            for(auto sub : g[curVal])
                dp[i][mask] |= dp[i - 1][mask ^ sub];
        }
    }

    bool pos = false;

    for(int mask = 0; mask < (1 << m); mask++)
        pos |= dp[n][mask];

    cout << (pos ? "YES" : "NO") << '\n';

    exit(0);
}

Subtask #1
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 980 KB Output is correct
4 Correct 7 ms 1232 KB Output is correct
5 Correct 62 ms 7336 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Execution timed out 1094 ms 6628 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 25.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 980 KB Output is correct
4 Incorrect 1 ms 980 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

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

Subtask #4
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 980 KB Output is correct
4 Correct 7 ms 1232 KB Output is correct
5 Correct 62 ms 7336 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Execution timed out 1094 ms 6628 KB Time limit exceeded
9 Halted 0 ms 0 KB -