oj.uz

Submission #340715

# Submission time Handle Problem Language Result Execution time Memory
340715 2020-12-28T09:15:20 Z talant117408 Bank (IZhO14_bank) C++17
100 / 100
 749 ms 54892 KB 
/*
    Code written by Talant I.D.
*/
  
#include <bits/stdc++.h>
  
using namespace std;
  
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int salary[21], banknotes[21];
int dp[21][1 << 21], n, m;
vector <vector <int>> elig(21);

void rec(int ind, int mask){
    if(ind == n){
        dp[ind][mask] = 1;
        return ;
    }
    if(dp[ind][mask]) return;
    dp[ind][mask] = 1;
    for(int i = 0; i < sz(elig[ind]); i++){
        if((mask&elig[ind][i]) == 0){
            rec(ind+1, mask^elig[ind][i]);
        }
    }
}
    
int main(){
    do_not_disturb
    
    cin >> n >> m;
    
    for(int i = 0; i < n; i++){
        cin >> salary[i];
    }
    for(int i = 0; i < m; i++){
        cin >> banknotes[i];
    }
    
    for(int mask = 0; mask < (1<<m); mask++){
        int sum = 0;
        for(int i = 0; i < m; i++){
            if(mask&(1<<i)){
                sum += banknotes[i];
            }
        }
        for(int i = 0; i < n; i++){
            if(salary[i] == sum){
                elig[i].pb(mask);
            }
        }
    }
    
    rec(0, 0);
    int flag = 0;
    for(int mask = 0; mask < (1<<m); mask++){
        flag += dp[n][mask];
    }
    if(flag)
     cout << "YES";
    else cout << "NO";
    
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 67 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 70 ms 4460 KB Output is correct
9 Correct 70 ms 364 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 67 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 70 ms 4460 KB Output is correct
9 Correct 70 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 76 ms 2540 KB Output is correct
32 Correct 180 ms 8204 KB Output is correct
33 Correct 79 ms 2028 KB Output is correct
34 Correct 79 ms 620 KB Output is correct
35 Correct 78 ms 492 KB Output is correct
36 Correct 86 ms 620 KB Output is correct
37 Correct 68 ms 364 KB Output is correct
38 Correct 70 ms 364 KB Output is correct
39 Correct 122 ms 16900 KB Output is correct
40 Correct 80 ms 400 KB Output is correct
41 Correct 86 ms 364 KB Output is correct
42 Correct 86 ms 10404 KB Output is correct
43 Correct 75 ms 1132 KB Output is correct
44 Correct 83 ms 492 KB Output is correct
45 Correct 79 ms 8832 KB Output is correct
46 Correct 75 ms 3948 KB Output is correct
47 Correct 82 ms 492 KB Output is correct
48 Correct 68 ms 3692 KB Output is correct
49 Correct 68 ms 364 KB Output is correct
50 Correct 357 ms 54892 KB Output is correct
51 Correct 79 ms 748 KB Output is correct
52 Correct 86 ms 6764 KB Output is correct
53 Correct 749 ms 28780 KB Output is correct
54 Correct 410 ms 52588 KB Output is correct
55 Correct 366 ms 54892 KB Output is correct
56 Correct 390 ms 54636 KB Output is correct
57 Correct 405 ms 50796 KB Output is correct
58 Correct 381 ms 50716 KB Output is correct