# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
8113 | 2014-08-30T12:56:16 Z | dohyun0324 | 은행 (IZhO14_bank) | C++ | 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
# | 결과 | 실행 시간 | 메모리 | 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 |
# | 결과 | 실행 시간 | 메모리 | 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 |
# | 결과 | 실행 시간 | 메모리 | 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 |
# | 결과 | 실행 시간 | 메모리 | 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 |