oj.uz

답안 #937661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937661 2024-03-04T10:18:37 Z Teemka 은행 (IZhO14_bank) C++17
100 / 100
 92 ms 8780 KB 
#include "bits/stdc++.h" 
#define F first
#define S second
#define ALL(a) a.begin() , a.end()

#ifndef ONLINE_JUDGE
#define OK  cout << __LINE__ << "| "<< "---------------------------OK-----------------------" << endl;
#define deb(x) cout << __LINE__ << "| "<< #x  << " = " << x << endl;
#else
#define OK  
#define deb(x) 
#endif
 
typedef long double ld;
typedef long long ll;
using namespace std ;
const ll N = 21 ;	
const ll INF = 1e9;
const ll mod = 1e9 + 7 ;
const double eps = 1e-9 ;
const int dx[]  = { 0 , 0 , 1 , -1, 1 , -1 , 1 , -1} , dy[] = {1 , -1 , 0 , 0 , 1 , 1, -1 , -1}  ;
int n , m, a[N] , b[N];
pair<int,int> dp[1 << N];
void test_solve(int test_index){
	cin >> n >> m;
	for(int i = 1; i <=n ; i++){
		cin >> a[i];
	}

	for(int i = 1; i <= m; i++){
		cin >> b[i];
	}
	for(int msk = 1; msk < (1 << m); msk++){
		for(int j = 0; j < m;j++){
			if(msk & ( 1 << j)){
				int k = dp[msk ^ (1 << j)].F , sm = dp[msk ^ (1 << j)].S + b[j + 1];
				if(sm == a[k + 1]){
					sm = 0;
					k++;
				}
				if(dp[msk].F < k){
					dp[msk] = {k , sm};
				}
				else if(dp[msk].F == k){
					dp[msk] = {k , sm};
				}
			}
		}
		if(dp[msk].F == n){
			cout << "YES" << endl;
			return;
		}
	}
	cout << "NO" << endl;
}

signed main(){
	ios_base::sync_with_stdio(false) ;
    cin.tie(0) ;
    cout.tie(0); 
	int test = 1;
	//cin >> test ;
	for(int i = 1 ;  i <= test ; i++){
 //		cout << "Case " << i << ": " ; 
		test_solve(i) ;
	}
  	return 0;	
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 76 ms 8584 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 72 ms 8564 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 1 ms 360 KB Output is correct
9 Correct 2 ms 360 KB Output is correct
10 Correct 1 ms 360 KB Output is correct
11 Correct 2 ms 368 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 76 ms 8584 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 72 ms 8564 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 352 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 352 KB Output is correct
27 Correct 1 ms 360 KB Output is correct
28 Correct 2 ms 360 KB Output is correct
29 Correct 1 ms 360 KB Output is correct
30 Correct 2 ms 368 KB Output is correct
31 Correct 79 ms 8540 KB Output is correct
32 Correct 82 ms 8540 KB Output is correct
33 Correct 85 ms 8472 KB Output is correct
34 Correct 86 ms 8464 KB Output is correct
35 Correct 81 ms 8528 KB Output is correct
36 Correct 81 ms 8592 KB Output is correct
37 Correct 78 ms 8476 KB Output is correct
38 Correct 72 ms 8532 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 77 ms 8568 KB Output is correct
41 Correct 75 ms 8528 KB Output is correct
42 Correct 92 ms 8576 KB Output is correct
43 Correct 81 ms 8528 KB Output is correct
44 Correct 72 ms 8548 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 87 ms 8616 KB Output is correct
47 Correct 77 ms 8780 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 71 ms 8600 KB Output is correct
50 Correct 86 ms 8588 KB Output is correct
51 Correct 86 ms 8596 KB Output is correct
52 Correct 80 ms 8528 KB Output is correct
53 Correct 86 ms 8528 KB Output is correct
54 Correct 89 ms 8532 KB Output is correct
55 Correct 83 ms 8688 KB Output is correct
56 Correct 84 ms 8532 KB Output is correct
57 Correct 83 ms 8528 KB Output is correct
58 Correct 82 ms 8532 KB Output is correct