oj.uz

Submission #496670

# Submission time Handle Problem Language Result Execution time Memory
496670 2021-12-21T19:13:36 Z SinsAries Bank (IZhO14_bank) C++17
100 / 100
 136 ms 16816 KB 
#include<bits/stdc++.h>

using namespace std;

// type
using ll = long long;
using ld = long double;
using db = double;
using str = string;

// pairs
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

// vector
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define sor(x) sort(all(x))
#define rsz resize
#define rtn return

// binary search
#define lb lower_bound
#define ub upper_bound
template<class T> ll lwb(vector<T>& a, const T& b) { rtn lb(all(a), b) - a.begin(); }
template<class T> ll upb(vector<T>& a, const T& b) { rtn ub(all(a), b) - a.begin(); }

// pairs
#define mp make_pair
#define f first
#define s second

// loops
#define FOR(i,a,b) for (ll i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (ll i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define each(a,x) for (auto& a: x)
#define cont continue
#define bre break

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void setIO(str s) {
    setIn(s+".inp"); setOut(s+".out");
}

const int MOD =  1e9 + 7; //998244353;
const int MX = 2e5+5;
const ll INF = 1e9;
const db PI = acos((db)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;

// modulo, exponentiation, inverse
ll pow_mod(ll a, ll b, ll m) { ll res = 1; while(b){ res = res * (b & 1 ? a : 1) % m; a = a * a % m; b >>= 1; } rtn res; }
ll inv(ll a, ll m) { rtn pow_mod(a, m - 2, m); }

ll nxt(void){ // fast way for cin operation
    ll x; cin >> x;
    rtn x;
}

#define isOn(i, mask) ((mask >> i) & 1)

ll n, m, a[20], b[20];

pl dp[1 << 20];

void init(void){
    cin >> n >> m;
    F0R(i, n) cin >> a[i];
    F0R(i, m) cin >> b[i];
    F0R(mask, 1 << n) dp[mask] = {-INF, 0};
    dp[0] = {0, 0};
}

void solve(void){
    F0R(mask, 1 << m){
        if(dp[mask].f == -INF) cont;

//        cout << mask << ' ' << dp[mask].f << ' ' << dp[mask].s << '\n';

        if(dp[mask].f == n){
            cout << "YES";
            rtn;
        }

        F0R(i, m) if(!isOn(i, mask)){
            ll newVal = dp[mask].s + b[i];

            if(newVal < dp[mask | (1 << i)].f) cont;

            ll target = a[dp[mask].f];

            if(newVal < target)
                dp[mask | (1 << i)] = max(dp[mask | (1 << i)],{dp[mask].f, newVal});
            else if(newVal == target)
                dp[mask | (1 << i)] = max(dp[mask | (1 << i)], {dp[mask].f + 1, 0});
        }
    }
    cout << "NO";
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
//    setIO("CodeforcesEasy");

    init();
    solve();

    rtn 0;
}

Compilation message

bank.cpp: In function 'void setIn(str)':
bank.cpp:54:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
bank.cpp: In function 'void setOut(str)':
bank.cpp:55:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 96 ms 16588 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 90 ms 16704 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 96 ms 16588 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 90 ms 16704 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 572 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 0 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 3 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 3 ms 460 KB Output is correct
30 Correct 2 ms 572 KB Output is correct
31 Correct 111 ms 16580 KB Output is correct
32 Correct 101 ms 16676 KB Output is correct
33 Correct 136 ms 16704 KB Output is correct
34 Correct 125 ms 16592 KB Output is correct
35 Correct 120 ms 16704 KB Output is correct
36 Correct 10 ms 16712 KB Output is correct
37 Correct 106 ms 16704 KB Output is correct
38 Correct 75 ms 16672 KB Output is correct
39 Correct 1 ms 320 KB Output is correct
40 Correct 90 ms 16640 KB Output is correct
41 Correct 9 ms 16716 KB Output is correct
42 Correct 126 ms 16636 KB Output is correct
43 Correct 113 ms 16708 KB Output is correct
44 Correct 91 ms 16636 KB Output is correct
45 Correct 1 ms 844 KB Output is correct
46 Correct 123 ms 16656 KB Output is correct
47 Correct 85 ms 16580 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 89 ms 16816 KB Output is correct
50 Correct 87 ms 16716 KB Output is correct
51 Correct 99 ms 16712 KB Output is correct
52 Correct 87 ms 16696 KB Output is correct
53 Correct 103 ms 16716 KB Output is correct
54 Correct 81 ms 16716 KB Output is correct
55 Correct 71 ms 16704 KB Output is correct
56 Correct 70 ms 16716 KB Output is correct
57 Correct 69 ms 16700 KB Output is correct
58 Correct 70 ms 16620 KB Output is correct