oj.uz

Submission #566168

# Submission time Handle Problem Language Result Execution time Memory
566168 2022-05-22T02:44:44 Z LeonaRaging Bank (IZhO14_bank) C++14
100 / 100
 113 ms 8524 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const int N = 20;
const int maxn = 1e5 + 4;
const int INF = 1e9;

int n, m, people[N], banknote[N], people_covered[1 << N], leftover[1 << N];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen(".INP", "r", stdin);
    //freopen(".OUT", "w", stdout);
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> people[i];
    for (int i = 0; i < m; i++) cin >> banknote[i];
    memset(people_covered, -1, sizeof people_covered);
    memset(leftover, -1, sizeof leftover);
    leftover[0] = people_covered[0] = 0;
    for (int s = 0; s < (1 << m); s++)
    {
        for (int last = 0; last < m; last++)
        {
            if ((s & (1 << last)) == 0) continue;
            int prev = s ^ (1 << last);
            if (people_covered[prev] == -1) continue;
            int new_salary = leftover[prev] + banknote[last];
            int cur_salary = people[people_covered[prev]];
            if (new_salary < cur_salary)
            {
                people_covered[s] = people_covered[prev];
                leftover[s] = new_salary;
            }
            else if (new_salary == cur_salary)
            {
                people_covered[s] = people_covered[prev] + 1;
                leftover[s] = 0;
            }
        }
        if (people_covered[s] == n)
        {
           cout << "YES";
           return 0;
        }
    }
    cout << "NO";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 4 ms 8404 KB Output is correct
3 Correct 4 ms 8404 KB Output is correct
4 Correct 4 ms 8404 KB Output is correct
5 Correct 65 ms 8508 KB Output is correct
6 Correct 3 ms 8404 KB Output is correct
7 Correct 3 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 89 ms 8512 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 4 ms 8404 KB Output is correct
3 Correct 4 ms 8404 KB Output is correct
4 Correct 4 ms 8404 KB Output is correct
5 Correct 65 ms 8508 KB Output is correct
6 Correct 3 ms 8404 KB Output is correct
7 Correct 3 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 89 ms 8512 KB Output is correct
10 Correct 3 ms 8404 KB Output is correct
11 Correct 4 ms 8404 KB Output is correct
12 Correct 3 ms 8404 KB Output is correct
13 Correct 3 ms 8404 KB Output is correct
14 Correct 3 ms 8524 KB Output is correct
15 Correct 4 ms 8404 KB Output is correct
16 Correct 4 ms 8404 KB Output is correct
17 Correct 3 ms 8404 KB Output is correct
18 Correct 3 ms 8404 KB Output is correct
19 Correct 4 ms 8404 KB Output is correct
20 Correct 5 ms 8404 KB Output is correct
21 Correct 6 ms 8524 KB Output is correct
22 Correct 5 ms 8520 KB Output is correct
23 Correct 5 ms 8404 KB Output is correct
24 Correct 5 ms 8404 KB Output is correct
25 Correct 5 ms 8404 KB Output is correct
26 Correct 5 ms 8404 KB Output is correct
27 Correct 4 ms 8404 KB Output is correct
28 Correct 5 ms 8404 KB Output is correct
29 Correct 5 ms 8404 KB Output is correct
30 Correct 5 ms 8404 KB Output is correct
31 Correct 111 ms 8504 KB Output is correct
32 Correct 101 ms 8508 KB Output is correct
33 Correct 75 ms 8404 KB Output is correct
34 Correct 63 ms 8404 KB Output is correct
35 Correct 63 ms 8404 KB Output is correct
36 Correct 63 ms 8500 KB Output is correct
37 Correct 64 ms 8504 KB Output is correct
38 Correct 63 ms 8504 KB Output is correct
39 Correct 4 ms 8404 KB Output is correct
40 Correct 67 ms 8404 KB Output is correct
41 Correct 66 ms 8500 KB Output is correct
42 Correct 113 ms 8504 KB Output is correct
43 Correct 68 ms 8500 KB Output is correct
44 Correct 62 ms 8504 KB Output is correct
45 Correct 4 ms 8404 KB Output is correct
46 Correct 89 ms 8504 KB Output is correct
47 Correct 62 ms 8500 KB Output is correct
48 Correct 3 ms 8404 KB Output is correct
49 Correct 64 ms 8404 KB Output is correct
50 Correct 89 ms 8404 KB Output is correct
51 Correct 67 ms 8504 KB Output is correct
52 Correct 67 ms 8500 KB Output is correct
53 Correct 113 ms 8404 KB Output is correct
54 Correct 102 ms 8500 KB Output is correct
55 Correct 89 ms 8508 KB Output is correct
56 Correct 86 ms 8404 KB Output is correct
57 Correct 86 ms 8508 KB Output is correct
58 Correct 87 ms 8404 KB Output is correct