oj.uz

Submission #499152

# Submission time Handle Problem Language Result Execution time Memory
499152 2021-12-27T10:15:10 Z beksultan04 Bank (IZhO14_bank) C++14
100 / 100
 365 ms 51520 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//#define int long long
#define pii pair<int,int>
#define ret return
#define fr first
#define sc second
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define nosol puts("-1");
#define pb push_back
#define endi puts("");
#define ordered_set tree <int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N = 2e6+12,INF = 1e18+7;

vector <int> g[N];
int a[N],b[N],dp[N];
main(){
	int n,i,j,m,mask;
	cin>>n>>m;
	for (i=0;i<n;++i)scanf("%d",&a[i]);
	for (j=0;j<m;++j)scanf("%d",&b[j]);
		
	for (mask = 0;mask<(1<<m);++mask){
		int sum = 0;
		for (j=0;j<m;++j){
			if (mask&(1<<j))
				sum += b[j];
		}
		for (i=0;i<n;++i){
			if (sum == a[i])g[i].pb(mask);
		}
	}
	dp[0] = 1;
	for (i=0;i<n;++i){
		for (mask = (1<<m);mask >= 0; --mask){
			if (dp[mask] == i+1){
				for (auto ms: g[i]){
					if (ms&mask)continue;
					int x = mask|ms;
					
					dp[x] = max(dp[x],dp[mask]+1);
					if (dp[x]> n){
						YES
						ret 0;
					}
					
				}
				
			}
		}
	}
	cout <<"NO";
}

Compilation message

bank.cpp:20:32: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   20 | const int N = 2e6+12,INF = 1e18+7;
      |                            ~~~~^~
bank.cpp:24:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   24 | main(){
      | ^~~~
bank.cpp: In function 'int main()':
bank.cpp:27:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  for (i=0;i<n;++i)scanf("%d",&a[i]);
      |                   ~~~~~^~~~~~~~~~~~
bank.cpp:28:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |  for (j=0;j<m;++j)scanf("%d",&b[j]);
      |                   ~~~~~^~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47180 KB Output is correct
2 Correct 22 ms 47156 KB Output is correct
3 Correct 22 ms 47156 KB Output is correct
4 Correct 24 ms 47264 KB Output is correct
5 Correct 78 ms 47256 KB Output is correct
6 Correct 25 ms 47248 KB Output is correct
7 Correct 29 ms 47180 KB Output is correct
8 Correct 84 ms 47280 KB Output is correct
9 Correct 78 ms 47256 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47292 KB Output is correct
2 Correct 25 ms 47224 KB Output is correct
3 Correct 24 ms 47232 KB Output is correct
4 Correct 23 ms 47172 KB Output is correct
5 Correct 25 ms 47284 KB Output is correct
6 Correct 22 ms 47252 KB Output is correct
7 Correct 23 ms 47204 KB Output is correct
8 Correct 28 ms 47236 KB Output is correct
9 Correct 25 ms 47212 KB Output is correct
10 Correct 22 ms 47180 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47308 KB Output is correct
2 Correct 23 ms 47280 KB Output is correct
3 Correct 25 ms 47272 KB Output is correct
4 Correct 24 ms 47164 KB Output is correct
5 Correct 24 ms 47224 KB Output is correct
6 Correct 23 ms 47252 KB Output is correct
7 Correct 25 ms 47312 KB Output is correct
8 Correct 24 ms 47316 KB Output is correct
9 Correct 27 ms 47180 KB Output is correct
10 Correct 29 ms 47180 KB Output is correct
11 Correct 23 ms 47180 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47180 KB Output is correct
2 Correct 22 ms 47156 KB Output is correct
3 Correct 22 ms 47156 KB Output is correct
4 Correct 24 ms 47264 KB Output is correct
5 Correct 78 ms 47256 KB Output is correct
6 Correct 25 ms 47248 KB Output is correct
7 Correct 29 ms 47180 KB Output is correct
8 Correct 84 ms 47280 KB Output is correct
9 Correct 78 ms 47256 KB Output is correct
10 Correct 24 ms 47292 KB Output is correct
11 Correct 25 ms 47224 KB Output is correct
12 Correct 24 ms 47232 KB Output is correct
13 Correct 23 ms 47172 KB Output is correct
14 Correct 25 ms 47284 KB Output is correct
15 Correct 22 ms 47252 KB Output is correct
16 Correct 23 ms 47204 KB Output is correct
17 Correct 28 ms 47236 KB Output is correct
18 Correct 25 ms 47212 KB Output is correct
19 Correct 22 ms 47180 KB Output is correct
20 Correct 25 ms 47308 KB Output is correct
21 Correct 23 ms 47280 KB Output is correct
22 Correct 25 ms 47272 KB Output is correct
23 Correct 24 ms 47164 KB Output is correct
24 Correct 24 ms 47224 KB Output is correct
25 Correct 23 ms 47252 KB Output is correct
26 Correct 25 ms 47312 KB Output is correct
27 Correct 24 ms 47316 KB Output is correct
28 Correct 27 ms 47180 KB Output is correct
29 Correct 29 ms 47180 KB Output is correct
30 Correct 23 ms 47180 KB Output is correct
31 Correct 79 ms 49320 KB Output is correct
32 Correct 111 ms 51520 KB Output is correct
33 Correct 105 ms 48500 KB Output is correct
34 Correct 112 ms 47372 KB Output is correct
35 Correct 94 ms 47260 KB Output is correct
36 Correct 105 ms 47300 KB Output is correct
37 Correct 84 ms 47388 KB Output is correct
38 Correct 108 ms 47268 KB Output is correct
39 Correct 104 ms 51104 KB Output is correct
40 Correct 95 ms 47180 KB Output is correct
41 Correct 107 ms 47272 KB Output is correct
42 Correct 104 ms 51380 KB Output is correct
43 Correct 101 ms 47792 KB Output is correct
44 Correct 119 ms 47268 KB Output is correct
45 Correct 92 ms 50976 KB Output is correct
46 Correct 96 ms 49536 KB Output is correct
47 Correct 120 ms 47260 KB Output is correct
48 Correct 84 ms 47288 KB Output is correct
49 Correct 80 ms 47272 KB Output is correct
50 Correct 197 ms 51360 KB Output is correct
51 Correct 103 ms 47432 KB Output is correct
52 Correct 110 ms 51124 KB Output is correct
53 Correct 365 ms 51400 KB Output is correct
54 Correct 209 ms 51364 KB Output is correct
55 Correct 191 ms 51272 KB Output is correct
56 Correct 183 ms 51368 KB Output is correct
57 Correct 201 ms 51360 KB Output is correct
58 Correct 208 ms 51372 KB Output is correct