# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
479036 |
2021-10-09T13:35:12 Z |
urosk |
Bank (IZhO14_bank) |
C++14 |
|
155 ms |
31628 KB |
// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x) long long
#define here cerr<<"---------------------------\n"
#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
void setIO(string inoutname)
{
freopen((inoutname+".in").c_str(),"r",stdin);
freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
if(b==0) return a;
if(a==0) return b;
if(a>=b) return gcd(a%b,b);
return gcd(a,b%a);
}
ll lcm(ll a,ll b){
return (a/gcd(a,b))*b;
}
ll add(ll a,ll b){
a+=b;
a+=mod;
if(a>=mod) a%=mod;
return a;
}
ll mul(ll a,ll b){return(a*b)%mod;}
#define maxn 25
#define maxx 2000005
ll n,m;
ll a[maxn];
ll b[maxn];
pll dp[maxx];
pll get(pll a,pll b){
if(a.fi>b.fi) return a;
if(b.fi>a.fi) return b;
if(a.sc>b.sc) return a;
return b;
}
void tc(){
ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
cin >> m >> n;
for(ll i = 0;i<m;i++) cin >> a[i];
for(ll i = 0;i<n;i++) cin >> b[i];
for(ll i = 0;i<maxx;i++) dp[i] = {-1,-1};
dp[0] = {0,0};
for(ll mask = 1;mask<(1<<n);mask++){
for(ll i = 0;i<n;i++){
if(((1<<i)&mask)==0) continue;
if(dp[mask^(1<<i)].fi==-1) continue;
ll c = dp[mask^(1<<i)].sc + b[i];
ll j = a[dp[mask^(1<<i)].fi];
ll nf=-1,ns=-1;
if(c<j){
nf = dp[mask^(1<<i)].fi;
ns = c;
if(dp[mask].fi==-1) dp[mask] = {nf,ns};
else dp[mask] = get(dp[mask],{nf,ns});
}else if(c==j){
nf = dp[mask^(1<<i)].fi+1;
ns = 0;
if(dp[mask].fi==-1) dp[mask] = {nf,ns};
else dp[mask] = get(dp[mask],{nf,ns});
}
}
if(dp[mask].fi==m){
cout<<"YES"<<endl;
return;
}
}
cout<<"NO"<<endl;
return;
}
int main(){
ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
//setIO("lol");
int t; t = 1;
while(t--){
tc();
}
return 0;
}
/*
1 5
8
4 2 5 1 3
*/
Compilation message
bank.cpp: In function 'void setIO(std::string)':
bank.cpp:32:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | freopen((inoutname+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:33:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
33 | freopen((inoutname+".out").c_str(),"w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
31564 KB |
Output is correct |
2 |
Correct |
17 ms |
31624 KB |
Output is correct |
3 |
Correct |
20 ms |
31564 KB |
Output is correct |
4 |
Correct |
15 ms |
31556 KB |
Output is correct |
5 |
Correct |
88 ms |
31604 KB |
Output is correct |
6 |
Correct |
17 ms |
31600 KB |
Output is correct |
7 |
Correct |
18 ms |
31564 KB |
Output is correct |
8 |
Correct |
15 ms |
31628 KB |
Output is correct |
9 |
Correct |
106 ms |
31612 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
31568 KB |
Output is correct |
2 |
Correct |
17 ms |
31548 KB |
Output is correct |
3 |
Correct |
15 ms |
31564 KB |
Output is correct |
4 |
Correct |
16 ms |
31564 KB |
Output is correct |
5 |
Correct |
15 ms |
31564 KB |
Output is correct |
6 |
Correct |
18 ms |
31564 KB |
Output is correct |
7 |
Correct |
16 ms |
31564 KB |
Output is correct |
8 |
Correct |
16 ms |
31508 KB |
Output is correct |
9 |
Correct |
21 ms |
31564 KB |
Output is correct |
10 |
Correct |
16 ms |
31524 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
31564 KB |
Output is correct |
2 |
Correct |
17 ms |
31572 KB |
Output is correct |
3 |
Correct |
16 ms |
31624 KB |
Output is correct |
4 |
Correct |
17 ms |
31572 KB |
Output is correct |
5 |
Correct |
15 ms |
31564 KB |
Output is correct |
6 |
Correct |
17 ms |
31612 KB |
Output is correct |
7 |
Correct |
19 ms |
31532 KB |
Output is correct |
8 |
Correct |
17 ms |
31564 KB |
Output is correct |
9 |
Correct |
16 ms |
31564 KB |
Output is correct |
10 |
Correct |
16 ms |
31564 KB |
Output is correct |
11 |
Correct |
16 ms |
31584 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
31564 KB |
Output is correct |
2 |
Correct |
17 ms |
31624 KB |
Output is correct |
3 |
Correct |
20 ms |
31564 KB |
Output is correct |
4 |
Correct |
15 ms |
31556 KB |
Output is correct |
5 |
Correct |
88 ms |
31604 KB |
Output is correct |
6 |
Correct |
17 ms |
31600 KB |
Output is correct |
7 |
Correct |
18 ms |
31564 KB |
Output is correct |
8 |
Correct |
15 ms |
31628 KB |
Output is correct |
9 |
Correct |
106 ms |
31612 KB |
Output is correct |
10 |
Correct |
15 ms |
31568 KB |
Output is correct |
11 |
Correct |
17 ms |
31548 KB |
Output is correct |
12 |
Correct |
15 ms |
31564 KB |
Output is correct |
13 |
Correct |
16 ms |
31564 KB |
Output is correct |
14 |
Correct |
15 ms |
31564 KB |
Output is correct |
15 |
Correct |
18 ms |
31564 KB |
Output is correct |
16 |
Correct |
16 ms |
31564 KB |
Output is correct |
17 |
Correct |
16 ms |
31508 KB |
Output is correct |
18 |
Correct |
21 ms |
31564 KB |
Output is correct |
19 |
Correct |
16 ms |
31524 KB |
Output is correct |
20 |
Correct |
16 ms |
31564 KB |
Output is correct |
21 |
Correct |
17 ms |
31572 KB |
Output is correct |
22 |
Correct |
16 ms |
31624 KB |
Output is correct |
23 |
Correct |
17 ms |
31572 KB |
Output is correct |
24 |
Correct |
15 ms |
31564 KB |
Output is correct |
25 |
Correct |
17 ms |
31612 KB |
Output is correct |
26 |
Correct |
19 ms |
31532 KB |
Output is correct |
27 |
Correct |
17 ms |
31564 KB |
Output is correct |
28 |
Correct |
16 ms |
31564 KB |
Output is correct |
29 |
Correct |
16 ms |
31564 KB |
Output is correct |
30 |
Correct |
16 ms |
31584 KB |
Output is correct |
31 |
Correct |
126 ms |
31604 KB |
Output is correct |
32 |
Correct |
131 ms |
31608 KB |
Output is correct |
33 |
Correct |
99 ms |
31564 KB |
Output is correct |
34 |
Correct |
88 ms |
31608 KB |
Output is correct |
35 |
Correct |
92 ms |
31604 KB |
Output is correct |
36 |
Correct |
98 ms |
31584 KB |
Output is correct |
37 |
Correct |
88 ms |
31548 KB |
Output is correct |
38 |
Correct |
90 ms |
31620 KB |
Output is correct |
39 |
Correct |
15 ms |
31564 KB |
Output is correct |
40 |
Correct |
89 ms |
31564 KB |
Output is correct |
41 |
Correct |
86 ms |
31612 KB |
Output is correct |
42 |
Correct |
155 ms |
31608 KB |
Output is correct |
43 |
Correct |
103 ms |
31600 KB |
Output is correct |
44 |
Correct |
91 ms |
31564 KB |
Output is correct |
45 |
Correct |
15 ms |
31564 KB |
Output is correct |
46 |
Correct |
123 ms |
31564 KB |
Output is correct |
47 |
Correct |
87 ms |
31576 KB |
Output is correct |
48 |
Correct |
17 ms |
31564 KB |
Output is correct |
49 |
Correct |
97 ms |
31608 KB |
Output is correct |
50 |
Correct |
107 ms |
31588 KB |
Output is correct |
51 |
Correct |
92 ms |
31604 KB |
Output is correct |
52 |
Correct |
111 ms |
31544 KB |
Output is correct |
53 |
Correct |
138 ms |
31604 KB |
Output is correct |
54 |
Correct |
125 ms |
31564 KB |
Output is correct |
55 |
Correct |
109 ms |
31608 KB |
Output is correct |
56 |
Correct |
111 ms |
31604 KB |
Output is correct |
57 |
Correct |
111 ms |
31616 KB |
Output is correct |
58 |
Correct |
111 ms |
31564 KB |
Output is correct |