oj.uz

Submission #497311

# Submission time Handle Problem Language Result Execution time Memory
497311 2021-12-23T02:34:14 Z tphuc2908 Bank (IZhO14_bank) C++14
100 / 100
 109 ms 8640 KB 
#include <bits/stdc++.h>

using namespace std;
#define rep(i,x,y) for(int i = x; i <= y; ++i)
#define repi(i,x,y) for(int i = x; i >= y; --i)
#define fi first
#define se second
#define ci(x) int x; cin >> x
#define cii(x,y) int x, y; cin >> x >> y
#define ciii(x,y,z) int x,y,z; cin >> x >> y >> z
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
//#define int long long
typedef long long ll;
const int N = 5e5 + 5;
const int mod = 1e9 + 7;
const int mod1 = 1e9 + 9;
const int pi = 23;
const int inf = 1e9 + 5;

void read_file(){
    freopen("text.inp", "r", stdin);
//    freopen("SEARCHING.INP" , "r", stdin);
//    freopen("SEARCHING.OUT", "w", stdout);
}

/*
    dp[bit][i] is the subset of M so that you can pay for first i members
    enumerate subset of subset in 3^n for sub 1,2,3
    for sub 4, use pair<int,int> dp[bit] is the maximum numbers of costumers you can pay and the
    least amount left to pay the next costumer.
*/

int n, m;
int a[N], b[N];
int dp[(1<<20) + 5][25];

void inp(){
    cin >> n >> m;
    rep(i,1,n) cin >> a[i];
    rep(i,0,m-1) cin >> b[i];
}

int sum[(1<<20) + 5];

void process(){
    rep(i,0,(1<<m)-1)
        for(int j = 0; j < m; ++j)
            if((i>>j)&1)
                sum[i] += b[j];
    if(n==1){
        bool ok = 0;
        rep(i,0,(1<<m)-1)
            if(sum[i]==a[1]){
                ok = 1;
                break;
            }
        if(ok) cout << "YES";
        else cout << "NO";
        return;
    }
    dp[0][0] = 1;
    rep(i,1,(1<<m)-1){
        for(int t = i; t; t = (t-1)&i){
            rep(j,1,n){
                int s = sum[t];
                if(s==a[j] && dp[i^t][j-1]){
                    dp[i][j] = 1;
                }
            }
        }
    }
    bool ok = 0;
    rep(i,0,(1<<m)-1)
        if(dp[i][n]){
            ok = 1;
            break;
        }
    if(ok) cout << "YES";
    else cout << "NO";
}

pair<int,int> f[(1<<20) + 5];

void sub4(){
    f[0] = {0, a[1]};
    rep(i,1,(1<<m)-1)
        f[i].se = inf;
    for(int i = 1; i < (1<<m); ++i){
        for(int j = 0; j < m; ++j){
            if((i>>j)&1){
                pair<int,int> temp = f[i^(1<<j)];
                if(temp.se==b[j])
                    temp = {temp.fi + 1, a[temp.fi + 2]};
                else if(temp.se > b[j])
                        temp.se-=b[j];
                if(temp.fi > f[i].fi)
                    f[i] = temp;
                else if(temp.fi == f[i].fi && temp.se < f[i].se)
                        f[i] = temp;
            }
        }
        if(f[i].fi==n){
            cout << "YES\n";
            return;
        }
    }
    cout << "NO\n";
}

int main()
{
    //read_file();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    inp();
//    if(n==1 || m <= 14)
//        process();
//    else
        sub4();
    return 0;
}

Compilation message

bank.cpp: In function 'void read_file()':
bank.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen("text.inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 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 588 KB Output is correct
5 Correct 55 ms 8524 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 3 ms 8524 KB Output is correct
9 Correct 53 ms 8420 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 0 ms 332 KB Output is correct
5 Correct 0 ms 276 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 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 588 KB Output is correct
5 Correct 55 ms 8524 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 3 ms 8524 KB Output is correct
9 Correct 53 ms 8420 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 0 ms 332 KB Output is correct
14 Correct 0 ms 276 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 74 ms 8524 KB Output is correct
32 Correct 87 ms 8524 KB Output is correct
33 Correct 109 ms 8524 KB Output is correct
34 Correct 69 ms 8524 KB Output is correct
35 Correct 75 ms 8524 KB Output is correct
36 Correct 63 ms 8524 KB Output is correct
37 Correct 74 ms 8520 KB Output is correct
38 Correct 66 ms 8524 KB Output is correct
39 Correct 3 ms 8524 KB Output is correct
40 Correct 66 ms 8512 KB Output is correct
41 Correct 58 ms 8524 KB Output is correct
42 Correct 102 ms 8524 KB Output is correct
43 Correct 76 ms 8528 KB Output is correct
44 Correct 57 ms 8528 KB Output is correct
45 Correct 4 ms 8512 KB Output is correct
46 Correct 103 ms 8640 KB Output is correct
47 Correct 63 ms 8528 KB Output is correct
48 Correct 4 ms 8524 KB Output is correct
49 Correct 53 ms 8524 KB Output is correct
50 Correct 72 ms 8524 KB Output is correct
51 Correct 73 ms 8524 KB Output is correct
52 Correct 69 ms 8524 KB Output is correct
53 Correct 87 ms 8532 KB Output is correct
54 Correct 94 ms 8524 KB Output is correct
55 Correct 71 ms 8524 KB Output is correct
56 Correct 73 ms 8524 KB Output is correct
57 Correct 73 ms 8524 KB Output is correct
58 Correct 73 ms 8524 KB Output is correct