AlgorithmsAndAbstractDesign/Program1.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
importjava.util.Scanner;
importjava.util.ArrayList;
importjava.util.List;

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

/**
 * Solution to program 1
 *
 * @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
 */
staticResultprogram1(intn, intW, int[] heights, int[] widths) {
inttotalHeight = 0;
intnumPlatforms = 0;
List<Integer> paintingsPerPlatform = newArrayList<>();
intcurrWidth = 0;
intstartIndex = 0;
intcounter = 0;

for (inti = 0; i < n; i++) {
if (currWidth + widths[i] <= W) {
// Add painting to current platform
currWidth += widths[i];
counter++;
 } else {
// Finish current platform
numPlatforms++;
totalHeight += heights[startIndex]; // Tallest painting is the first one
paintingsPerPlatform.add(counter);

// Start new platform
currWidth = widths[i];
startIndex = i;
counter = 1;
 }
 }
// Handle the last platform
numPlatforms++;
totalHeight += heights[startIndex];
paintingsPerPlatform.add(counter);

// Convert paintingsPerPlatform to int array
int[] numPaintings = newint[paintingsPerPlatform.size()];
for (inti = 0; i < numPaintings.length; i++) {
numPaintings[i] = paintingsPerPlatform.get(i);
 }

returnnewResult(numPlatforms, totalHeight, numPaintings);
 }
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 = program1(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
importjava.util.Scanner;
importjava.util.ArrayList;
importjava.util.List;

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

/**
 * Solution to program 1
 *
 * @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
 */
staticResultprogram1(intn, intW, int[] heights, int[] widths) {
inttotalHeight = 0;
intnumPlatforms = 0;
List<Integer> paintingsPerPlatform = newArrayList<>();
intcurrWidth = 0;
intstartIndex = 0;
intcounter = 0;

for (inti = 0; i < n; i++) {
if (currWidth + widths[i] <= W) {
// Add painting to current platform
currWidth += widths[i];
counter++;
 } else {
// Finish current platform
numPlatforms++;
totalHeight += heights[startIndex]; // Tallest painting is the first one
paintingsPerPlatform.add(counter);

// Start new platform
currWidth = widths[i];
startIndex = i;
counter = 1;
 }
 }
// Handle the last platform
numPlatforms++;
totalHeight += heights[startIndex];
paintingsPerPlatform.add(counter);

// Convert paintingsPerPlatform to int array
int[] numPaintings = newint[paintingsPerPlatform.size()];
for (inti = 0; i < numPaintings.length; i++) {
numPaintings[i] = paintingsPerPlatform.get(i);
 }

returnnewResult(numPlatforms, totalHeight, numPaintings);
 }
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 = program1(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
importjava.util.Scanner;
importjava.util.ArrayList;
importjava.util.List;

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

/**
 * Solution to program 1
 *
 * @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
 */
staticResultprogram1(intn, intW, int[] heights, int[] widths) {
inttotalHeight = 0;
intnumPlatforms = 0;
List<Integer> paintingsPerPlatform = newArrayList<>();
intcurrWidth = 0;
intstartIndex = 0;
intcounter = 0;

for (inti = 0; i < n; i++) {
if (currWidth + widths[i] <= W) {
// Add painting to current platform
currWidth += widths[i];
counter++;
 } else {
// Finish current platform
numPlatforms++;
totalHeight += heights[startIndex]; // Tallest painting is the first one
paintingsPerPlatform.add(counter);

// Start new platform
currWidth = widths[i];
startIndex = i;
counter = 1;
 }
 }
// Handle the last platform
numPlatforms++;
totalHeight += heights[startIndex];
paintingsPerPlatform.add(counter);

// Convert paintingsPerPlatform to int array
int[] numPaintings = newint[paintingsPerPlatform.size()];
for (inti = 0; i < numPaintings.length; i++) {
numPaintings[i] = paintingsPerPlatform.get(i);
 }

returnnewResult(numPlatforms, totalHeight, numPaintings);
 }
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 = program1(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
importjava.util.Scanner;
importjava.util.ArrayList;
importjava.util.List;

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

/**
 * Solution to program 1
 *
 * @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
 */
staticResultprogram1(intn, intW, int[] heights, int[] widths) {
inttotalHeight = 0;
intnumPlatforms = 0;
List<Integer> paintingsPerPlatform = newArrayList<>();
intcurrWidth = 0;
intstartIndex = 0;
intcounter = 0;

for (inti = 0; i < n; i++) {
if (currWidth + widths[i] <= W) {
// Add painting to current platform
currWidth += widths[i];
counter++;
 } else {
// Finish current platform
numPlatforms++;
totalHeight += heights[startIndex]; // Tallest painting is the first one
paintingsPerPlatform.add(counter);

// Start new platform
currWidth = widths[i];
startIndex = i;
counter = 1;
 }
 }
// Handle the last platform
numPlatforms++;
totalHeight += heights[startIndex];
paintingsPerPlatform.add(counter);

// Convert paintingsPerPlatform to int array
int[] numPaintings = newint[paintingsPerPlatform.size()];
for (inti = 0; i < numPaintings.length; i++) {
numPaintings[i] = paintingsPerPlatform.get(i);
 }

returnnewResult(numPlatforms, totalHeight, numPaintings);
 }
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 = program1(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
importjava.util.Scanner;
importjava.util.ArrayList;
importjava.util.List;

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

/**
 * Solution to program 1
 *
 * @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
 */
staticResultprogram1(intn, intW, int[] heights, int[] widths) {
inttotalHeight = 0;
intnumPlatforms = 0;
List<Integer> paintingsPerPlatform = newArrayList<>();
intcurrWidth = 0;
intstartIndex = 0;
intcounter = 0;

for (inti = 0; i < n; i++) {
if (currWidth + widths[i] <= W) {
// Add painting to current platform
currWidth += widths[i];
counter++;
 } else {
// Finish current platform
numPlatforms++;
totalHeight += heights[startIndex]; // Tallest painting is the first one
paintingsPerPlatform.add(counter);

// Start new platform
currWidth = widths[i];
startIndex = i;
counter = 1;
 }
 }
// Handle the last platform
numPlatforms++;
totalHeight += heights[startIndex];
paintingsPerPlatform.add(counter);

// Convert paintingsPerPlatform to int array
int[] numPaintings = newint[paintingsPerPlatform.size()];
for (inti = 0; i < numPaintings.length; i++) {
numPaintings[i] = paintingsPerPlatform.get(i);
 }

returnnewResult(numPlatforms, totalHeight, numPaintings);
 }
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 = program1(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
importjava.util.Scanner;
importjava.util.ArrayList;
importjava.util.List;

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

/**
 * Solution to program 1
 *
 * @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
 */
staticResultprogram1(intn, intW, int[] heights, int[] widths) {
inttotalHeight = 0;
intnumPlatforms = 0;
List<Integer> paintingsPerPlatform = newArrayList<>();
intcurrWidth = 0;
intstartIndex = 0;
intcounter = 0;

for (inti = 0; i < n; i++) {
if (currWidth + widths[i] <= W) {
// Add painting to current platform
currWidth += widths[i];
counter++;
 } else {
// Finish current platform
numPlatforms++;
totalHeight += heights[startIndex]; // Tallest painting is the first one
paintingsPerPlatform.add(counter);

// Start new platform
currWidth = widths[i];
startIndex = i;
counter = 1;
 }
 }
// Handle the last platform
numPlatforms++;
totalHeight += heights[startIndex];
paintingsPerPlatform.add(counter);

// Convert paintingsPerPlatform to int array
int[] numPaintings = newint[paintingsPerPlatform.size()];
for (inti = 0; i < numPaintings.length; i++) {
numPaintings[i] = paintingsPerPlatform.get(i);
 }

returnnewResult(numPlatforms, totalHeight, numPaintings);
 }
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 = program1(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
importjava.util.Scanner;
importjava.util.ArrayList;
importjava.util.List;

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

/**
 * Solution to program 1
 *
 * @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
 */
staticResultprogram1(intn, intW, int[] heights, int[] widths) {
inttotalHeight = 0;
intnumPlatforms = 0;
List<Integer> paintingsPerPlatform = newArrayList<>();
intcurrWidth = 0;
intstartIndex = 0;
intcounter = 0;

for (inti = 0; i < n; i++) {
if (currWidth + widths[i] <= W) {
// Add painting to current platform
currWidth += widths[i];
counter++;
 } else {
// Finish current platform
numPlatforms++;
totalHeight += heights[startIndex]; // Tallest painting is the first one
paintingsPerPlatform.add(counter);

// Start new platform
currWidth = widths[i];
startIndex = i;
counter = 1;
 }
 }
// Handle the last platform
numPlatforms++;
totalHeight += heights[startIndex];
paintingsPerPlatform.add(counter);

// Convert paintingsPerPlatform to int array
int[] numPaintings = newint[paintingsPerPlatform.size()];
for (inti = 0; i < numPaintings.length; i++) {
numPaintings[i] = paintingsPerPlatform.get(i);
 }

returnnewResult(numPlatforms, totalHeight, numPaintings);
 }
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 = program1(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
importjava.util.Scanner;
importjava.util.ArrayList;
importjava.util.List;

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

/**
 * Solution to program 1
 *
 * @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
 */
staticResultprogram1(intn, intW, int[] heights, int[] widths) {
inttotalHeight = 0;
intnumPlatforms = 0;
List<Integer> paintingsPerPlatform = newArrayList<>();
intcurrWidth = 0;
intstartIndex = 0;
intcounter = 0;

for (inti = 0; i < n; i++) {
if (currWidth + widths[i] <= W) {
// Add painting to current platform
currWidth += widths[i];
counter++;
 } else {
// Finish current platform
numPlatforms++;
totalHeight += heights[startIndex]; // Tallest painting is the first one
paintingsPerPlatform.add(counter);

// Start new platform
currWidth = widths[i];
startIndex = i;
counter = 1;
 }
 }
// Handle the last platform
numPlatforms++;
totalHeight += heights[startIndex];
paintingsPerPlatform.add(counter);

// Convert paintingsPerPlatform to int array
int[] numPaintings = newint[paintingsPerPlatform.size()];
for (inti = 0; i < numPaintings.length; i++) {
numPaintings[i] = paintingsPerPlatform.get(i);
 }

returnnewResult(numPlatforms, totalHeight, numPaintings);
 }
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 = program1(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]);
 }
 }

}