oj.uz

Submission #871395

# Submission time Handle Problem Language Result Execution time Memory
871395 2023-11-10T17:15:39 Z anarch_y Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 62292 KB 
#include <bits/stdc++.h>
#pragma GCC target("popcnt")
using namespace std;
using ll = long long;
#define all(x) begin(x), end(x)
#define pb push_back

int main(){
    ios::sync_with_stdio(false);
	cin.tie(nullptr);

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

    if(n==1){
        int t = a[0];
        int dp[t+1][m+1] = {};
        for(int j=0; j<=m; j++) dp[0][j] = 1;
        for(int v=1; v<=t; v++){
            for(int i=1; i<=m; i++){
                dp[v][i] = dp[v][i-1];
                if(v-b[i-1]>=0) dp[v][i] |= dp[v-b[i-1]][i-1];
            }
        }
        if(dp[t][m]) cout << "YES";
        else cout << "NO";
        return 0;
    }

    vector<int> arr[1001];
    for(int s=0; s<(1<<m); s++){
        int t = 0;
        for(int p=0; p<m; p++){
            if(s&(1<<p)) t+=b[p];
        }
        if(t<=1000) arr[t].pb(s); 
    }
    
    vector<vector<int>> dp((1<<m), vector<int>(n+1, 0));
    for(int s=0; s<(1<<m); s++){
        dp[s][0] = 1;
    }
    for(int i=1; i<=n; i++){
        int t = a[i-1];
        for(int s=0; s<(1<<m); s++){
            for(auto u: arr[t]){
                if((s&u)==u){
                    dp[s][i] |= dp[s^u][i-1];
                }
            }
        }
    }

    if(dp[(1<<m)-1][n]) cout << "YES";
    else cout << "NO";

}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1628 KB Output is correct
2 Correct 2 ms 1244 KB Output is correct
3 Correct 3 ms 1884 KB Output is correct
4 Correct 4 ms 2148 KB Output is correct
5 Correct 3 ms 1884 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 2 ms 1372 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 2 ms 1628 KB Output is correct
11 Correct 3 ms 2140 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 1628 KB Output is correct
21 Correct 2 ms 1244 KB Output is correct
22 Correct 3 ms 1884 KB Output is correct
23 Correct 4 ms 2148 KB Output is correct
24 Correct 3 ms 1884 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 2 ms 1372 KB Output is correct
27 Correct 2 ms 1372 KB Output is correct
28 Correct 2 ms 1628 KB Output is correct
29 Correct 2 ms 1628 KB Output is correct
30 Correct 3 ms 2140 KB Output is correct
31 Execution timed out 1070 ms 62292 KB Time limit exceeded
32 Halted 0 ms 0 KB -