oj.uz

답안 #684138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684138 2023-01-20T14:31:43 Z fuad27 은행 (IZhO14_bank) C++17
100 / 100
 110 ms 86604 KB 
/*
 * Author: fuad720
 * Time: 2022-12-27 23:33
 * Lang: C++
*/
#ifndef LOCAL
	#pragma GCC optimize("O3,unroll-loops")
	#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif

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

using ll = long long;

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) FOR(i,0,b)
#define FORN(i,a,b) for(int i=int(b)-1;i>=a;i--)
#define per(i,b) FORN(i,0,b)

#define mkp make_pair
#define pb push_back
#define ep emplace_back
#define ff first
#define ss second
#define bg begin()
#define ed end()
#define sz(x) (int)x.size()
#define all(x) (x).bg,(x).ed
#define FIO ios_base::sync_with_stdio(0);\
	cin.tie(0);

template<class t> using vc=vector<t>;;
template<class t> using vvc=vc<vc<t>>;

using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi= vc<int>;
using vll= vc<ll>;


#ifdef LOCAL
#include "/home/fuad/cp/dbg.h"
#else
#define dbg(x...)
#endif

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngll(chrono::steady_clock::now().time_since_epoch().count());
int dp[20+1][(1<<20)];
vector<int> bt[20];
int calc(int n, int mask) {
	dbg(n,mask);
	if(n==0)return dp[n][mask]=1;
	if(dp[n][mask]!=-1)return dp[n][mask];
	dp[n][mask]=0;
	for(int to:bt[n-1]) {
		if((to&mask)==to)dp[n][mask]|=calc(n-1,mask-to);
	}
	dbg(n,mask,dp[n][mask]);
	return dp[n][mask];
}
void solve() {
	int n, m;
	cin >> n >> m;
	int a[n],b[m];
	rep(i,n)cin >> a[i];
	rep(i,m)cin >> b[i];
	rep(i,(1<<m)) {
		int sum=0;
		rep(j,m) {
			if((1<<j)&i)
				sum+=b[j];
		}
		rep(j,n) {
			if(sum==a[j]){
				bt[j].pb(i);
			}
		}
	}
	memset(dp,-1,sizeof dp);
	cout << (calc(n,(1<<m)-1)?"YES":"NO") << "\n";
}

int main () {
	FIO;
	int t=1;
	while(t--)
		solve();
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 86476 KB Output is correct
2 Correct 34 ms 86468 KB Output is correct
3 Correct 35 ms 86376 KB Output is correct
4 Correct 34 ms 86368 KB Output is correct
5 Correct 49 ms 86404 KB Output is correct
6 Correct 35 ms 86416 KB Output is correct
7 Correct 36 ms 86412 KB Output is correct
8 Correct 51 ms 86476 KB Output is correct
9 Correct 53 ms 86432 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 86448 KB Output is correct
2 Correct 34 ms 86372 KB Output is correct
3 Correct 35 ms 86496 KB Output is correct
4 Correct 35 ms 86476 KB Output is correct
5 Correct 35 ms 86476 KB Output is correct
6 Correct 39 ms 86484 KB Output is correct
7 Correct 35 ms 86476 KB Output is correct
8 Correct 36 ms 86476 KB Output is correct
9 Correct 36 ms 86472 KB Output is correct
10 Correct 37 ms 86480 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 86384 KB Output is correct
2 Correct 37 ms 86472 KB Output is correct
3 Correct 36 ms 86408 KB Output is correct
4 Correct 40 ms 86444 KB Output is correct
5 Correct 37 ms 86372 KB Output is correct
6 Correct 42 ms 86428 KB Output is correct
7 Correct 38 ms 86396 KB Output is correct
8 Correct 37 ms 86476 KB Output is correct
9 Correct 36 ms 86388 KB Output is correct
10 Correct 37 ms 86472 KB Output is correct
11 Correct 35 ms 86392 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 86476 KB Output is correct
2 Correct 34 ms 86468 KB Output is correct
3 Correct 35 ms 86376 KB Output is correct
4 Correct 34 ms 86368 KB Output is correct
5 Correct 49 ms 86404 KB Output is correct
6 Correct 35 ms 86416 KB Output is correct
7 Correct 36 ms 86412 KB Output is correct
8 Correct 51 ms 86476 KB Output is correct
9 Correct 53 ms 86432 KB Output is correct
10 Correct 35 ms 86448 KB Output is correct
11 Correct 34 ms 86372 KB Output is correct
12 Correct 35 ms 86496 KB Output is correct
13 Correct 35 ms 86476 KB Output is correct
14 Correct 35 ms 86476 KB Output is correct
15 Correct 39 ms 86484 KB Output is correct
16 Correct 35 ms 86476 KB Output is correct
17 Correct 36 ms 86476 KB Output is correct
18 Correct 36 ms 86472 KB Output is correct
19 Correct 37 ms 86480 KB Output is correct
20 Correct 36 ms 86384 KB Output is correct
21 Correct 37 ms 86472 KB Output is correct
22 Correct 36 ms 86408 KB Output is correct
23 Correct 40 ms 86444 KB Output is correct
24 Correct 37 ms 86372 KB Output is correct
25 Correct 42 ms 86428 KB Output is correct
26 Correct 38 ms 86396 KB Output is correct
27 Correct 37 ms 86476 KB Output is correct
28 Correct 36 ms 86388 KB Output is correct
29 Correct 37 ms 86472 KB Output is correct
30 Correct 35 ms 86392 KB Output is correct
31 Correct 53 ms 86444 KB Output is correct
32 Correct 93 ms 86604 KB Output is correct
33 Correct 56 ms 86468 KB Output is correct
34 Correct 60 ms 86416 KB Output is correct
35 Correct 65 ms 86408 KB Output is correct
36 Correct 64 ms 86448 KB Output is correct
37 Correct 53 ms 86476 KB Output is correct
38 Correct 54 ms 86392 KB Output is correct
39 Correct 70 ms 86492 KB Output is correct
40 Correct 57 ms 86412 KB Output is correct
41 Correct 67 ms 86484 KB Output is correct
42 Correct 59 ms 86496 KB Output is correct
43 Correct 58 ms 86452 KB Output is correct
44 Correct 63 ms 86472 KB Output is correct
45 Correct 54 ms 86464 KB Output is correct
46 Correct 56 ms 86384 KB Output is correct
47 Correct 79 ms 86468 KB Output is correct
48 Correct 61 ms 86476 KB Output is correct
49 Correct 51 ms 86440 KB Output is correct
50 Correct 67 ms 86500 KB Output is correct
51 Correct 66 ms 86532 KB Output is correct
52 Correct 110 ms 86524 KB Output is correct
53 Correct 95 ms 86476 KB Output is correct
54 Correct 70 ms 86476 KB Output is correct
55 Correct 66 ms 86396 KB Output is correct
56 Correct 83 ms 86464 KB Output is correct
57 Correct 76 ms 86472 KB Output is correct
58 Correct 91 ms 86432 KB Output is correct