oj.uz

Submission #761747

# Submission time Handle Problem Language Result Execution time Memory
761747 2023-06-20T08:50:17 Z Alora Bank (IZhO14_bank) C++17
46 / 100
 48 ms 364 KB 
#include <bits/stdc++.h>
#define name "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define pb push_back
#define all(v) v.begin(), v.end()
#define maxn
const int M = 1e9 + 7;
using namespace std;
int n, m, id[1003], a[22];
bool dp[22][1 << 20];
vector <int> luu[22];

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
  //  freopen(name".in", "r", stdin);
  //  freopen(name".out", "w", stdout);
    cin >> n >> m;
    fi(i, 1, n){
        int x; cin >> x;
        id[x] = i;
    }
    fi(i, 1, m) cin >> a[i];

    fi(msk, 1, (1 << m) - 1){
        int sum = 0;
        fi(i, 0, m - 1) if(getbit(msk, i)) sum += a[i + 1];
        if(sum <= 1000 && id[sum] != 0) luu[id[sum]].pb(msk);
    }
    fi(i, 1, n) if(luu[i].size() == 0) {cout << "NO"; return 0;}

    vector <int> pre;
    pre.pb(0);
    fi(i, 1, n){
        vector <int> tmp;
        for(auto msk: pre){
            for(auto tt: luu[i]) if((msk & tt) == 0){
                tmp.pb(msk + tt);
            }
        }
        if(i == n && tmp.size() != 0) {cout << "YES"; return 0;}
        swap(pre, tmp);
    }

    cout << "NO";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 48 ms 308 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 48 ms 364 KB Output is correct
9 Correct 48 ms 212 KB Output is correct

Subtask #2
0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 48 ms 308 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 48 ms 364 KB Output is correct
9 Correct 48 ms 212 KB Output is correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -