답안 #434621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434621	2021-06-21T13:17:22 Z	fvogel499	은행 (IZhO14_bank)	C++14	100 / 100	135 ms	8552 KB

bank

/*
File created on 06/21/2021 at 14:51:13.
Link to problem: https://oj.uz/problem/view/IZhO14_bank
Description: 
Time complexity: O()
Space complexity: O()
Status: DEV
Copyright: Ⓒ 2021 Francois Vogel
*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>

using namespace std;
using namespace __gnu_pbds;

#define pii pair<int, int>
#define f first
#define s second

#define pb push_back
#define ins insert
#define cls clear

#define ll long long

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int siz = 20;

int nbPeople, nbBanknotes;
int people [siz];
int banknotes [siz];
int lp [1<<siz];
int lft [1<<siz];

void dp(int x) {
    if (lp[x] != -2) return;
    lp[x] = -1;
    lft[x] = 0;
    for (int i = 0; i < nbBanknotes; i++) if ((x>>i)&1) {
        int nx = x&~(1<<i);
        dp(nx);
        int locPref = lp[nx];
        int locLeft = lft[nx]+banknotes[i];
        if (locPref+1 < nbPeople and locLeft == people[locPref+1]) {
            locPref++;
            locLeft = 0;
        }
        if (locPref > lp[x] or (locPref == lp[x] and locLeft > lft[x])) {
            lp[x] = locPref;
            lft[x] = locLeft;
        }
    }
}

signed main() {
    cin.tie(0);
    // ios_base::sync_with_stdio(0);

    cin >> nbPeople >> nbBanknotes;
    for (int i = 0; i < nbPeople; i++) cin >> people[i];
    for (int i = 0; i < nbBanknotes; i++) cin >> banknotes[i];
    for (int i = 0; i < (1<<nbBanknotes); i++) lp[i] = -2;
    for (int i = 0; i < (1<<nbBanknotes); i++) {
        dp(i);
        if (lp[i] == nbPeople-1) {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";

    int d = 0;
    d++;
}

Subtask #1
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	104 ms	8416 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	3 ms	4300 KB	Output is correct
9	Correct	106 ms	8400 KB	Output is correct

Subtask #2
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	332 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	2 ms	332 KB	Output is correct
4	Correct	2 ms	332 KB	Output is correct
5	Correct	2 ms	332 KB	Output is correct
6	Correct	2 ms	332 KB	Output is correct
7	Correct	2 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	2 ms	460 KB	Output is correct
11	Correct	2 ms	332 KB	Output is correct

Subtask #4
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	104 ms	8416 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	3 ms	4300 KB	Output is correct
9	Correct	106 ms	8400 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	332 KB	Output is correct
31	Correct	117 ms	8388 KB	Output is correct
32	Correct	123 ms	8388 KB	Output is correct
33	Correct	124 ms	8536 KB	Output is correct
34	Correct	111 ms	8476 KB	Output is correct
35	Correct	116 ms	8476 KB	Output is correct
36	Correct	111 ms	8412 KB	Output is correct
37	Correct	111 ms	8364 KB	Output is correct
38	Correct	107 ms	8516 KB	Output is correct
39	Correct	3 ms	4300 KB	Output is correct
40	Correct	114 ms	8408 KB	Output is correct
41	Correct	105 ms	8388 KB	Output is correct
42	Correct	135 ms	8388 KB	Output is correct
43	Correct	116 ms	8388 KB	Output is correct
44	Correct	104 ms	8388 KB	Output is correct
45	Correct	3 ms	4300 KB	Output is correct
46	Correct	127 ms	8552 KB	Output is correct
47	Correct	111 ms	8420 KB	Output is correct
48	Correct	3 ms	4300 KB	Output is correct
49	Correct	105 ms	8372 KB	Output is correct
50	Correct	115 ms	8388 KB	Output is correct
51	Correct	114 ms	8452 KB	Output is correct
52	Correct	110 ms	8408 KB	Output is correct
53	Correct	124 ms	8420 KB	Output is correct
54	Correct	123 ms	8372 KB	Output is correct
55	Correct	113 ms	8412 KB	Output is correct
56	Correct	119 ms	8428 KB	Output is correct
57	Correct	119 ms	8412 KB	Output is correct
58	Correct	121 ms	8388 KB	Output is correct

답안 #434621

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 29.0 / 29.0

Subtask #1
19.0 / 19.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
29.0 / 29.0