oj.uz

Submission #673347

# Submission time Handle Problem Language Result Execution time Memory
673347 2022-12-20T09:05:48 Z beedle Bank (IZhO14_bank) C++17
100 / 100
 163 ms 16844 KB 
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <set>
#include <iterator>
#include <stack>
#include <map>
#include <math.h>
#include <bitset>
#include <deque>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <complex>
#include <assert.h>
#include <unordered_set>
#include <unordered_map>
#define ll long long
#define ld long long double
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define mod 1000000007ll
#define INF 1e18
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define all(x) (x).begin (), (x).end ()
#define sz(x) (ll) (x).size ()
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define rank rnk
#define log lg
#define fast                                                                  \
    ios_base::sync_with_stdio (false);                                        \
    cin.tie (NULL);                                                           \
    cout.tie (NULL)
 
using namespace std;

signed main()
{
    fast;

    // freopen("bank.in","r",stdin);
    // freopen("bank.out","w",stdout);

    ll n,m;
    cin>>n>>m;
    ll p[n], notes[m];
    rep(i,0,n-1)
    cin>>p[i];
    rep(i,0,m-1)
    cin>>notes[i];

    vector <ll> cancover(1<<m,-1);
    vector <ll> left(1<<m);

    rep(mask,0,(1<<m)-1)
    rep(idx,0,m-1)
    if(mask&(1ll<<idx))
    left[mask]+=notes[idx];

    rep(mask,1,(1<<m)-1)
    {
        rep(idx,0,m-1)
        if(mask&(1ll<<idx))
        {
            ll submask=mask^(1ll<<idx);
            ll next=cancover[submask]+1;
            if(next==n)
            {
                cancover[mask]=n-1;
                left[mask]=left[submask]+notes[idx];
            }
            else
            {
                if(left[submask]==p[next] || left[submask]+notes[idx]==p[next] || notes[idx]==p[next])
                {
                    if(next>cancover[mask])
                    {
                        cancover[mask]=next;
                        left[mask]=left[submask]+notes[idx]-p[next];
                    }
                }
                else
                {
                    if(cancover[submask]>cancover[mask])
                    {
                        cancover[mask]=cancover[submask];
                        left[mask]=left[submask]+notes[idx];
                    }
                }
            }
        }
    }

    bool ans=false;
    rep(i,0,(1<<m)-1)
    ans|=(cancover[i]==n-1);

    // cout<<cancover[20]<<" "<<left[20]<<endl;
    // cout<<cancover[21]<<" "<<left[21]<<endl;

    cout<<(ans?"YES":"NO");

    return 0;  
}

/*
1 5
8 
4 2 5 1 3
*/

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 123 ms 16700 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 149 ms 16728 KB Output is correct
9 Correct 124 ms 16736 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 123 ms 16700 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 149 ms 16728 KB Output is correct
9 Correct 124 ms 16736 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 3 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 124 ms 16724 KB Output is correct
32 Correct 132 ms 16744 KB Output is correct
33 Correct 128 ms 16732 KB Output is correct
34 Correct 128 ms 16724 KB Output is correct
35 Correct 128 ms 16736 KB Output is correct
36 Correct 132 ms 16752 KB Output is correct
37 Correct 123 ms 16704 KB Output is correct
38 Correct 122 ms 16724 KB Output is correct
39 Correct 163 ms 16728 KB Output is correct
40 Correct 130 ms 16724 KB Output is correct
41 Correct 123 ms 16724 KB Output is correct
42 Correct 129 ms 16724 KB Output is correct
43 Correct 125 ms 16724 KB Output is correct
44 Correct 122 ms 16700 KB Output is correct
45 Correct 142 ms 16832 KB Output is correct
46 Correct 129 ms 16724 KB Output is correct
47 Correct 128 ms 16724 KB Output is correct
48 Correct 161 ms 16664 KB Output is correct
49 Correct 124 ms 16704 KB Output is correct
50 Correct 153 ms 16724 KB Output is correct
51 Correct 132 ms 16724 KB Output is correct
52 Correct 126 ms 16732 KB Output is correct
53 Correct 145 ms 16708 KB Output is correct
54 Correct 139 ms 16724 KB Output is correct
55 Correct 130 ms 16732 KB Output is correct
56 Correct 126 ms 16740 KB Output is correct
57 Correct 134 ms 16844 KB Output is correct
58 Correct 130 ms 16748 KB Output is correct