oj.uz

Submission #167206

# Submission time Handle Problem Language Result Execution time Memory
167206 2019-12-06T15:21:36 Z muhammad_hokimiyon Bank (IZhO14_bank) C++14
100 / 100
 367 ms 72696 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

#define fi first
#define se second
#define ll long long

using namespace std;

const int N = 1e6 + 7;
const int mod = 1e9 + 7;

int n,m;
int a[N];
int b[N];
int d[22][N];
vector < int > v[N];

void foo( int x , int y )
{
    if( x == n ){
        cout << "YES";
        exit(0);
    }
    if( d[x][y] )return;
    d[x][y] = 1;
    for( int i = 0; i < (int)v[x + 1].size(); i++ ){
        if( (y & v[x + 1][i]) == 0 )foo(x + 1 , y | v[x + 1][i]);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen( "input.txt" , "r" , stdin );
    //freopen( "output.txt" , "w" , stdout );

    cin >> n >> m;
    for( int i = 1; i <= n; i++ ){
        cin >> a[i];
    }
    for( int j = 0; j < m; j++ ){
        cin >> b[j];
    }
    for( int i = 1; i < (1 << m); i++ ){
        int sum = 0;
        for( int j = 0; j < m; j++ ){
            if( (i & (1 << j)) )sum += b[j];
        }
        for( int j = 1; j <= n; j++ ){
            if( sum == a[j] )v[j].push_back(i);
        }
    }
    foo(0 , 0);
    cout << "NO";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 26 ms 23800 KB Output is correct
4 Correct 28 ms 23800 KB Output is correct
5 Correct 110 ms 23900 KB Output is correct
6 Correct 26 ms 23800 KB Output is correct
7 Correct 25 ms 23804 KB Output is correct
8 Correct 106 ms 24056 KB Output is correct
9 Correct 107 ms 23800 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 23840 KB Output is correct
2 Correct 25 ms 23876 KB Output is correct
3 Correct 26 ms 23928 KB Output is correct
4 Correct 26 ms 23928 KB Output is correct
5 Correct 26 ms 23896 KB Output is correct
6 Correct 25 ms 23800 KB Output is correct
7 Correct 27 ms 23928 KB Output is correct
8 Correct 60 ms 23928 KB Output is correct
9 Correct 25 ms 23800 KB Output is correct
10 Correct 26 ms 23800 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 23940 KB Output is correct
2 Correct 27 ms 23928 KB Output is correct
3 Correct 28 ms 23928 KB Output is correct
4 Correct 27 ms 23800 KB Output is correct
5 Correct 27 ms 23888 KB Output is correct
6 Correct 27 ms 23800 KB Output is correct
7 Correct 26 ms 23800 KB Output is correct
8 Correct 27 ms 23800 KB Output is correct
9 Correct 27 ms 23928 KB Output is correct
10 Correct 27 ms 23884 KB Output is correct
11 Correct 27 ms 23800 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 26 ms 23800 KB Output is correct
4 Correct 28 ms 23800 KB Output is correct
5 Correct 110 ms 23900 KB Output is correct
6 Correct 26 ms 23800 KB Output is correct
7 Correct 25 ms 23804 KB Output is correct
8 Correct 106 ms 24056 KB Output is correct
9 Correct 107 ms 23800 KB Output is correct
10 Correct 27 ms 23840 KB Output is correct
11 Correct 25 ms 23876 KB Output is correct
12 Correct 26 ms 23928 KB Output is correct
13 Correct 26 ms 23928 KB Output is correct
14 Correct 26 ms 23896 KB Output is correct
15 Correct 25 ms 23800 KB Output is correct
16 Correct 27 ms 23928 KB Output is correct
17 Correct 60 ms 23928 KB Output is correct
18 Correct 25 ms 23800 KB Output is correct
19 Correct 26 ms 23800 KB Output is correct
20 Correct 28 ms 23940 KB Output is correct
21 Correct 27 ms 23928 KB Output is correct
22 Correct 28 ms 23928 KB Output is correct
23 Correct 27 ms 23800 KB Output is correct
24 Correct 27 ms 23888 KB Output is correct
25 Correct 27 ms 23800 KB Output is correct
26 Correct 26 ms 23800 KB Output is correct
27 Correct 27 ms 23800 KB Output is correct
28 Correct 27 ms 23928 KB Output is correct
29 Correct 27 ms 23884 KB Output is correct
30 Correct 27 ms 23800 KB Output is correct
31 Correct 108 ms 23940 KB Output is correct
32 Correct 107 ms 24056 KB Output is correct
33 Correct 114 ms 23900 KB Output is correct
34 Correct 123 ms 23900 KB Output is correct
35 Correct 116 ms 23928 KB Output is correct
36 Correct 124 ms 24056 KB Output is correct
37 Correct 108 ms 23928 KB Output is correct
38 Correct 108 ms 23888 KB Output is correct
39 Correct 116 ms 23928 KB Output is correct
40 Correct 115 ms 23892 KB Output is correct
41 Correct 124 ms 23900 KB Output is correct
42 Correct 130 ms 33524 KB Output is correct
43 Correct 114 ms 24616 KB Output is correct
44 Correct 122 ms 23924 KB Output is correct
45 Correct 109 ms 23928 KB Output is correct
46 Correct 112 ms 23928 KB Output is correct
47 Correct 122 ms 23928 KB Output is correct
48 Correct 105 ms 23928 KB Output is correct
49 Correct 106 ms 23980 KB Output is correct
50 Correct 127 ms 23960 KB Output is correct
51 Correct 116 ms 24056 KB Output is correct
52 Correct 115 ms 23904 KB Output is correct
53 Correct 114 ms 23928 KB Output is correct
54 Correct 124 ms 24056 KB Output is correct
55 Correct 126 ms 24028 KB Output is correct
56 Correct 123 ms 24056 KB Output is correct
57 Correct 367 ms 72696 KB Output is correct
58 Correct 126 ms 24032 KB Output is correct