oj.uz

Submission #8113

# Submission time Handle Problem Language Result Execution time Memory
8113 2014-08-30T12:56:16 Z dohyun0324 Bank (IZhO14_bank) C++
25 / 100
 1000 ms 640 KB 
#include<stdio.h>
#include<stdlib.h>
int a[21],b[21],n,m;
void dfs(int x,int sum,int state)
{
    int i;
    if(x>n)
    {
        printf("YES");
        exit(0);
    }
    if(sum==0)
    {
        dfs(x+1,a[x+1],state);
        return;
    }
    for(i=0;i<m;i++)
    {
        if(state&(1<<i) || sum<b[i]) continue;
        dfs(x,sum-b[i],state+(1<<i));
    }
}
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);
    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
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 1 ms 500 KB Output is correct
6 Correct 2 ms 500 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 1 ms 500 KB Output is correct
9 Execution timed out 1072 ms 536 KB Time limit exceeded

Subtask #2
25.0 / 25.0

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

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 22 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 37 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Execution timed out 1074 ms 640 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 1 ms 500 KB Output is correct
6 Correct 2 ms 500 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 1 ms 500 KB Output is correct
9 Execution timed out 1072 ms 536 KB Time limit exceeded