Submission #630637

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
630637	2022-08-16T17:46:43 Z	coderInTraining	Bank (IZhO14_bank)	Java 11	100 / 100	657 ms	20964 KB

bank

import java.util.*;

public class bank {
    public static void main (String[]args) {
        Scanner scan = new Scanner (System.in);

        int peopleNumber = scan.nextInt();
        int bankNoteNumber = scan.nextInt();

        int [] salaries = new int [peopleNumber];

        for (int i = 0; i < peopleNumber; i++) {
            salaries[i] = scan.nextInt();
        }

        int [] bankNotes = new int [bankNoteNumber];

        for (int i = 0; i < bankNoteNumber; i++) {
            bankNotes[i] = scan.nextInt();
        }

        int subsetNumber = (int)Math.pow(2, bankNoteNumber);
        int [] maxPrefix = new int [subsetNumber];
        int [] leftOver = new int [subsetNumber];

        Arrays.fill(maxPrefix, Integer.MIN_VALUE);
        Arrays.fill(leftOver, Integer.MIN_VALUE);

        maxPrefix[0] = 0;
        leftOver[0] = 0;

        int max = 0;

        for (int i = 0; i < subsetNumber; i++) {

            int peopleFinished = maxPrefix[i];
            max = Math.max(max, peopleFinished);

            if (max == peopleNumber) {
                break;
            }

            if (peopleFinished == Integer.MIN_VALUE) {
                continue;
            }

            for (int j = 0; j < bankNoteNumber; j++) {
                // Checking if the current bank note has been unused
                if ((i & (1 << j)) == 0) {
                    int currentPersonTarget = salaries[peopleFinished];

                    int currentBankNote = bankNotes[j];
                    int currentLeftOver = leftOver[i];

                    int newIndex = i + (int)Math.pow(2, j);

                    if (currentLeftOver + currentBankNote < currentPersonTarget) {
                        maxPrefix[newIndex] = maxPrefix[i];
                        leftOver[newIndex] = currentLeftOver + currentBankNote;
                    }

                    if (currentLeftOver + currentBankNote == currentPersonTarget) {
                        maxPrefix[newIndex] = maxPrefix[i] + 1;
                        leftOver[newIndex] = 0;
                    }
                }
            }
        }

        if (max == peopleNumber) {
            System.out.println("YES");
        }
        else {
            System.out.println("NO");
        }
    }
}

Subtask #1

19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	98 ms	10564 KB	Output is correct
2	Correct	94 ms	10200 KB	Output is correct
3	Correct	93 ms	10340 KB	Output is correct
4	Correct	112 ms	10680 KB	Output is correct
5	Correct	128 ms	20364 KB	Output is correct
6	Correct	95 ms	10428 KB	Output is correct
7	Correct	98 ms	9960 KB	Output is correct
8	Correct	150 ms	20844 KB	Output is correct
9	Correct	657 ms	20708 KB	Output is correct

Subtask #2

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	99 ms	9956 KB	Output is correct
2	Correct	101 ms	10068 KB	Output is correct
3	Correct	100 ms	10232 KB	Output is correct
4	Correct	110 ms	10132 KB	Output is correct
5	Correct	98 ms	10128 KB	Output is correct
6	Correct	111 ms	10000 KB	Output is correct
7	Correct	100 ms	10072 KB	Output is correct
8	Correct	104 ms	10120 KB	Output is correct
9	Correct	96 ms	10388 KB	Output is correct
10	Correct	104 ms	10060 KB	Output is correct

Subtask #3

27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	129 ms	10840 KB	Output is correct
2	Correct	130 ms	11304 KB	Output is correct
3	Correct	118 ms	10912 KB	Output is correct
4	Correct	115 ms	10828 KB	Output is correct
5	Correct	118 ms	10804 KB	Output is correct
6	Correct	126 ms	10620 KB	Output is correct
7	Correct	119 ms	11632 KB	Output is correct
8	Correct	119 ms	11324 KB	Output is correct
9	Correct	114 ms	10856 KB	Output is correct
10	Correct	124 ms	10748 KB	Output is correct
11	Correct	137 ms	11316 KB	Output is correct

Subtask #4

29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	98 ms	10564 KB	Output is correct
2	Correct	94 ms	10200 KB	Output is correct
3	Correct	93 ms	10340 KB	Output is correct
4	Correct	112 ms	10680 KB	Output is correct
5	Correct	128 ms	20364 KB	Output is correct
6	Correct	95 ms	10428 KB	Output is correct
7	Correct	98 ms	9960 KB	Output is correct
8	Correct	150 ms	20844 KB	Output is correct
9	Correct	657 ms	20708 KB	Output is correct
10	Correct	99 ms	9956 KB	Output is correct
11	Correct	101 ms	10068 KB	Output is correct
12	Correct	100 ms	10232 KB	Output is correct
13	Correct	110 ms	10132 KB	Output is correct
14	Correct	98 ms	10128 KB	Output is correct
15	Correct	111 ms	10000 KB	Output is correct
16	Correct	100 ms	10072 KB	Output is correct
17	Correct	104 ms	10120 KB	Output is correct
18	Correct	96 ms	10388 KB	Output is correct
19	Correct	104 ms	10060 KB	Output is correct
20	Correct	129 ms	10840 KB	Output is correct
21	Correct	130 ms	11304 KB	Output is correct
22	Correct	118 ms	10912 KB	Output is correct
23	Correct	115 ms	10828 KB	Output is correct
24	Correct	118 ms	10804 KB	Output is correct
25	Correct	126 ms	10620 KB	Output is correct
26	Correct	119 ms	11632 KB	Output is correct
27	Correct	119 ms	11324 KB	Output is correct
28	Correct	114 ms	10856 KB	Output is correct
29	Correct	124 ms	10748 KB	Output is correct
30	Correct	137 ms	11316 KB	Output is correct
31	Correct	539 ms	20860 KB	Output is correct
32	Correct	579 ms	20548 KB	Output is correct
33	Correct	165 ms	20872 KB	Output is correct
34	Correct	127 ms	20356 KB	Output is correct
35	Correct	124 ms	20240 KB	Output is correct
36	Correct	139 ms	20512 KB	Output is correct
37	Correct	134 ms	20400 KB	Output is correct
38	Correct	122 ms	20460 KB	Output is correct
39	Correct	118 ms	20172 KB	Output is correct
40	Correct	134 ms	20048 KB	Output is correct
41	Correct	136 ms	20404 KB	Output is correct
42	Correct	331 ms	20840 KB	Output is correct
43	Correct	137 ms	20120 KB	Output is correct
44	Correct	125 ms	20168 KB	Output is correct
45	Correct	136 ms	20808 KB	Output is correct
46	Correct	210 ms	20964 KB	Output is correct
47	Correct	129 ms	20292 KB	Output is correct
48	Correct	118 ms	20212 KB	Output is correct
49	Correct	130 ms	20160 KB	Output is correct
50	Correct	586 ms	20804 KB	Output is correct
51	Correct	143 ms	20720 KB	Output is correct
52	Correct	143 ms	20264 KB	Output is correct
53	Correct	600 ms	20632 KB	Output is correct
54	Correct	593 ms	20628 KB	Output is correct
55	Correct	557 ms	20920 KB	Output is correct
56	Correct	610 ms	20816 KB	Output is correct
57	Correct	606 ms	20800 KB	Output is correct
58	Correct	592 ms	20668 KB	Output is correct