oj.uz

Submission #8114

# Submission time Handle Problem Language Result Execution time Memory
8114 2014-08-30T13:02:51 Z dohyun0324 Bank (IZhO14_bank) C++
71 / 100
 1000 ms 660 KB 
#include<stdio.h>
#include<stdlib.h>
int a[21],b[21],n,m;
void dfs(int x,int sum,int state,int k)
{
    int i;
    if(x>n)
    {
        printf("YES");
        exit(0);
    }
    if(sum==0)
    {
        dfs(x+1,a[x+1],state,0);
        return;
    }
    for(i=k;i<m;i++)
    {
        if(state&(1<<i) || sum<b[i]) continue;
        dfs(x,sum-b[i],state+(1<<i),i+1);
    }
}
int main()
{
    int i;
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;i++) scanf("%d",&a[i]);
    for(i=0;i<m;i++) scanf("%d",&b[i]);
    dfs(1,a[1],0,0);
    printf("NO");
    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:26: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:27:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1;i<=n;i++) scanf("%d",&a[i]);
                       ~~~~~^~~~~~~~~~~~
bank.cpp:28:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=0;i<m;i++) 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 412 KB Output is correct
4 Correct 2 ms 412 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 7 ms 456 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
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 412 KB Output is correct
4 Correct 2 ms 412 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 7 ms 456 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 1 ms 456 KB Output is correct
12 Correct 2 ms 456 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 1 ms 552 KB Output is correct
17 Correct 1 ms 552 KB Output is correct
18 Correct 2 ms 560 KB Output is correct
19 Correct 2 ms 560 KB Output is correct
20 Correct 2 ms 560 KB Output is correct
21 Correct 2 ms 560 KB Output is correct
22 Correct 2 ms 560 KB Output is correct
23 Correct 2 ms 560 KB Output is correct
24 Correct 2 ms 560 KB Output is correct
25 Correct 1 ms 560 KB Output is correct
26 Correct 2 ms 560 KB Output is correct
27 Correct 2 ms 560 KB Output is correct
28 Correct 1 ms 560 KB Output is correct
29 Correct 2 ms 560 KB Output is correct
30 Correct 2 ms 560 KB Output is correct
31 Correct 1 ms 560 KB Output is correct
32 Correct 1 ms 560 KB Output is correct
33 Correct 1 ms 560 KB Output is correct
34 Correct 2 ms 560 KB Output is correct
35 Correct 1 ms 560 KB Output is correct
36 Correct 2 ms 560 KB Output is correct
37 Correct 2 ms 560 KB Output is correct
38 Correct 2 ms 560 KB Output is correct
39 Correct 11 ms 560 KB Output is correct
40 Correct 2 ms 560 KB Output is correct
41 Correct 2 ms 560 KB Output is correct
42 Correct 173 ms 660 KB Output is correct
43 Correct 2 ms 660 KB Output is correct
44 Correct 1 ms 660 KB Output is correct
45 Correct 2 ms 660 KB Output is correct
46 Correct 2 ms 660 KB Output is correct
47 Correct 2 ms 660 KB Output is correct
48 Correct 1 ms 660 KB Output is correct
49 Correct 1 ms 660 KB Output is correct
50 Correct 1 ms 660 KB Output is correct
51 Correct 10 ms 660 KB Output is correct
52 Correct 1 ms 660 KB Output is correct
53 Correct 1 ms 660 KB Output is correct
54 Correct 1 ms 660 KB Output is correct
55 Correct 1 ms 660 KB Output is correct
56 Correct 1 ms 660 KB Output is correct
57 Execution timed out 1077 ms 660 KB Time limit exceeded
58 Halted 0 ms 0 KB -