oj.uz

Submission #580405

# Submission time Handle Problem Language Result Execution time Memory
580405 2022-06-21T08:05:54 Z duydong05 Bank (IZhO14_bank) C++14
100 / 100
 147 ms 16764 KB 
#include <bits/stdc++.h>
#define ll long long 
#define pii pair <int, int >
#define pll pair <ll, ll >
#define FOR(i,a,b ) for (int i =a; i <= b ;i++)
#define FORD(i,a,b) for (int i =a; i >= b ; i--)
using namespace std;
const ll nMax= 2e6 +5;
const ll oo =1e9;
const ll mod =1e9 +7;
ll n, m , salary[nMax], bankNotes[nMax] ;
//ll people[nMax], leftover[nMax];
int main() {
    
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    cin >> n >> m ;
    FOR(i, 0, n-1) cin >> salary[i] ;
    FOR(i, 0, m -1 ) cin >> bankNotes[i];
    vector <ll> leftover(1 << m , -1) , people(1 << m , -1);
    leftover[0] = 0;
    people[0] = 0;
    FOR(mask,  1, (1 << m ) - 1) {
        FOR(i, 0,  m -1) {
            if ((mask & (1 << i)) == 0 ) continue;
            int prev = mask ^ (1 << i ) ;
            if (people[prev]  == -1) continue;
            ll newamount = leftover[prev] + bankNotes[i];
            ll targetcur = salary[people[prev]];
            if (newamount < targetcur ) {
                people[mask] = people[prev] ;
                leftover[mask] = newamount;
            }
            else if (newamount == targetcur) {
                people[mask] = people[prev] +1;
                leftover[mask] = 0;
            }

        }
        if (people[mask] == n ) {
            cout  <<"YES";
            return 0;
        }
    } 
    cout << "NO";
    return 0;
}

Subtask #1
19.0 / 19.0

# 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 336 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 73 ms 16756 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 8 ms 16720 KB Output is correct
9 Correct 108 ms 16756 KB Output is correct

Subtask #2
25.0 / 25.0

# 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 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 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 336 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 73 ms 16756 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 8 ms 16720 KB Output is correct
9 Correct 108 ms 16756 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 1 ms 584 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 125 ms 16752 KB Output is correct
32 Correct 118 ms 16724 KB Output is correct
33 Correct 80 ms 16748 KB Output is correct
34 Correct 71 ms 16724 KB Output is correct
35 Correct 80 ms 16724 KB Output is correct
36 Correct 76 ms 16760 KB Output is correct
37 Correct 73 ms 16724 KB Output is correct
38 Correct 70 ms 16724 KB Output is correct
39 Correct 8 ms 16724 KB Output is correct
40 Correct 76 ms 16652 KB Output is correct
41 Correct 75 ms 16752 KB Output is correct
42 Correct 147 ms 16752 KB Output is correct
43 Correct 79 ms 16724 KB Output is correct
44 Correct 78 ms 16724 KB Output is correct
45 Correct 8 ms 16724 KB Output is correct
46 Correct 100 ms 16716 KB Output is correct
47 Correct 73 ms 16756 KB Output is correct
48 Correct 7 ms 16724 KB Output is correct
49 Correct 72 ms 16764 KB Output is correct
50 Correct 103 ms 16752 KB Output is correct
51 Correct 75 ms 16764 KB Output is correct
52 Correct 78 ms 16724 KB Output is correct
53 Correct 123 ms 16724 KB Output is correct
54 Correct 134 ms 16756 KB Output is correct
55 Correct 102 ms 16756 KB Output is correct
56 Correct 99 ms 16756 KB Output is correct
57 Correct 109 ms 16732 KB Output is correct
58 Correct 131 ms 16724 KB Output is correct