Submission #770951

# Submission time Handle Problem Language Result Execution time Memory
770951 2023-07-02T07:40:57 Z matei__b Bank (IZhO14_bank) C++14
100 / 100
112 ms 8652 KB
#include <bits/stdc++.h>
#define ll long long 
#define mod 1000000007
#define dim 100002
#define lim 1000000
#define mdim 1501
#define mult 2e9
#define maxx 200000
#define simaimult 1e17
#define piii pair<int,pair<int,int> > 
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define nr_biti __builtin_popcount
using namespace std;

ifstream fin("b.in");
ofstream fout("b.out");

int n,m;
int a[22],b[22];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> n >> m;

    for(int i=0; i<n; i++)
        cin >> a[i];
    
    for(int i=0; i<m; i++)
        cin >> b[i];

    vector<int> dp(1<<m,-1);
    vector<int> rest(1<<m,-1);

    dp[0]=rest[0]=0;

    for(int i=1; i<(1<<m); i++)
    {
        for(int j=0; j<m; j++)
        {
            if(!(i&(1<<j)))
                continue;
            if(dp[i^(1<<j)]==-1)
                continue;
            
            if(rest[i^(1<<j)]+b[j]<a[dp[i^(1<<j)]])
            {
                dp[i]=dp[i^(1<<j)];
                rest[i]=rest[i^(1<<j)]+b[j];
            }
            else if(rest[i^(1<<j)]+b[j]==a[dp[i^(1<<j)]])
            {
                dp[i]=dp[i^(1<<j)]+1;
                rest[i]=0;
            }
        }

        if(dp[i]==n)
        {
            cout << "YES";
            return 0;
        }
    }

    cout << "NO";

    return 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 0 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 81 ms 8532 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 82 ms 8532 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
# 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 0 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 81 ms 8532 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 82 ms 8532 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 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 0 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 97 ms 8532 KB Output is correct
32 Correct 98 ms 8536 KB Output is correct
33 Correct 80 ms 8536 KB Output is correct
34 Correct 75 ms 8532 KB Output is correct
35 Correct 80 ms 8532 KB Output is correct
36 Correct 80 ms 8520 KB Output is correct
37 Correct 82 ms 8592 KB Output is correct
38 Correct 75 ms 8532 KB Output is correct
39 Correct 4 ms 8532 KB Output is correct
40 Correct 82 ms 8532 KB Output is correct
41 Correct 78 ms 8532 KB Output is correct
42 Correct 112 ms 8448 KB Output is correct
43 Correct 86 ms 8544 KB Output is correct
44 Correct 79 ms 8516 KB Output is correct
45 Correct 4 ms 8532 KB Output is correct
46 Correct 93 ms 8532 KB Output is correct
47 Correct 81 ms 8532 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 83 ms 8532 KB Output is correct
50 Correct 86 ms 8540 KB Output is correct
51 Correct 76 ms 8532 KB Output is correct
52 Correct 79 ms 8532 KB Output is correct
53 Correct 97 ms 8532 KB Output is correct
54 Correct 91 ms 8532 KB Output is correct
55 Correct 88 ms 8652 KB Output is correct
56 Correct 91 ms 8532 KB Output is correct
57 Correct 84 ms 8532 KB Output is correct
58 Correct 86 ms 8532 KB Output is correct