oj.uz

Submission #757770

# Submission time Handle Problem Language Result Execution time Memory
757770 2023-06-13T18:09:06 Z shadow_sami Bank (IZhO14_bank) C++17
100 / 100
 136 ms 33228 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll a[25],b[25];
ll tnc[1 << 21];
ll dp[1 << 21];

void yes(){
	cout<<"YES";
	exit(0);
}

void no(){
	cout<<"NO";
	exit(0);
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        fip(0,n)
        	cin>>a[i];
        fip(0,m)
        	cin>>b[i];
        // assert(n==1);
        memset(dp,-1,sizeof(dp));
        memset(tnc,-1,sizeof(tnc));
        dp[0] = 0;
        tnc[0] = 0;
        fip(1,(1<<m)){
        	fjp(0,m){
        		if(!(i & (1<<j)))
        			continue;
        		tp2 = i - (1<<j);
        		if(tnc[tp2]==-1)
        			continue;
        		tp = dp[tp2] + b[j];
        		res = a[tnc[tp2]];
        		if(res > tp){
        			dp[i] = tp;
        			tnc[i] = tnc[tp2];
        		}
        		else if(res == tp){
        			dp[i] = 0;
        			tnc[i] = tnc[tp2] + 1;
        		}
        		if(tnc[i]==n)
        			yes();
        	}
        }        	
        no();
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 33108 KB Output is correct
2 Correct 16 ms 33220 KB Output is correct
3 Correct 16 ms 33108 KB Output is correct
4 Correct 15 ms 33124 KB Output is correct
5 Correct 83 ms 33128 KB Output is correct
6 Correct 15 ms 33084 KB Output is correct
7 Correct 14 ms 33108 KB Output is correct
8 Correct 14 ms 33108 KB Output is correct
9 Correct 94 ms 33228 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 33136 KB Output is correct
2 Correct 13 ms 33108 KB Output is correct
3 Correct 14 ms 33108 KB Output is correct
4 Correct 13 ms 33108 KB Output is correct
5 Correct 14 ms 33128 KB Output is correct
6 Correct 15 ms 33088 KB Output is correct
7 Correct 15 ms 33104 KB Output is correct
8 Correct 16 ms 33028 KB Output is correct
9 Correct 15 ms 33108 KB Output is correct
10 Correct 14 ms 33108 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 33140 KB Output is correct
2 Correct 14 ms 33108 KB Output is correct
3 Correct 14 ms 33108 KB Output is correct
4 Correct 14 ms 33152 KB Output is correct
5 Correct 14 ms 33108 KB Output is correct
6 Correct 15 ms 33088 KB Output is correct
7 Correct 18 ms 33108 KB Output is correct
8 Correct 15 ms 33096 KB Output is correct
9 Correct 15 ms 33100 KB Output is correct
10 Correct 14 ms 33108 KB Output is correct
11 Correct 15 ms 33108 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 33108 KB Output is correct
2 Correct 16 ms 33220 KB Output is correct
3 Correct 16 ms 33108 KB Output is correct
4 Correct 15 ms 33124 KB Output is correct
5 Correct 83 ms 33128 KB Output is correct
6 Correct 15 ms 33084 KB Output is correct
7 Correct 14 ms 33108 KB Output is correct
8 Correct 14 ms 33108 KB Output is correct
9 Correct 94 ms 33228 KB Output is correct
10 Correct 14 ms 33136 KB Output is correct
11 Correct 13 ms 33108 KB Output is correct
12 Correct 14 ms 33108 KB Output is correct
13 Correct 13 ms 33108 KB Output is correct
14 Correct 14 ms 33128 KB Output is correct
15 Correct 15 ms 33088 KB Output is correct
16 Correct 15 ms 33104 KB Output is correct
17 Correct 16 ms 33028 KB Output is correct
18 Correct 15 ms 33108 KB Output is correct
19 Correct 14 ms 33108 KB Output is correct
20 Correct 14 ms 33140 KB Output is correct
21 Correct 14 ms 33108 KB Output is correct
22 Correct 14 ms 33108 KB Output is correct
23 Correct 14 ms 33152 KB Output is correct
24 Correct 14 ms 33108 KB Output is correct
25 Correct 15 ms 33088 KB Output is correct
26 Correct 18 ms 33108 KB Output is correct
27 Correct 15 ms 33096 KB Output is correct
28 Correct 15 ms 33100 KB Output is correct
29 Correct 14 ms 33108 KB Output is correct
30 Correct 15 ms 33108 KB Output is correct
31 Correct 110 ms 33128 KB Output is correct
32 Correct 109 ms 33108 KB Output is correct
33 Correct 92 ms 33128 KB Output is correct
34 Correct 80 ms 33108 KB Output is correct
35 Correct 77 ms 33128 KB Output is correct
36 Correct 81 ms 33128 KB Output is correct
37 Correct 79 ms 33132 KB Output is correct
38 Correct 93 ms 33108 KB Output is correct
39 Correct 15 ms 33108 KB Output is correct
40 Correct 80 ms 33132 KB Output is correct
41 Correct 79 ms 33140 KB Output is correct
42 Correct 124 ms 33060 KB Output is correct
43 Correct 96 ms 33100 KB Output is correct
44 Correct 78 ms 33132 KB Output is correct
45 Correct 14 ms 33076 KB Output is correct
46 Correct 110 ms 33132 KB Output is correct
47 Correct 85 ms 33224 KB Output is correct
48 Correct 14 ms 33084 KB Output is correct
49 Correct 83 ms 33128 KB Output is correct
50 Correct 98 ms 33128 KB Output is correct
51 Correct 79 ms 33108 KB Output is correct
52 Correct 97 ms 33128 KB Output is correct
53 Correct 136 ms 33128 KB Output is correct
54 Correct 106 ms 33032 KB Output is correct
55 Correct 95 ms 33132 KB Output is correct
56 Correct 92 ms 33108 KB Output is correct
57 Correct 104 ms 33108 KB Output is correct
58 Correct 101 ms 33136 KB Output is correct