oj.uz

Submission #705352

# Submission time Handle Problem Language Result Execution time Memory
705352 2023-03-04T06:10:11 Z vjudge1 Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 181000 KB 
// Problem: X - Bank

#include <bits/stdc++.h>
using namespace std ;

#define ff first
#define ss second
#define ll long long
#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 rall(x) x.rbegin(), x.rend()
#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 ll

const int N = 1e5 + 2 ;
const int P = 29 ;
const int MOD = 1e9 + 7 ;

int n , m , a[21] , b[21] , pref[21] , dp[22][(1 << 20) + 1];

int go(int i , int mask , int cur) {
    if(cur == pref[i]) {
        dbg(mask , pref[i]) ;
        dp[i][mask] = 1 ;
        i++ ;
    }
    if(i > n) return dp[i][mask] = 1 ;
    if(~dp[i][mask]) return dp[i][mask] ;
    int ans = 0 ;
    rep(j , 0 , m - 1) {
        if(!(mask >> j & 1)) {
            ans |= go(i , mask ^ (1 << j) , cur + b[j + 1]) ;
        }
    }
    dp[i][mask] = ans ;
    return ans ;
}

void solve(){
    memset(*dp, -1, sizeof(dp)) ;
    cin >> n >> m ;
    rep(i , 1 , n) cin >> a[i] ;
    rep(i , 1 , n) pref[i] = pref[i - 1] + a[i] ;
    rep(i , 1 , m) cin >> b[i] ;
    if(go(1, 0, 0)) {
        cout << "YES\n" ;
    }else{
        cout << "NO\n" ;
    }
}

signed main () {
    // freopen(".in","r",stdin) ;
    // freopen(".out","w",stdout) ;
	ios::sync_with_stdio(false) ;
	cin.tie(0) ;
	int test = 1 ;
	// cin >> test ; 
	for(int i = 1 ; i <= test ; i++) {
		solve() ;
	}
}

Compilation message

bank.cpp: In function 'long long int go(long long int, long long int, long long int)':
bank.cpp:23:19: warning: statement has no effect [-Wunused-value]
   23 | #define dbg(x...) 42
      |                   ^~
bank.cpp:36:9: note: in expansion of macro 'dbg'
   36 |         dbg(mask , pref[i]) ;
      |         ^~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 180884 KB Output is correct
2 Correct 66 ms 180812 KB Output is correct
3 Correct 68 ms 180812 KB Output is correct
4 Correct 71 ms 180864 KB Output is correct
5 Correct 361 ms 180880 KB Output is correct
6 Correct 68 ms 180776 KB Output is correct
7 Correct 67 ms 180844 KB Output is correct
8 Correct 332 ms 180876 KB Output is correct
9 Correct 250 ms 180852 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 180828 KB Output is correct
2 Correct 78 ms 180796 KB Output is correct
3 Correct 75 ms 180832 KB Output is correct
4 Correct 71 ms 180772 KB Output is correct
5 Correct 67 ms 180840 KB Output is correct
6 Correct 83 ms 180832 KB Output is correct
7 Correct 70 ms 180768 KB Output is correct
8 Correct 70 ms 180812 KB Output is correct
9 Correct 67 ms 180824 KB Output is correct
10 Correct 70 ms 180840 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 180760 KB Output is correct
2 Correct 69 ms 180812 KB Output is correct
3 Correct 70 ms 180748 KB Output is correct
4 Correct 80 ms 180808 KB Output is correct
5 Correct 71 ms 180780 KB Output is correct
6 Correct 69 ms 180768 KB Output is correct
7 Correct 69 ms 180872 KB Output is correct
8 Correct 87 ms 180812 KB Output is correct
9 Correct 74 ms 180844 KB Output is correct
10 Correct 70 ms 180780 KB Output is correct
11 Correct 68 ms 180820 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 180884 KB Output is correct
2 Correct 66 ms 180812 KB Output is correct
3 Correct 68 ms 180812 KB Output is correct
4 Correct 71 ms 180864 KB Output is correct
5 Correct 361 ms 180880 KB Output is correct
6 Correct 68 ms 180776 KB Output is correct
7 Correct 67 ms 180844 KB Output is correct
8 Correct 332 ms 180876 KB Output is correct
9 Correct 250 ms 180852 KB Output is correct
10 Correct 73 ms 180828 KB Output is correct
11 Correct 78 ms 180796 KB Output is correct
12 Correct 75 ms 180832 KB Output is correct
13 Correct 71 ms 180772 KB Output is correct
14 Correct 67 ms 180840 KB Output is correct
15 Correct 83 ms 180832 KB Output is correct
16 Correct 70 ms 180768 KB Output is correct
17 Correct 70 ms 180812 KB Output is correct
18 Correct 67 ms 180824 KB Output is correct
19 Correct 70 ms 180840 KB Output is correct
20 Correct 71 ms 180760 KB Output is correct
21 Correct 69 ms 180812 KB Output is correct
22 Correct 70 ms 180748 KB Output is correct
23 Correct 80 ms 180808 KB Output is correct
24 Correct 71 ms 180780 KB Output is correct
25 Correct 69 ms 180768 KB Output is correct
26 Correct 69 ms 180872 KB Output is correct
27 Correct 87 ms 180812 KB Output is correct
28 Correct 74 ms 180844 KB Output is correct
29 Correct 70 ms 180780 KB Output is correct
30 Correct 68 ms 180820 KB Output is correct
31 Correct 344 ms 180872 KB Output is correct
32 Correct 433 ms 180940 KB Output is correct
33 Correct 364 ms 180876 KB Output is correct
34 Correct 358 ms 180880 KB Output is correct
35 Correct 443 ms 180840 KB Output is correct
36 Correct 424 ms 180940 KB Output is correct
37 Correct 335 ms 180876 KB Output is correct
38 Correct 269 ms 180876 KB Output is correct
39 Correct 112 ms 180760 KB Output is correct
40 Correct 276 ms 180876 KB Output is correct
41 Correct 288 ms 181000 KB Output is correct
42 Correct 477 ms 180824 KB Output is correct
43 Correct 328 ms 180872 KB Output is correct
44 Correct 272 ms 180876 KB Output is correct
45 Correct 526 ms 180880 KB Output is correct
46 Correct 425 ms 180880 KB Output is correct
47 Correct 371 ms 180876 KB Output is correct
48 Correct 247 ms 180876 KB Output is correct
49 Correct 283 ms 180876 KB Output is correct
50 Execution timed out 1093 ms 180856 KB Time limit exceeded
51 Halted 0 ms 0 KB -