oj.uz

답안 #733967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733967 2023-05-01T12:28:26 Z OrazB 은행 (IZhO14_bank) C++14
100 / 100
 175 ms 4484 KB 
/*
ID: orazbeg1
LANG: C++
TASK: fact4
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 2000005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

int dp[N], p[N], b[N];

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		int x;
		cin >> x;
		p[i] = p[i-1]+x;
	}	
	for (int i = 1; i <= m; i++){
		cin >> b[i];
	}
	dp[0] = 1;
	for (int i = 1; i < (1<<m); i++){
		int sum = 0;
		for (int j = 1; j <= m; j++){
			if ((1<<(j-1))&i) sum += b[j];
		}
		int pos=-1;
		for (int j = 1; j <= n; j++){
			if (p[j] >= sum){pos=j;break;}
		}
		if (pos==-1)continue;
		for (int j = 1; j <= m; j++){
			if ((1<<(j-1))&i and b[j] <= sum-p[pos-1]) dp[i] |= dp[i-(1<<(j-1))];
		}
		if (sum == p[n] and dp[i]) return cout << "YES", 0;
	}
	cout << "NO";
}

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 56 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 145 ms 4432 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 128 ms 4388 KB Output is correct
32 Correct 143 ms 4404 KB Output is correct
33 Correct 160 ms 4412 KB Output is correct
34 Correct 152 ms 4356 KB Output is correct
35 Correct 154 ms 4388 KB Output is correct
36 Correct 175 ms 4404 KB Output is correct
37 Correct 57 ms 752 KB Output is correct
38 Correct 60 ms 444 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 136 ms 4304 KB Output is correct
41 Correct 166 ms 4408 KB Output is correct
42 Correct 145 ms 4484 KB Output is correct
43 Correct 159 ms 4364 KB Output is correct
44 Correct 160 ms 4320 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 145 ms 4424 KB Output is correct
47 Correct 156 ms 4404 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 58 ms 456 KB Output is correct
50 Correct 141 ms 4336 KB Output is correct
51 Correct 132 ms 4436 KB Output is correct
52 Correct 157 ms 4332 KB Output is correct
53 Correct 137 ms 4408 KB Output is correct
54 Correct 145 ms 4368 KB Output is correct
55 Correct 133 ms 4344 KB Output is correct
56 Correct 138 ms 4404 KB Output is correct
57 Correct 145 ms 4356 KB Output is correct
58 Correct 145 ms 4400 KB Output is correct