oj.uz

Submission #165769

# Submission time Handle Problem Language Result Execution time Memory
165769 2019-11-28T14:28:46 Z Mercenary Bank (IZhO14_bank) C++14
100 / 100
 252 ms 14588 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 2e5 + 5;
const int logn = log2(maxn) + 1;

const int mod = 1e9 + 7;
int n , m;
int a[maxn] , b[maxn];
vector<int> can[21];
bool dp[21][1 << 20];
void dfs(int u , int mask){
    if(u == n){
        cout << "YES";
        exit(0);
    }
    if(dp[u][mask])return;
    dp[u][mask] = 1;
    for(int c : can[u + 1]){
        if(!(c & mask))dfs(u + 1 , mask | c);
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    srand(time(0));
    cin >> n >> m;
    for(int i = 1 ; i <= n ; ++i){
        cin >> a[i];
    }
    for(int i = 0 ; i < m ; ++i){
        cin >> b[i];
    }
    for(int i = 1 ; i < (1 << m) ; ++i){
        int s = 0;
        for(int j = 0 ; j < m ; ++j){
            if(i & (1 << j))s += b[j];
        }
        for(int j = 1 ; j <= n ; ++j){
            if(a[j] == s)can[j].pb(i);
        }
    }
    dfs(0,0);
    cout << "NO";
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:41:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:42:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 81 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 82 ms 380 KB Output is correct
9 Correct 83 ms 376 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 81 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 82 ms 380 KB Output is correct
9 Correct 83 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 14 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 248 KB Output is correct
20 Correct 4 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 4 ms 376 KB Output is correct
28 Correct 4 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 9 ms 348 KB Output is correct
31 Correct 82 ms 504 KB Output is correct
32 Correct 86 ms 476 KB Output is correct
33 Correct 91 ms 404 KB Output is correct
34 Correct 93 ms 428 KB Output is correct
35 Correct 95 ms 376 KB Output is correct
36 Correct 103 ms 504 KB Output is correct
37 Correct 82 ms 504 KB Output is correct
38 Correct 87 ms 376 KB Output is correct
39 Correct 91 ms 376 KB Output is correct
40 Correct 92 ms 376 KB Output is correct
41 Correct 102 ms 376 KB Output is correct
42 Correct 94 ms 3832 KB Output is correct
43 Correct 91 ms 1016 KB Output is correct
44 Correct 97 ms 376 KB Output is correct
45 Correct 84 ms 404 KB Output is correct
46 Correct 88 ms 376 KB Output is correct
47 Correct 97 ms 376 KB Output is correct
48 Correct 80 ms 428 KB Output is correct
49 Correct 80 ms 380 KB Output is correct
50 Correct 102 ms 400 KB Output is correct
51 Correct 92 ms 632 KB Output is correct
52 Correct 93 ms 504 KB Output is correct
53 Correct 93 ms 504 KB Output is correct
54 Correct 103 ms 504 KB Output is correct
55 Correct 102 ms 404 KB Output is correct
56 Correct 104 ms 504 KB Output is correct
57 Correct 252 ms 14588 KB Output is correct
58 Correct 101 ms 504 KB Output is correct