Submission #1013317

#	Time	Username	Problem	Language	Result	Execution time	Memory
1013317		YassineBenYounes	Bank (IZhO14_bank)	C++17	0 / 100	1 ms	2396 KiB

bank

#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////

void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}

void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}
//#define int ll
const int mx = (1 << 20) + 7;
const int LOG = 25;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 350;

int a[25];
int b[25];
int ind[mx];
int last[mx];

int main(){
    speed;
    int n,m;cin >> n >> m;
    for(int i = 0;i < n; i++){
        cin >> a[i];
    }
    for(int i = 0 ; i < m;i++){
        cin >> b[i];
    }
    ind[0] = -1;
    last[0] = 0;
    bool ok = 0;
    for(int mask = 0;!ok && mask < (1 << m); mask++){
        ind[mask] = -1;
        last[mask] = 0;
        for(int i = 0; i < m;i++){
            if(mask & (1 << i))continue;
            int x = last[mask] + b[i];
            if(x == a[ind[mask] + 1]){
                ind[mask | (1 << i)] = ind[mask];
                last[mask | (1 << i)] = last[mask];
            }
            else if(x < a[ind[mask] + 1]){
                ind[mask | (1 << i)] = ind[mask] + 1;
                last[mask | (1 << i)] = 0;
            }
            if(ind[mask | (1 << i)] == (n-1)){
                ok = 1;
                break;
            }
        }
    }
    cout << (ok ? "YES" : "NO") << endl;
}

/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message (stderr)

bank.cpp: In function 'void usaco_problem()':
bank.cpp:32:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp: In function 'void init()':
bank.cpp:39:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:41:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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