oj.uz

Submission #442633

# Submission time Handle Problem Language Result Execution time Memory
442633 2021-07-08T11:31:55 Z leaked Bank (IZhO14_bank) C++14
100 / 100
 966 ms 150960 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("-O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define vec vector
#define sz(x) ( int)x.size()
#define m_p make_pair
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

using namespace std;

typedef long long ll;
typedef pair<ll, int> pli;
typedef pair<int,ll> pil;
typedef pair<int,int> pii;
typedef unsigned long long ull;
auto rng=bind(uniform_int_distribution<int>(1,1000),mt19937(time(0)));
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
template<class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
const int Mx=1e3;
const int N=20;
//vec<int> w[Mx];
int dp[21][1<<N];
int a[N],b[N],n,m;
vec<int>z[1<<N];
void rec(int i,int x,int mask){
    if(i==n){
        cout<<"YES";
        exit(0);
    }
    if(x==0){
        return rec(i+1,a[i+1],mask);
    }
    if(dp[i][mask]) return;
    dp[i][mask]=1;
    for(auto &j : z[mask]){
        if(b[j]<=x){
            rec(i,x-b[j],mask|(1<<j));
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//    int n,m;
//    n=20;m=20;
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>a[i];
    for(int j=0;j<m;j++){
        cin>>b[j];
    }
    for(int i=0;i<(1<<m);i++){
        for(int j=0;j<m;j++){
            if(i&(1<<j)) continue;
            z[i].pb(j);
        }
    }
    rec(0,a[0],0);
    cout<<"NO";
    return 0;
}

/*
1 5
8
4 2 5 1 3

2 4
4 5
2 2 1 4
*/

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 24908 KB Output is correct
2 Correct 16 ms 24948 KB Output is correct
3 Correct 16 ms 24880 KB Output is correct
4 Correct 25 ms 26740 KB Output is correct
5 Correct 335 ms 98748 KB Output is correct
6 Correct 16 ms 24908 KB Output is correct
7 Correct 18 ms 25012 KB Output is correct
8 Correct 351 ms 98916 KB Output is correct
9 Correct 784 ms 102852 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24908 KB Output is correct
2 Correct 18 ms 24984 KB Output is correct
3 Correct 16 ms 24980 KB Output is correct
4 Correct 16 ms 25036 KB Output is correct
5 Correct 17 ms 24952 KB Output is correct
6 Correct 16 ms 24908 KB Output is correct
7 Correct 17 ms 24948 KB Output is correct
8 Correct 17 ms 25036 KB Output is correct
9 Correct 16 ms 24908 KB Output is correct
10 Correct 17 ms 24996 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 25932 KB Output is correct
2 Correct 21 ms 25804 KB Output is correct
3 Correct 21 ms 26012 KB Output is correct
4 Correct 21 ms 25780 KB Output is correct
5 Correct 20 ms 25804 KB Output is correct
6 Correct 23 ms 25804 KB Output is correct
7 Correct 20 ms 25860 KB Output is correct
8 Correct 21 ms 25932 KB Output is correct
9 Correct 21 ms 25840 KB Output is correct
10 Correct 21 ms 25792 KB Output is correct
11 Correct 22 ms 25860 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 24908 KB Output is correct
2 Correct 16 ms 24948 KB Output is correct
3 Correct 16 ms 24880 KB Output is correct
4 Correct 25 ms 26740 KB Output is correct
5 Correct 335 ms 98748 KB Output is correct
6 Correct 16 ms 24908 KB Output is correct
7 Correct 18 ms 25012 KB Output is correct
8 Correct 351 ms 98916 KB Output is correct
9 Correct 784 ms 102852 KB Output is correct
10 Correct 16 ms 24908 KB Output is correct
11 Correct 18 ms 24984 KB Output is correct
12 Correct 16 ms 24980 KB Output is correct
13 Correct 16 ms 25036 KB Output is correct
14 Correct 17 ms 24952 KB Output is correct
15 Correct 16 ms 24908 KB Output is correct
16 Correct 17 ms 24948 KB Output is correct
17 Correct 17 ms 25036 KB Output is correct
18 Correct 16 ms 24908 KB Output is correct
19 Correct 17 ms 24996 KB Output is correct
20 Correct 21 ms 25932 KB Output is correct
21 Correct 21 ms 25804 KB Output is correct
22 Correct 21 ms 26012 KB Output is correct
23 Correct 21 ms 25780 KB Output is correct
24 Correct 20 ms 25804 KB Output is correct
25 Correct 23 ms 25804 KB Output is correct
26 Correct 20 ms 25860 KB Output is correct
27 Correct 21 ms 25932 KB Output is correct
28 Correct 21 ms 25840 KB Output is correct
29 Correct 21 ms 25792 KB Output is correct
30 Correct 22 ms 25860 KB Output is correct
31 Correct 340 ms 98756 KB Output is correct
32 Correct 338 ms 98808 KB Output is correct
33 Correct 344 ms 102000 KB Output is correct
34 Correct 344 ms 99104 KB Output is correct
35 Correct 342 ms 100036 KB Output is correct
36 Correct 340 ms 99012 KB Output is correct
37 Correct 349 ms 99244 KB Output is correct
38 Correct 336 ms 98628 KB Output is correct
39 Correct 335 ms 98668 KB Output is correct
40 Correct 335 ms 98908 KB Output is correct
41 Correct 335 ms 98852 KB Output is correct
42 Correct 527 ms 113732 KB Output is correct
43 Correct 351 ms 105028 KB Output is correct
44 Correct 339 ms 98668 KB Output is correct
45 Correct 343 ms 98972 KB Output is correct
46 Correct 355 ms 102360 KB Output is correct
47 Correct 341 ms 99140 KB Output is correct
48 Correct 346 ms 98792 KB Output is correct
49 Correct 339 ms 98756 KB Output is correct
50 Correct 345 ms 98884 KB Output is correct
51 Correct 335 ms 99312 KB Output is correct
52 Correct 335 ms 98804 KB Output is correct
53 Correct 336 ms 98780 KB Output is correct
54 Correct 336 ms 98800 KB Output is correct
55 Correct 342 ms 98880 KB Output is correct
56 Correct 339 ms 98928 KB Output is correct
57 Correct 966 ms 150960 KB Output is correct
58 Correct 341 ms 98856 KB Output is correct