oj.uz

Submission #16939

# Submission time Handle Problem Language Result Execution time Memory
16939 2015-10-28T17:58:11 Z erdemkiraz Bank (IZhO14_bank) C++
100 / 100
 121 ms 4756 KB 
#include <bits/stdc++.h>

using namespace std;

#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)

typedef long long ll;
typedef pair < int, int > ii;

const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;

const int N = 20;
const int MAX = 1 << 20;

int n, m;
int a[N], b[N], dp[MAX];

int f(int mask, int x, int sum) {
    if(x == n)
        return 1;
    int &r = dp[mask];
    if(r != -1)
        return r;
    r = 0;
    for(int i = 0; i < m; i++) {
        if(!(mask & 1 << i) and sum + b[i] <= a[x]) {
            if(sum + b[i] == a[x])
                r |= f(mask | 1 << i, x + 1, 0);
            else
                r |= f(mask | 1 << i, x, sum + b[i]);
        }
    }
    return r;
}

int main() {

    scanf("%d %d", &n, &m);

    for(int i = 0; i < n; i++)
        scanf("%d", a + i);

    for(int i = 0; i < m; i++)
        scanf("%d", b + i);

    memset(dp, -1, sizeof(dp));

    if(f(0, 0, 0))
        puts("YES");
    else
        puts("NO");

    return 0;

}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", a + i);
         ~~~~~^~~~~~~~~~~~~
bank.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", b + i);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4344 KB Output is correct
2 Correct 4 ms 4468 KB Output is correct
3 Correct 4 ms 4544 KB Output is correct
4 Correct 5 ms 4560 KB Output is correct
5 Correct 4 ms 4616 KB Output is correct
6 Correct 5 ms 4636 KB Output is correct
7 Correct 5 ms 4660 KB Output is correct
8 Correct 54 ms 4660 KB Output is correct
9 Correct 110 ms 4700 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4344 KB Output is correct
2 Correct 4 ms 4468 KB Output is correct
3 Correct 4 ms 4544 KB Output is correct
4 Correct 5 ms 4560 KB Output is correct
5 Correct 4 ms 4616 KB Output is correct
6 Correct 5 ms 4636 KB Output is correct
7 Correct 5 ms 4660 KB Output is correct
8 Correct 54 ms 4660 KB Output is correct
9 Correct 110 ms 4700 KB Output is correct
10 Correct 4 ms 4700 KB Output is correct
11 Correct 4 ms 4700 KB Output is correct
12 Correct 5 ms 4700 KB Output is correct
13 Correct 4 ms 4700 KB Output is correct
14 Correct 4 ms 4704 KB Output is correct
15 Correct 4 ms 4704 KB Output is correct
16 Correct 4 ms 4704 KB Output is correct
17 Correct 4 ms 4704 KB Output is correct
18 Correct 4 ms 4704 KB Output is correct
19 Correct 4 ms 4708 KB Output is correct
20 Correct 4 ms 4708 KB Output is correct
21 Correct 5 ms 4716 KB Output is correct
22 Correct 5 ms 4716 KB Output is correct
23 Correct 4 ms 4716 KB Output is correct
24 Correct 4 ms 4716 KB Output is correct
25 Correct 4 ms 4716 KB Output is correct
26 Correct 5 ms 4716 KB Output is correct
27 Correct 5 ms 4732 KB Output is correct
28 Correct 4 ms 4732 KB Output is correct
29 Correct 4 ms 4732 KB Output is correct
30 Correct 5 ms 4732 KB Output is correct
31 Correct 93 ms 4732 KB Output is correct
32 Correct 105 ms 4732 KB Output is correct
33 Correct 11 ms 4732 KB Output is correct
34 Correct 5 ms 4732 KB Output is correct
35 Correct 5 ms 4732 KB Output is correct
36 Correct 5 ms 4732 KB Output is correct
37 Correct 5 ms 4732 KB Output is correct
38 Correct 5 ms 4732 KB Output is correct
39 Correct 20 ms 4732 KB Output is correct
40 Correct 5 ms 4732 KB Output is correct
41 Correct 5 ms 4732 KB Output is correct
42 Correct 60 ms 4732 KB Output is correct
43 Correct 7 ms 4732 KB Output is correct
44 Correct 5 ms 4732 KB Output is correct
45 Correct 53 ms 4732 KB Output is correct
46 Correct 27 ms 4732 KB Output is correct
47 Correct 5 ms 4732 KB Output is correct
48 Correct 21 ms 4732 KB Output is correct
49 Correct 5 ms 4732 KB Output is correct
50 Correct 121 ms 4732 KB Output is correct
51 Correct 6 ms 4732 KB Output is correct
52 Correct 9 ms 4732 KB Output is correct
53 Correct 119 ms 4732 KB Output is correct
54 Correct 113 ms 4732 KB Output is correct
55 Correct 112 ms 4756 KB Output is correct
56 Correct 115 ms 4756 KB Output is correct
57 Correct 109 ms 4756 KB Output is correct
58 Correct 113 ms 4756 KB Output is correct