oj.uz

Submission #504310

# Submission time Handle Problem Language Result Execution time Memory
504310 2022-01-10T04:02:06 Z RandomLB Bank (IZhO14_bank) C++17
100 / 100
 188 ms 14392 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<double, double> point;
typedef tuple<ll, ll, ll> tp;
typedef priority_queue<pll, vector<pll>, greater<pll>> djk;
#define pb push_back
#define ms(a,b) memset(a,b,sizeof(a));
#define maxE(a) *max_element(a, a+sizeof(a)/sizeof(a[0]))
#define minE(a) *min_element(a, a+sizeof(a)/sizeof(a[0]))
#define F first
#define S second
#define siz(a) (int)a.size()
#define len(a) (int)a.length()
#define all(x) (x).begin(), (x).end()
#define bits(x) __builtin_popcount(x)
#define bin(a, x) bitset<a>(x)
#define vvll vector<vector<ll>>
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cout << vars << " = ";
    string delim = "";
    (..., (cout << delim << values, delim = ", "));
    cout << endl;
}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 1e9+7;
const double pie = 2*acos(0.0);
//------------------------------------------------------------
vector<int> moves[20];
int item[20], val[20], n, m;
bool vis[20][1<<20], dp[20][1<<20];

bool solve(int curr, int mask){
    if (curr == n) return true;
    if (vis[curr][mask]) return dp[curr][mask];
    vis[curr][mask] = true;
    for (int take: moves[curr]){
        //deb(bin(5, mask), bin(5, take));
        if ((mask&take) != take) continue;
        if (solve(curr+1, mask^take)){
            dp[curr][mask] = true;
            break;
        }
    }
    return dp[curr][mask];
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    //freopen("test.txt", "r", stdin);
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> item[i];
    for (int i = 0; i < m; i++) cin >> val[i];
    for (int mask = 0; mask < 1<<m; mask++){
        int sum = 0;
        for (int i = 0; i < m; i++){
            if (mask & (1<<i)) sum += val[i];
        }
        for (int i = 0; i < n; i++) if (sum == item[i]) moves[i].pb(mask);
    }
    cout << (solve(0, (1<<m)-1)? "YES" : "NO") << "\n";
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 316 KB Output is correct
5 Correct 54 ms 296 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 55 ms 340 KB Output is correct
9 Correct 57 ms 296 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 316 KB Output is correct
5 Correct 54 ms 296 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 55 ms 340 KB Output is correct
9 Correct 57 ms 296 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 320 KB Output is correct
31 Correct 62 ms 384 KB Output is correct
32 Correct 57 ms 476 KB Output is correct
33 Correct 63 ms 308 KB Output is correct
34 Correct 69 ms 424 KB Output is correct
35 Correct 74 ms 324 KB Output is correct
36 Correct 75 ms 440 KB Output is correct
37 Correct 54 ms 296 KB Output is correct
38 Correct 57 ms 304 KB Output is correct
39 Correct 61 ms 304 KB Output is correct
40 Correct 63 ms 296 KB Output is correct
41 Correct 72 ms 316 KB Output is correct
42 Correct 74 ms 3652 KB Output is correct
43 Correct 62 ms 952 KB Output is correct
44 Correct 66 ms 296 KB Output is correct
45 Correct 57 ms 308 KB Output is correct
46 Correct 65 ms 324 KB Output is correct
47 Correct 82 ms 432 KB Output is correct
48 Correct 57 ms 432 KB Output is correct
49 Correct 54 ms 316 KB Output is correct
50 Correct 71 ms 432 KB Output is correct
51 Correct 77 ms 472 KB Output is correct
52 Correct 72 ms 452 KB Output is correct
53 Correct 81 ms 452 KB Output is correct
54 Correct 69 ms 436 KB Output is correct
55 Correct 75 ms 436 KB Output is correct
56 Correct 83 ms 432 KB Output is correct
57 Correct 188 ms 14392 KB Output is correct
58 Correct 71 ms 444 KB Output is correct