oj.uz

Submission #8106

# Submission time Handle Problem Language Result Execution time Memory
8106 2014-08-30T02:24:33 Z baneling100 Bank (IZhO14_bank) C++
100 / 100
 197 ms 544 KB 
#include <stdio.h>
#include <stdlib.h>

int N, M, A[21], B[21];

void input(void) {

    int i;

    scanf("%d %d",&N,&M);
    for(i=1 ; i<=N ; i++)
        scanf("%d",&A[i]);
    for(i=1 ; i<=M ; i++)
        scanf("%d",&B[i]);
}

void BitMask(int Lev, int Sum, int Bit, int S, int K) {

    if(Lev>N) {
        printf("YES");
        exit(0);
    }
    else {
        if(Sum)
            for(int i=S ; i<M ; i++) {
                if(!(Bit&(1<<i)) && Sum>=B[i+1] && N-Lev<=M-K-1)
                    BitMask(Lev,Sum-B[i+1],Bit|(1<<i),i+1,K+1);
            }
        else
            BitMask(Lev+1,A[Lev+1],Bit,0,K);
    }
}

int main(void) {

    input();
    BitMask(1,A[1],0,0,0);
    printf("NO");

    return 0;
}

Compilation message

bank.cpp: In function 'void input()':
bank.cpp:10: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:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&A[i]);
         ~~~~~^~~~~~~~~~~~
bank.cpp:14: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 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 1 ms 524 KB Output is correct
5 Correct 2 ms 524 KB Output is correct
6 Correct 1 ms 524 KB Output is correct
7 Correct 1 ms 524 KB Output is correct
8 Correct 2 ms 524 KB Output is correct
9 Correct 10 ms 524 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 1 ms 524 KB Output is correct
5 Correct 2 ms 524 KB Output is correct
6 Correct 1 ms 524 KB Output is correct
7 Correct 1 ms 524 KB Output is correct
8 Correct 2 ms 524 KB Output is correct
9 Correct 10 ms 524 KB Output is correct
10 Correct 1 ms 524 KB Output is correct
11 Correct 2 ms 524 KB Output is correct
12 Correct 2 ms 524 KB Output is correct
13 Correct 2 ms 524 KB Output is correct
14 Correct 2 ms 524 KB Output is correct
15 Correct 2 ms 544 KB Output is correct
16 Correct 2 ms 544 KB Output is correct
17 Correct 2 ms 544 KB Output is correct
18 Correct 1 ms 544 KB Output is correct
19 Correct 2 ms 544 KB Output is correct
20 Correct 2 ms 544 KB Output is correct
21 Correct 1 ms 544 KB Output is correct
22 Correct 2 ms 544 KB Output is correct
23 Correct 2 ms 544 KB Output is correct
24 Correct 2 ms 544 KB Output is correct
25 Correct 2 ms 544 KB Output is correct
26 Correct 2 ms 544 KB Output is correct
27 Correct 2 ms 544 KB Output is correct
28 Correct 2 ms 544 KB Output is correct
29 Correct 2 ms 544 KB Output is correct
30 Correct 2 ms 544 KB Output is correct
31 Correct 2 ms 544 KB Output is correct
32 Correct 2 ms 544 KB Output is correct
33 Correct 2 ms 544 KB Output is correct
34 Correct 2 ms 544 KB Output is correct
35 Correct 2 ms 544 KB Output is correct
36 Correct 2 ms 544 KB Output is correct
37 Correct 2 ms 544 KB Output is correct
38 Correct 2 ms 544 KB Output is correct
39 Correct 2 ms 544 KB Output is correct
40 Correct 2 ms 544 KB Output is correct
41 Correct 2 ms 544 KB Output is correct
42 Correct 197 ms 544 KB Output is correct
43 Correct 2 ms 544 KB Output is correct
44 Correct 2 ms 544 KB Output is correct
45 Correct 2 ms 544 KB Output is correct
46 Correct 2 ms 544 KB Output is correct
47 Correct 2 ms 544 KB Output is correct
48 Correct 2 ms 544 KB Output is correct
49 Correct 1 ms 544 KB Output is correct
50 Correct 2 ms 544 KB Output is correct
51 Correct 11 ms 544 KB Output is correct
52 Correct 2 ms 544 KB Output is correct
53 Correct 1 ms 544 KB Output is correct
54 Correct 1 ms 544 KB Output is correct
55 Correct 1 ms 544 KB Output is correct
56 Correct 1 ms 544 KB Output is correct
57 Correct 1 ms 544 KB Output is correct
58 Correct 1 ms 544 KB Output is correct