oj.uz

Submission #786581

# Submission time Handle Problem Language Result Execution time Memory
786581 2023-07-18T09:29:55 Z tr1ten Bank (IZhO14_bank) C++14
100 / 100
 138 ms 8632 KB 
#include <cstdio>
#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;
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> ;
template<typename T> 
using ordered_multiset = tree<T, null_type,less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
// useful defs
typedef long long ll; 
typedef vector<ll> vi;
typedef vector<vi> vii;
typedef pair<ll,ll> pi;
typedef vector<pi> vpi;
typedef unordered_map<ll,ll> mll;
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define per(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define trav(a,arr) for (auto& a: (arr))
#define sz(x) (int)(x).size()
#define mk_vec(name,sz,value) vi name(sz,value)
#define mk_mat(name,n,m,value) vii name(n, vi(m, value))
#define contains(x) find(x) != string::npos
#define tkv(vec,sz) rep(i,0,sz) cin>>vec[i]
#define srv(vec) sort(vec.begin(), vec.end())
#define all(x) x.begin(), x.end()
#define less(a,b) a<b
#define vsum(vec) accumulate(vec.begin(), vec.end(), 0L);
#define vmax(vec) *max_element(vec.begin(), vec.end());
#define vmin(vec) *min_element(vec.begin(), vec.end());
#define pvc(vec) trav(x,vec) cout<<x<<" "; cout<<endl;
#define put(x) cout<<(x)<<endl;
#define put2(x,y) cout<<(x)<<" "<<(y)<<endl;
#define put3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl;
#define mod(x) (x + MOD)%MOD
// debugging
#define timed(x) {auto start = chrono::steady_clock::now(); x; auto end = chrono::steady_clock::now(); auto diff = end - start; cout << chrono::duration <double, milli> (diff).count() << " ms" << endl;}


void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
const ll MOD = 1e9+7;
const ll INF = 1e10+5;
vi amt; // pre cal cost of each mask
vi A;
vi B;
inline int pct(int x){ return __builtin_popcount(x);}
// void rec(vector<int> &nt,int idx,int t_mask,int mask,int target,int *dp){
//     if(idx==(int)nt.size()) {
        // int ans = dp[mask] | 1<<target;
        // if(amt[t_mask] == A[target] && pct(dp[mask | t_mask]) < pct(ans)) {
        //     dp[mask | t_mask] = ans;
            
        // }
        // return;
//     }
//     rec(nt,idx+1,t_mask,mask,target,dp);
//     if(A[target] - amt[t_mask | 1<<nt[idx]] >=0) rec(nt,idx+1,t_mask | 1<<nt[idx],mask,target,dp);
// }

// driver code
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // freopen("input.in","r",stdin);
    // freopen("output.out","w",stdout);	  
    int T=1;
    // cin>>T;
    while(T--){
        int n,m;
        cin >> n >> m;
        int M = 1<<m;
        A.resize(n);
        tkv(A,n);
        B.resize(m);
        tkv(B,m);
        int dp[1<<m]; // max pref of people it can give slary 
        int left[1<<m]; // amt left 
        memset(dp,-1,sizeof dp);
        memset(left,-1,sizeof left);
        dp[0] = 0;
        left[0] = 0;
        bool f= 0;
        rep(mask,0,M){
            rep(j,0,m){
                if(mask&(1<<j)==0) continue;
                int prev = mask  ^ (1<<j);
                if(dp[prev]==-1) continue;
                int na = left[prev] + B[j];
                if(na<A[dp[prev]]) {
                    dp[mask] = dp[prev];
                    left[mask] = na;
                }
                else if(na==A[dp[prev]]){
                    dp[mask] = dp[prev] + 1;
                    left[mask] = 0;
                }
            }
            if(dp[mask]==n) {f = 1;break;}
        }
        if(f) put("YES")
        else put("NO")
    }

    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:118:31: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
  118 |                 if(mask&(1<<j)==0) continue;
      |                         ~~~~~~^~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 32 ms 8404 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 5 ms 8404 KB Output is correct
9 Correct 137 ms 8512 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 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 340 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 456 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
11 Correct 2 ms 456 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 32 ms 8404 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 5 ms 8404 KB Output is correct
9 Correct 137 ms 8512 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 456 KB Output is correct
31 Correct 106 ms 8504 KB Output is correct
32 Correct 118 ms 8404 KB Output is correct
33 Correct 39 ms 8508 KB Output is correct
34 Correct 32 ms 8404 KB Output is correct
35 Correct 34 ms 8500 KB Output is correct
36 Correct 31 ms 8452 KB Output is correct
37 Correct 33 ms 8404 KB Output is correct
38 Correct 32 ms 8508 KB Output is correct
39 Correct 4 ms 8508 KB Output is correct
40 Correct 32 ms 8512 KB Output is correct
41 Correct 33 ms 8404 KB Output is correct
42 Correct 84 ms 8632 KB Output is correct
43 Correct 33 ms 8404 KB Output is correct
44 Correct 31 ms 8520 KB Output is correct
45 Correct 4 ms 8512 KB Output is correct
46 Correct 53 ms 8504 KB Output is correct
47 Correct 31 ms 8404 KB Output is correct
48 Correct 4 ms 8404 KB Output is correct
49 Correct 32 ms 8404 KB Output is correct
50 Correct 122 ms 8504 KB Output is correct
51 Correct 38 ms 8404 KB Output is correct
52 Correct 35 ms 8504 KB Output is correct
53 Correct 125 ms 8504 KB Output is correct
54 Correct 125 ms 8512 KB Output is correct
55 Correct 132 ms 8404 KB Output is correct
56 Correct 138 ms 8504 KB Output is correct
57 Correct 125 ms 8500 KB Output is correct
58 Correct 125 ms 8520 KB Output is correct