AlgorithmsAndAbstractDesign/Program3.java at main · allisonfintz/AlgorithmsAndAbstractDesign · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
importjava.util.ArrayList;
importjava.util.List;
importjava.util.Scanner;

classProgram3 {
publicrecordResult(intnumPlatforms, inttotalHeight, int[] numPaintings) {}

/**
 * Solution to program 3
 *
 * @param n number of paintings
 * @param w width of the platform
 * @param heights array of heights of the paintings
 * @param widths array of widths of the paintings
 * @return Result object containing the number of platforms, total height of the paintings,
 * and the number of paintings on each platform
 */
privatestaticResultprogram3(intn, intw, int[] heights, int[] widths) {
intminHeight = Integer.MAX_VALUE;
int[] bestNumPaintings = null;

// There are 2^(n-1) possible ways to partition the paintings
inttotalPartitions = (int) Math.pow(2, n - 1);

for (intpartition = 0; partition < totalPartitions; partition++) {
inttotalHeight = 0;
intstart = 0;
List<Integer> numPaintingsList = newArrayList<>();

inttotalWidth = 0;
intmaxHeight = 0;
intcurrentPartition = partition;

for (inti = 0; i < n; i++) {
// Add the current painting to the current platform
totalWidth += widths[i];
maxHeight = Math.max(maxHeight, heights[i]);

// If total width exceeds platform width, this partition is invalid
if (totalWidth > w) {
totalHeight = Integer.MAX_VALUE;
break;
 }

// If there is a break after the current painting or it's the last painting
if ((currentPartition % 2 != 0) || i == n - 1) {
totalHeight += maxHeight;
numPaintingsList.add(i - start + 1);
// Reset for the next platform
start = i + 1;
totalWidth = 0;
maxHeight = 0;
 }

// Update partition by dividing it by 2 to check the next bit in the next iteration
currentPartition /= 2;
 }

// If this partition has a lower total height, update the best partition
if (totalHeight < minHeight) {
minHeight = totalHeight;
bestNumPaintings = newint[numPaintingsList.size()];
for (inti = 0; i < numPaintingsList.size(); i++) {
bestNumPaintings[i] = numPaintingsList.get(i);
 }
 }
 }

intnumPlatforms;
if (bestNumPaintings != null) {
numPlatforms = bestNumPaintings.length;
 } else {
numPlatforms = 0;
 }
returnnewResult(numPlatforms, minHeight, bestNumPaintings);
}

publicstaticvoidmain(String[] args) {
Scannersc = newScanner(System.in);
intn = sc.nextInt();
intW = sc.nextInt();
int[] heights = newint[n];
int[] widths = newint[n];
for (inti = 0; i < n; i++) {
heights[i] = sc.nextInt();
 }
for (inti = 0; i < n; i++) {
widths[i] = sc.nextInt();
 }
sc.close();
Resultresult = program3(n, W, heights, widths);
System.out.println(result.numPlatforms());
System.out.println(result.totalHeight());
for (inti = 0; i < result.numPaintings().length; i++) {
System.out.println(result.numPaintings()[i]);
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
importjava.util.ArrayList;
importjava.util.List;
importjava.util.Scanner;

classProgram3 {
publicrecordResult(intnumPlatforms, inttotalHeight, int[] numPaintings) {}

/**
 * Solution to program 3
 *
 * @param n number of paintings
 * @param w width of the platform
 * @param heights array of heights of the paintings
 * @param widths array of widths of the paintings
 * @return Result object containing the number of platforms, total height of the paintings,
 * and the number of paintings on each platform
 */
privatestaticResultprogram3(intn, intw, int[] heights, int[] widths) {
intminHeight = Integer.MAX_VALUE;
int[] bestNumPaintings = null;

// There are 2^(n-1) possible ways to partition the paintings
inttotalPartitions = (int) Math.pow(2, n - 1);

for (intpartition = 0; partition < totalPartitions; partition++) {
inttotalHeight = 0;
intstart = 0;
List<Integer> numPaintingsList = newArrayList<>();

inttotalWidth = 0;
intmaxHeight = 0;
intcurrentPartition = partition;

for (inti = 0; i < n; i++) {
// Add the current painting to the current platform
totalWidth += widths[i];
maxHeight = Math.max(maxHeight, heights[i]);

// If total width exceeds platform width, this partition is invalid
if (totalWidth > w) {
totalHeight = Integer.MAX_VALUE;
break;
 }

// If there is a break after the current painting or it's the last painting
if ((currentPartition % 2 != 0) || i == n - 1) {
totalHeight += maxHeight;
numPaintingsList.add(i - start + 1);
// Reset for the next platform
start = i + 1;
totalWidth = 0;
maxHeight = 0;
 }

// Update partition by dividing it by 2 to check the next bit in the next iteration
currentPartition /= 2;
 }

// If this partition has a lower total height, update the best partition
if (totalHeight < minHeight) {
minHeight = totalHeight;
bestNumPaintings = newint[numPaintingsList.size()];
for (inti = 0; i < numPaintingsList.size(); i++) {
bestNumPaintings[i] = numPaintingsList.get(i);
 }
 }
 }

intnumPlatforms;
if (bestNumPaintings != null) {
numPlatforms = bestNumPaintings.length;
 } else {
numPlatforms = 0;
 }
returnnewResult(numPlatforms, minHeight, bestNumPaintings);
}

publicstaticvoidmain(String[] args) {
Scannersc = newScanner(System.in);
intn = sc.nextInt();
intW = sc.nextInt();
int[] heights = newint[n];
int[] widths = newint[n];
for (inti = 0; i < n; i++) {
heights[i] = sc.nextInt();
 }
for (inti = 0; i < n; i++) {
widths[i] = sc.nextInt();
 }
sc.close();
Resultresult = program3(n, W, heights, widths);
System.out.println(result.numPlatforms());
System.out.println(result.totalHeight());
for (inti = 0; i < result.numPaintings().length; i++) {
System.out.println(result.numPaintings()[i]);
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
importjava.util.ArrayList;
importjava.util.List;
importjava.util.Scanner;

classProgram3 {
publicrecordResult(intnumPlatforms, inttotalHeight, int[] numPaintings) {}

/**
 * Solution to program 3
 *
 * @param n number of paintings
 * @param w width of the platform
 * @param heights array of heights of the paintings
 * @param widths array of widths of the paintings
 * @return Result object containing the number of platforms, total height of the paintings,
 * and the number of paintings on each platform
 */
privatestaticResultprogram3(intn, intw, int[] heights, int[] widths) {
intminHeight = Integer.MAX_VALUE;
int[] bestNumPaintings = null;

// There are 2^(n-1) possible ways to partition the paintings
inttotalPartitions = (int) Math.pow(2, n - 1);

for (intpartition = 0; partition < totalPartitions; partition++) {
inttotalHeight = 0;
intstart = 0;
List<Integer> numPaintingsList = newArrayList<>();

inttotalWidth = 0;
intmaxHeight = 0;
intcurrentPartition = partition;

for (inti = 0; i < n; i++) {
// Add the current painting to the current platform
totalWidth += widths[i];
maxHeight = Math.max(maxHeight, heights[i]);

// If total width exceeds platform width, this partition is invalid
if (totalWidth > w) {
totalHeight = Integer.MAX_VALUE;
break;
 }

// If there is a break after the current painting or it's the last painting
if ((currentPartition % 2 != 0) || i == n - 1) {
totalHeight += maxHeight;
numPaintingsList.add(i - start + 1);
// Reset for the next platform
start = i + 1;
totalWidth = 0;
maxHeight = 0;
 }

// Update partition by dividing it by 2 to check the next bit in the next iteration
currentPartition /= 2;
 }

// If this partition has a lower total height, update the best partition
if (totalHeight < minHeight) {
minHeight = totalHeight;
bestNumPaintings = newint[numPaintingsList.size()];
for (inti = 0; i < numPaintingsList.size(); i++) {
bestNumPaintings[i] = numPaintingsList.get(i);
 }
 }
 }

intnumPlatforms;
if (bestNumPaintings != null) {
numPlatforms = bestNumPaintings.length;
 } else {
numPlatforms = 0;
 }
returnnewResult(numPlatforms, minHeight, bestNumPaintings);
}

publicstaticvoidmain(String[] args) {
Scannersc = newScanner(System.in);
intn = sc.nextInt();
intW = sc.nextInt();
int[] heights = newint[n];
int[] widths = newint[n];
for (inti = 0; i < n; i++) {
heights[i] = sc.nextInt();
 }
for (inti = 0; i < n; i++) {
widths[i] = sc.nextInt();
 }
sc.close();
Resultresult = program3(n, W, heights, widths);
System.out.println(result.numPlatforms());
System.out.println(result.totalHeight());
for (inti = 0; i < result.numPaintings().length; i++) {
System.out.println(result.numPaintings()[i]);
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
importjava.util.ArrayList;
importjava.util.List;
importjava.util.Scanner;

classProgram3 {
publicrecordResult(intnumPlatforms, inttotalHeight, int[] numPaintings) {}

/**
 * Solution to program 3
 *
 * @param n number of paintings
 * @param w width of the platform
 * @param heights array of heights of the paintings
 * @param widths array of widths of the paintings
 * @return Result object containing the number of platforms, total height of the paintings,
 * and the number of paintings on each platform
 */
privatestaticResultprogram3(intn, intw, int[] heights, int[] widths) {
intminHeight = Integer.MAX_VALUE;
int[] bestNumPaintings = null;

// There are 2^(n-1) possible ways to partition the paintings
inttotalPartitions = (int) Math.pow(2, n - 1);

for (intpartition = 0; partition < totalPartitions; partition++) {
inttotalHeight = 0;
intstart = 0;
List<Integer> numPaintingsList = newArrayList<>();

inttotalWidth = 0;
intmaxHeight = 0;
intcurrentPartition = partition;

for (inti = 0; i < n; i++) {
// Add the current painting to the current platform
totalWidth += widths[i];
maxHeight = Math.max(maxHeight, heights[i]);

// If total width exceeds platform width, this partition is invalid
if (totalWidth > w) {
totalHeight = Integer.MAX_VALUE;
break;
 }

// If there is a break after the current painting or it's the last painting
if ((currentPartition % 2 != 0) || i == n - 1) {
totalHeight += maxHeight;
numPaintingsList.add(i - start + 1);
// Reset for the next platform
start = i + 1;
totalWidth = 0;
maxHeight = 0;
 }

// Update partition by dividing it by 2 to check the next bit in the next iteration
currentPartition /= 2;
 }

// If this partition has a lower total height, update the best partition
if (totalHeight < minHeight) {
minHeight = totalHeight;
bestNumPaintings = newint[numPaintingsList.size()];
for (inti = 0; i < numPaintingsList.size(); i++) {
bestNumPaintings[i] = numPaintingsList.get(i);
 }
 }
 }

intnumPlatforms;
if (bestNumPaintings != null) {
numPlatforms = bestNumPaintings.length;
 } else {
numPlatforms = 0;
 }
returnnewResult(numPlatforms, minHeight, bestNumPaintings);
}

publicstaticvoidmain(String[] args) {
Scannersc = newScanner(System.in);
intn = sc.nextInt();
intW = sc.nextInt();
int[] heights = newint[n];
int[] widths = newint[n];
for (inti = 0; i < n; i++) {
heights[i] = sc.nextInt();
 }
for (inti = 0; i < n; i++) {
widths[i] = sc.nextInt();
 }
sc.close();
Resultresult = program3(n, W, heights, widths);
System.out.println(result.numPlatforms());
System.out.println(result.totalHeight());
for (inti = 0; i < result.numPaintings().length; i++) {
System.out.println(result.numPaintings()[i]);
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
importjava.util.ArrayList;
importjava.util.List;
importjava.util.Scanner;

classProgram3 {
publicrecordResult(intnumPlatforms, inttotalHeight, int[] numPaintings) {}

/**
 * Solution to program 3
 *
 * @param n number of paintings
 * @param w width of the platform
 * @param heights array of heights of the paintings
 * @param widths array of widths of the paintings
 * @return Result object containing the number of platforms, total height of the paintings,
 * and the number of paintings on each platform
 */
privatestaticResultprogram3(intn, intw, int[] heights, int[] widths) {
intminHeight = Integer.MAX_VALUE;
int[] bestNumPaintings = null;

// There are 2^(n-1) possible ways to partition the paintings
inttotalPartitions = (int) Math.pow(2, n - 1);

for (intpartition = 0; partition < totalPartitions; partition++) {
inttotalHeight = 0;
intstart = 0;
List<Integer> numPaintingsList = newArrayList<>();

inttotalWidth = 0;
intmaxHeight = 0;
intcurrentPartition = partition;

for (inti = 0; i < n; i++) {
// Add the current painting to the current platform
totalWidth += widths[i];
maxHeight = Math.max(maxHeight, heights[i]);

// If total width exceeds platform width, this partition is invalid
if (totalWidth > w) {
totalHeight = Integer.MAX_VALUE;
break;
 }

// If there is a break after the current painting or it's the last painting
if ((currentPartition % 2 != 0) || i == n - 1) {
totalHeight += maxHeight;
numPaintingsList.add(i - start + 1);
// Reset for the next platform
start = i + 1;
totalWidth = 0;
maxHeight = 0;
 }

// Update partition by dividing it by 2 to check the next bit in the next iteration
currentPartition /= 2;
 }

// If this partition has a lower total height, update the best partition
if (totalHeight < minHeight) {
minHeight = totalHeight;
bestNumPaintings = newint[numPaintingsList.size()];
for (inti = 0; i < numPaintingsList.size(); i++) {
bestNumPaintings[i] = numPaintingsList.get(i);
 }
 }
 }

intnumPlatforms;
if (bestNumPaintings != null) {
numPlatforms = bestNumPaintings.length;
 } else {
numPlatforms = 0;
 }
returnnewResult(numPlatforms, minHeight, bestNumPaintings);
}

publicstaticvoidmain(String[] args) {
Scannersc = newScanner(System.in);
intn = sc.nextInt();
intW = sc.nextInt();
int[] heights = newint[n];
int[] widths = newint[n];
for (inti = 0; i < n; i++) {
heights[i] = sc.nextInt();
 }
for (inti = 0; i < n; i++) {
widths[i] = sc.nextInt();
 }
sc.close();
Resultresult = program3(n, W, heights, widths);
System.out.println(result.numPlatforms());
System.out.println(result.totalHeight());
for (inti = 0; i < result.numPaintings().length; i++) {
System.out.println(result.numPaintings()[i]);
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
importjava.util.ArrayList;
importjava.util.List;
importjava.util.Scanner;

classProgram3 {
publicrecordResult(intnumPlatforms, inttotalHeight, int[] numPaintings) {}

/**
 * Solution to program 3
 *
 * @param n number of paintings
 * @param w width of the platform
 * @param heights array of heights of the paintings
 * @param widths array of widths of the paintings
 * @return Result object containing the number of platforms, total height of the paintings,
 * and the number of paintings on each platform
 */
privatestaticResultprogram3(intn, intw, int[] heights, int[] widths) {
intminHeight = Integer.MAX_VALUE;
int[] bestNumPaintings = null;

// There are 2^(n-1) possible ways to partition the paintings
inttotalPartitions = (int) Math.pow(2, n - 1);

for (intpartition = 0; partition < totalPartitions; partition++) {
inttotalHeight = 0;
intstart = 0;
List<Integer> numPaintingsList = newArrayList<>();

inttotalWidth = 0;
intmaxHeight = 0;
intcurrentPartition = partition;

for (inti = 0; i < n; i++) {
// Add the current painting to the current platform
totalWidth += widths[i];
maxHeight = Math.max(maxHeight, heights[i]);

// If total width exceeds platform width, this partition is invalid
if (totalWidth > w) {
totalHeight = Integer.MAX_VALUE;
break;
 }

// If there is a break after the current painting or it's the last painting
if ((currentPartition % 2 != 0) || i == n - 1) {
totalHeight += maxHeight;
numPaintingsList.add(i - start + 1);
// Reset for the next platform
start = i + 1;
totalWidth = 0;
maxHeight = 0;
 }

// Update partition by dividing it by 2 to check the next bit in the next iteration
currentPartition /= 2;
 }

// If this partition has a lower total height, update the best partition
if (totalHeight < minHeight) {
minHeight = totalHeight;
bestNumPaintings = newint[numPaintingsList.size()];
for (inti = 0; i < numPaintingsList.size(); i++) {
bestNumPaintings[i] = numPaintingsList.get(i);
 }
 }
 }

intnumPlatforms;
if (bestNumPaintings != null) {
numPlatforms = bestNumPaintings.length;
 } else {
numPlatforms = 0;
 }
returnnewResult(numPlatforms, minHeight, bestNumPaintings);
}

publicstaticvoidmain(String[] args) {
Scannersc = newScanner(System.in);
intn = sc.nextInt();
intW = sc.nextInt();
int[] heights = newint[n];
int[] widths = newint[n];
for (inti = 0; i < n; i++) {
heights[i] = sc.nextInt();
 }
for (inti = 0; i < n; i++) {
widths[i] = sc.nextInt();
 }
sc.close();
Resultresult = program3(n, W, heights, widths);
System.out.println(result.numPlatforms());
System.out.println(result.totalHeight());
for (inti = 0; i < result.numPaintings().length; i++) {
System.out.println(result.numPaintings()[i]);
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
importjava.util.ArrayList;
importjava.util.List;
importjava.util.Scanner;

classProgram3 {
publicrecordResult(intnumPlatforms, inttotalHeight, int[] numPaintings) {}

/**
 * Solution to program 3
 *
 * @param n number of paintings
 * @param w width of the platform
 * @param heights array of heights of the paintings
 * @param widths array of widths of the paintings
 * @return Result object containing the number of platforms, total height of the paintings,
 * and the number of paintings on each platform
 */
privatestaticResultprogram3(intn, intw, int[] heights, int[] widths) {
intminHeight = Integer.MAX_VALUE;
int[] bestNumPaintings = null;

// There are 2^(n-1) possible ways to partition the paintings
inttotalPartitions = (int) Math.pow(2, n - 1);

for (intpartition = 0; partition < totalPartitions; partition++) {
inttotalHeight = 0;
intstart = 0;
List<Integer> numPaintingsList = newArrayList<>();

inttotalWidth = 0;
intmaxHeight = 0;
intcurrentPartition = partition;

for (inti = 0; i < n; i++) {
// Add the current painting to the current platform
totalWidth += widths[i];
maxHeight = Math.max(maxHeight, heights[i]);

// If total width exceeds platform width, this partition is invalid
if (totalWidth > w) {
totalHeight = Integer.MAX_VALUE;
break;
 }

// If there is a break after the current painting or it's the last painting
if ((currentPartition % 2 != 0) || i == n - 1) {
totalHeight += maxHeight;
numPaintingsList.add(i - start + 1);
// Reset for the next platform
start = i + 1;
totalWidth = 0;
maxHeight = 0;
 }

// Update partition by dividing it by 2 to check the next bit in the next iteration
currentPartition /= 2;
 }

// If this partition has a lower total height, update the best partition
if (totalHeight < minHeight) {
minHeight = totalHeight;
bestNumPaintings = newint[numPaintingsList.size()];
for (inti = 0; i < numPaintingsList.size(); i++) {
bestNumPaintings[i] = numPaintingsList.get(i);
 }
 }
 }

intnumPlatforms;
if (bestNumPaintings != null) {
numPlatforms = bestNumPaintings.length;
 } else {
numPlatforms = 0;
 }
returnnewResult(numPlatforms, minHeight, bestNumPaintings);
}

publicstaticvoidmain(String[] args) {
Scannersc = newScanner(System.in);
intn = sc.nextInt();
intW = sc.nextInt();
int[] heights = newint[n];
int[] widths = newint[n];
for (inti = 0; i < n; i++) {
heights[i] = sc.nextInt();
 }
for (inti = 0; i < n; i++) {
widths[i] = sc.nextInt();
 }
sc.close();
Resultresult = program3(n, W, heights, widths);
System.out.println(result.numPlatforms());
System.out.println(result.totalHeight());
for (inti = 0; i < result.numPaintings().length; i++) {
System.out.println(result.numPaintings()[i]);
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
importjava.util.ArrayList;
importjava.util.List;
importjava.util.Scanner;

classProgram3 {
publicrecordResult(intnumPlatforms, inttotalHeight, int[] numPaintings) {}

/**
 * Solution to program 3
 *
 * @param n number of paintings
 * @param w width of the platform
 * @param heights array of heights of the paintings
 * @param widths array of widths of the paintings
 * @return Result object containing the number of platforms, total height of the paintings,
 * and the number of paintings on each platform
 */
privatestaticResultprogram3(intn, intw, int[] heights, int[] widths) {
intminHeight = Integer.MAX_VALUE;
int[] bestNumPaintings = null;

// There are 2^(n-1) possible ways to partition the paintings
inttotalPartitions = (int) Math.pow(2, n - 1);

for (intpartition = 0; partition < totalPartitions; partition++) {
inttotalHeight = 0;
intstart = 0;
List<Integer> numPaintingsList = newArrayList<>();

inttotalWidth = 0;
intmaxHeight = 0;
intcurrentPartition = partition;

for (inti = 0; i < n; i++) {
// Add the current painting to the current platform
totalWidth += widths[i];
maxHeight = Math.max(maxHeight, heights[i]);

// If total width exceeds platform width, this partition is invalid
if (totalWidth > w) {
totalHeight = Integer.MAX_VALUE;
break;
 }

// If there is a break after the current painting or it's the last painting
if ((currentPartition % 2 != 0) || i == n - 1) {
totalHeight += maxHeight;
numPaintingsList.add(i - start + 1);
// Reset for the next platform
start = i + 1;
totalWidth = 0;
maxHeight = 0;
 }

// Update partition by dividing it by 2 to check the next bit in the next iteration
currentPartition /= 2;
 }

// If this partition has a lower total height, update the best partition
if (totalHeight < minHeight) {
minHeight = totalHeight;
bestNumPaintings = newint[numPaintingsList.size()];
for (inti = 0; i < numPaintingsList.size(); i++) {
bestNumPaintings[i] = numPaintingsList.get(i);
 }
 }
 }

intnumPlatforms;
if (bestNumPaintings != null) {
numPlatforms = bestNumPaintings.length;
 } else {
numPlatforms = 0;
 }
returnnewResult(numPlatforms, minHeight, bestNumPaintings);
}

publicstaticvoidmain(String[] args) {
Scannersc = newScanner(System.in);
intn = sc.nextInt();
intW = sc.nextInt();
int[] heights = newint[n];
int[] widths = newint[n];
for (inti = 0; i < n; i++) {
heights[i] = sc.nextInt();
 }
for (inti = 0; i < n; i++) {
widths[i] = sc.nextInt();
 }
sc.close();
Resultresult = program3(n, W, heights, widths);
System.out.println(result.numPlatforms());
System.out.println(result.totalHeight());
for (inti = 0; i < result.numPaintings().length; i++) {
System.out.println(result.numPaintings()[i]);
 }
 }
}