oj.uz

Submission #969226

# Submission time Handle Problem Language Result Execution time Memory
969226 2024-04-24T17:14:38 Z biank Bank (IZhO14_bank) C++14
0 / 100
 1000 ms 13400 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(x) int(x.size())
#define all(x) begin(x),end(x)
#define forsn(i,s,n) for(int i=int(s);i<int(n);i++)
#define forn(i,n) for(int i=0;i<int(n);i++)
#define dforsn(i,s,n) for(int i=int(n)-1;i>=int(s);i--)
#define dforn(i,n) for(int i=int(n)-1;i>=0;i--)

#define fst first
#define snd second
#define pb push_back
#define eb emplace_back

typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;

//const int MAXN = 2e5+5;
//const ll INF = 1e18;
const int MOD = 1e9+7;

template<class x> ostream & operator<<(ostream & out, vector<x> v){
    out<<"[ ";
    for(auto y : v) out<<y<<" ";
    out<<"]";
    return out;
}

int sum[1 << 20];
bool dp[21][1 << 20];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    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];
    }
    vector<int> s[1001];
    for (int mask = 1; mask < 1 << m; mask++) {
        if (mask != 0) {
            int i = __builtin_ctz(mask);
            sum[mask] = sum[mask ^ (1 << i)] + b[i];
        }
        if (sum[mask] <= 1000) {
            s[sum[mask]].push_back(mask);
        }
        dp[0][mask] = true;
    }
    for (int i = 0; i < n; i++) {
        for (int mask = 0; mask < 1 << m; mask++) {
            for (int submask : s[a[i]]) {
                if ((mask & submask) == submask && dp[i][mask ^ submask]) {
                    dp[i + 1][mask] = true;
                    break;
                }
            }
        }
    }
    bool ans = false;
    for (int mask = 0; mask < 1 << m; mask++) {
        ans |= dp[n][mask];
    }
    if (ans) cout << "YES\n";
    else cout << "NO\n";
    
    return 0;
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 3 ms 2908 KB Output is correct
5 Correct 10 ms 13400 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Execution timed out 1063 ms 12124 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 3 ms 2908 KB Output is correct
5 Correct 10 ms 13400 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Execution timed out 1063 ms 12124 KB Time limit exceeded
9 Halted 0 ms 0 KB -