# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
90083 | 2018-12-20T07:14:23 Z | Rashidov_Anis | 은행 (IZhO14_bank) | C++14 | 1000 ms | 624 KB |
#include <bits/stdc++.h> #define fr first #define se second #define sc scanf #define pf printf #define ld long double #define ll long long #define pb push_back #define sq(n) n * n #define r_0 return 0 #define pr pair < ll, ll > #define prr pair < pair < ll, ll >, ll > #define fin(s) freopen( s, "r", stdin ) #define fout(s) freopen( s, "w", stdout ) #define TIME ios_base::sync_with_stdio(0) using namespace std; const ll INF = 1e9; const ll N = 2e3 + 3; const ll mod = 998244353; const ld eps = 1e-7; ll n, m; ll b[N], a[N]; void dfs( ll x, ll sum, ll state, ll k, ll num ){ if( x > n ){ printf( "YES" ); exit( 0 ); } if( sum == 0 ){ dfs( x + 1, a[x + 1], state, 1, 0 ); } bool mx = 0; for( int i = k; i <= m; i ++ ){ if( m - num - 1 < n - x )break; if( sum < b[i] || ( state >> i ) & 1 == 1 )continue; dfs( x, sum - b[i], ( state | ( 1 << i ) ), i + 1, num + 1 ); } } main(){ //TIME; //fin( "bank.in" ); //fout( "bank.out" ); scanf( "%I64d%I64d", &n, &m ); for( int i = 1; i <= n; i ++ ){ scanf( "%I64d", &a[i] ); } for( int i = 1; i <= m; i ++ ){ scanf( "%i64d", &b[i] ); } dfs( 1, a[1], 0, 1, 0 ); printf( "NO" ); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 508 KB | Output is correct |
4 | Correct | 2 ms | 508 KB | Output is correct |
5 | Correct | 2 ms | 524 KB | Output is correct |
6 | Correct | 2 ms | 524 KB | Output is correct |
7 | Correct | 1 ms | 576 KB | Output is correct |
8 | Correct | 1 ms | 576 KB | Output is correct |
9 | Correct | 8 ms | 576 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 576 KB | Output is correct |
2 | Correct | 1 ms | 576 KB | Output is correct |
3 | Correct | 2 ms | 576 KB | Output is correct |
4 | Correct | 1 ms | 576 KB | Output is correct |
5 | Correct | 2 ms | 576 KB | Output is correct |
6 | Correct | 2 ms | 576 KB | Output is correct |
7 | Correct | 2 ms | 576 KB | Output is correct |
8 | Correct | 2 ms | 576 KB | Output is correct |
9 | Correct | 2 ms | 576 KB | Output is correct |
10 | Correct | 2 ms | 576 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 576 KB | Output is correct |
2 | Correct | 2 ms | 608 KB | Output is correct |
3 | Correct | 2 ms | 608 KB | Output is correct |
4 | Correct | 2 ms | 608 KB | Output is correct |
5 | Correct | 2 ms | 608 KB | Output is correct |
6 | Correct | 2 ms | 608 KB | Output is correct |
7 | Correct | 2 ms | 608 KB | Output is correct |
8 | Correct | 2 ms | 608 KB | Output is correct |
9 | Correct | 2 ms | 608 KB | Output is correct |
10 | Correct | 2 ms | 608 KB | Output is correct |
11 | Correct | 2 ms | 608 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 508 KB | Output is correct |
4 | Correct | 2 ms | 508 KB | Output is correct |
5 | Correct | 2 ms | 524 KB | Output is correct |
6 | Correct | 2 ms | 524 KB | Output is correct |
7 | Correct | 1 ms | 576 KB | Output is correct |
8 | Correct | 1 ms | 576 KB | Output is correct |
9 | Correct | 8 ms | 576 KB | Output is correct |
10 | Correct | 2 ms | 576 KB | Output is correct |
11 | Correct | 1 ms | 576 KB | Output is correct |
12 | Correct | 2 ms | 576 KB | Output is correct |
13 | Correct | 1 ms | 576 KB | Output is correct |
14 | Correct | 2 ms | 576 KB | Output is correct |
15 | Correct | 2 ms | 576 KB | Output is correct |
16 | Correct | 2 ms | 576 KB | Output is correct |
17 | Correct | 2 ms | 576 KB | Output is correct |
18 | Correct | 2 ms | 576 KB | Output is correct |
19 | Correct | 2 ms | 576 KB | Output is correct |
20 | Correct | 2 ms | 576 KB | Output is correct |
21 | Correct | 2 ms | 608 KB | Output is correct |
22 | Correct | 2 ms | 608 KB | Output is correct |
23 | Correct | 2 ms | 608 KB | Output is correct |
24 | Correct | 2 ms | 608 KB | Output is correct |
25 | Correct | 2 ms | 608 KB | Output is correct |
26 | Correct | 2 ms | 608 KB | Output is correct |
27 | Correct | 2 ms | 608 KB | Output is correct |
28 | Correct | 2 ms | 608 KB | Output is correct |
29 | Correct | 2 ms | 608 KB | Output is correct |
30 | Correct | 2 ms | 608 KB | Output is correct |
31 | Correct | 2 ms | 608 KB | Output is correct |
32 | Correct | 2 ms | 616 KB | Output is correct |
33 | Correct | 2 ms | 616 KB | Output is correct |
34 | Correct | 2 ms | 620 KB | Output is correct |
35 | Correct | 2 ms | 620 KB | Output is correct |
36 | Correct | 2 ms | 620 KB | Output is correct |
37 | Correct | 2 ms | 620 KB | Output is correct |
38 | Correct | 2 ms | 620 KB | Output is correct |
39 | Correct | 2 ms | 620 KB | Output is correct |
40 | Correct | 2 ms | 620 KB | Output is correct |
41 | Correct | 2 ms | 620 KB | Output is correct |
42 | Correct | 207 ms | 624 KB | Output is correct |
43 | Correct | 2 ms | 624 KB | Output is correct |
44 | Correct | 2 ms | 624 KB | Output is correct |
45 | Correct | 2 ms | 624 KB | Output is correct |
46 | Correct | 2 ms | 624 KB | Output is correct |
47 | Correct | 2 ms | 624 KB | Output is correct |
48 | Correct | 2 ms | 624 KB | Output is correct |
49 | Correct | 2 ms | 624 KB | Output is correct |
50 | Correct | 2 ms | 624 KB | Output is correct |
51 | Correct | 11 ms | 624 KB | Output is correct |
52 | Correct | 2 ms | 624 KB | Output is correct |
53 | Correct | 2 ms | 624 KB | Output is correct |
54 | Correct | 2 ms | 624 KB | Output is correct |
55 | Correct | 2 ms | 624 KB | Output is correct |
56 | Correct | 2 ms | 624 KB | Output is correct |
57 | Execution timed out | 1083 ms | 624 KB | Time limit exceeded |
58 | Halted | 0 ms | 0 KB | - |