oj.uz

Submission #704098

# Submission time Handle Problem Language Result Execution time Memory
704098 2023-03-01T14:56:29 Z thrasherr_1 Bank (IZhO14_bank) C++17
100 / 100
 282 ms 16724 KB 
#include <bits/stdc++.h>
using namespace std ;
 
#define ff first
#define ss second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define ones(x) __builtin_popcount(x)
#define remove(v)  v.erase(unique(all(v)), v.end())
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define per(i, a, b) for(int i = a; i >= b; i--)
 
#ifdef local
#include "C:\debug.h"
#else
#define dbg(x...) 42
#endif
#define int long long
 
const int N = 2e6 + 2 ;
const int MOD = 1e9 + 7 ;
const int P = 1007 ;
 
int n , m , a[21] , b[21] , pref[21] ;
int dp[(1 << 21)] ;
 
bool go(int i , int mask , int cur) {
    if(cur == pref[i]) i++ ;
    if(i > n) return 1 ;
    if(~dp[mask]) return dp[mask] ;
    bool current = 0 ;
    rep(j , 0 , m - 1) {
        if(!(mask >> j & 1) && cur + b[j + 1] <= pref[i]) {
            current |= go(i , (mask | (1 << j)) , cur + b[j + 1]) ;    
        }
    }
    dp[mask] = current ;
    return dp[mask] ;
}
 
void solve(){
    cin >> n >> m ;
    rep(i , 0 , (1 << 21) - 1) dp[i] = -1 ;
    rep(i , 1 , n) cin >> a[i] ;
    rep(i , 1 , m) cin >> b[i] ;
    rep(i , 1 , n) pref[i] = pref[i - 1] + a[i] ;
    bool ok = go(1 , 0 , 0) ;
    if(ok) cout << "YES\n" ;
    else cout << "NO\n" ;
}
 
signed main () {
	// ios::sync_with_stdio(false) ;
	// cin.tie(0) ;
	int test = 1 ;
	// cin >> test ; 
	for(int i = 1 ; i <= test ; i++) {
		solve() ;
	}
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16596 KB Output is correct
2 Correct 8 ms 16604 KB Output is correct
3 Correct 8 ms 16700 KB Output is correct
4 Correct 8 ms 16596 KB Output is correct
5 Correct 7 ms 16596 KB Output is correct
6 Correct 7 ms 16596 KB Output is correct
7 Correct 6 ms 16596 KB Output is correct
8 Correct 79 ms 16596 KB Output is correct
9 Correct 216 ms 16696 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16596 KB Output is correct
2 Correct 8 ms 16604 KB Output is correct
3 Correct 8 ms 16700 KB Output is correct
4 Correct 8 ms 16596 KB Output is correct
5 Correct 7 ms 16596 KB Output is correct
6 Correct 7 ms 16596 KB Output is correct
7 Correct 6 ms 16596 KB Output is correct
8 Correct 79 ms 16596 KB Output is correct
9 Correct 216 ms 16696 KB Output is correct
10 Correct 7 ms 16596 KB Output is correct
11 Correct 7 ms 16596 KB Output is correct
12 Correct 7 ms 16596 KB Output is correct
13 Correct 7 ms 16596 KB Output is correct
14 Correct 7 ms 16596 KB Output is correct
15 Correct 7 ms 16660 KB Output is correct
16 Correct 7 ms 16596 KB Output is correct
17 Correct 7 ms 16596 KB Output is correct
18 Correct 7 ms 16676 KB Output is correct
19 Correct 8 ms 16668 KB Output is correct
20 Correct 7 ms 16596 KB Output is correct
21 Correct 8 ms 16720 KB Output is correct
22 Correct 7 ms 16596 KB Output is correct
23 Correct 6 ms 16596 KB Output is correct
24 Correct 7 ms 16596 KB Output is correct
25 Correct 8 ms 16596 KB Output is correct
26 Correct 7 ms 16712 KB Output is correct
27 Correct 7 ms 16712 KB Output is correct
28 Correct 7 ms 16600 KB Output is correct
29 Correct 7 ms 16596 KB Output is correct
30 Correct 8 ms 16664 KB Output is correct
31 Correct 116 ms 16596 KB Output is correct
32 Correct 166 ms 16596 KB Output is correct
33 Correct 14 ms 16596 KB Output is correct
34 Correct 7 ms 16596 KB Output is correct
35 Correct 7 ms 16596 KB Output is correct
36 Correct 7 ms 16596 KB Output is correct
37 Correct 7 ms 16600 KB Output is correct
38 Correct 7 ms 16596 KB Output is correct
39 Correct 27 ms 16712 KB Output is correct
40 Correct 8 ms 16700 KB Output is correct
41 Correct 7 ms 16652 KB Output is correct
42 Correct 78 ms 16596 KB Output is correct
43 Correct 9 ms 16696 KB Output is correct
44 Correct 9 ms 16700 KB Output is correct
45 Correct 62 ms 16696 KB Output is correct
46 Correct 30 ms 16596 KB Output is correct
47 Correct 7 ms 16596 KB Output is correct
48 Correct 27 ms 16696 KB Output is correct
49 Correct 7 ms 16596 KB Output is correct
50 Correct 210 ms 16616 KB Output is correct
51 Correct 9 ms 16692 KB Output is correct
52 Correct 13 ms 16596 KB Output is correct
53 Correct 209 ms 16692 KB Output is correct
54 Correct 221 ms 16692 KB Output is correct
55 Correct 210 ms 16704 KB Output is correct
56 Correct 176 ms 16596 KB Output is correct
57 Correct 199 ms 16596 KB Output is correct
58 Correct 282 ms 16724 KB Output is correct