Submission #1182694

#	Time	Username	Problem	Language	Result	Execution time	Memory
1182694		grimreaper	Bank (IZhO14_bank)	C++20	0 / 100	1 ms	580 KiB

bank

#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define vll vector<long long>
#define vpll vector< pair<long long int , long long int > > 
#define rep(i,x,a) for (long long i=x; i<a; i++)
#define si(x) (long long int)x.size()
#define pb push_back
#define ff first
#define ss second
#define lg2(x) (long long int)log2(x)
#define gap " "
#define nl '\n' 
#define all(x) (x).begin(),(x).end()
#define no cout<<"No\n"
#define yes cout<<"Yes\n"
#define vld vector<long double>

typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif

void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}
void print(){
    cout << '\n';
}
template<class T, class... Ts>
void print(const T& a, const Ts&... b){
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}
template<class... T>
void input(T&... a){
    (cin >> ... >> a);
}

template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MOD=1e9+7;
const int N=1e6+10;;
const ll INF=1e16;
const long long int  LINF=LLONG_MAX;

/*------------------------------------*/

void solve(int tc = 0) 
{
    ll n,m;cin >> n >> m;
    vll a(n),b(m);rep(i,0,n)cin >> a[i];rep(i,0,m)cin >> b[i];
    vector<pair<ll,ll>> dp(1<<m,{-1,0});
    dp[0] = {0,0};
    for(int i=0;i<(1<<m);i++){
        for(int j=0;j<m;j++){
            if(!(i&(1<<j)))continue;
            ll last = i^(1<<j);
            if(dp[last].first == -1)continue;
            ll target = a[dp[last].first];
            if((dp[last].second + b[j]) < target){
                dp[i].first = dp[last].first;
                dp[i].second += b[j];
            }
            else if((dp[last].second + b[j]) == target) {
                dp[i].first = dp[last].first + 1;
                dp[i].second = 0;
            }
        }
        if(dp[i].first == n){
            yes;return;
        }
    } 
    no; 
}

/*------------------------------------*/

int main()
{   
#ifndef ONLINE_JUDGE
    freopen("Error.txt","w",stderr);
#endif
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); cout.tie(nullptr);  
    ll tc=1;
    for(int i=0 ; i < tc ; i++)
    {
        solve(i);
    }
return 0;
}

Compilation message (stderr)

bank.cpp: In function 'int main()':
bank.cpp:107:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |     freopen("Error.txt","w",stderr);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29