oj.uz

Submission #8104

# Submission time Handle Problem Language Result Execution time Memory
8104 2014-08-30T02:13:51 Z baneling100 Bank (IZhO14_bank) C++
25 / 100
 1000 ms 628 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) {

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

int main(void) {

    input();
    BitMask(1,A[1],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
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 2 ms 500 KB Output is correct
8 Correct 2 ms 500 KB Output is correct
9 Execution timed out 1077 ms 524 KB Time limit exceeded

Subtask #2
25.0 / 25.0

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

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 548 KB Output is correct
2 Correct 20 ms 548 KB Output is correct
3 Correct 1 ms 548 KB Output is correct
4 Correct 2 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 1 ms 552 KB Output is correct
7 Correct 2 ms 552 KB Output is correct
8 Correct 34 ms 552 KB Output is correct
9 Correct 2 ms 628 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Execution timed out 1080 ms 628 KB Time limit exceeded

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 2 ms 500 KB Output is correct
8 Correct 2 ms 500 KB Output is correct
9 Execution timed out 1077 ms 524 KB Time limit exceeded