-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathOrganizingContainersOfBalls.java
More file actions
84 lines (64 loc) · 2.43 KB
/
OrganizingContainersOfBalls.java
File metadata and controls
84 lines (64 loc) · 2.43 KB
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
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class OrganizingContainersOfBalls {
// https://www.hackerrank.com/challenges/organizing-containers-of-balls/problem
// Complete the organizingContainers function below.
static String organizingContainers(int[][] container) {
Long[] ballCounts = new Long[container.length];
Long[] contCounts = new Long[container.length];
Long sum = 0L;
Long contSum = 0L;
int start = 0;
while(start<container[0].length) {
sum = 0L;
for (int[] i : container) {
sum+=i[start];
}
ballCounts[start] = sum;
start++;
}
for (int i = 0 ; i<container.length ; i++) {
contSum = 0L;
for(int a = 0 ; a<container[i].length ; a++) {
contSum+=container[i][a];
}
contCounts[i]= contSum;
}
Arrays.sort(contCounts);
Arrays.sort(ballCounts);
for(int x = 0 ; x<contCounts.length ; x++) {
if(contCounts[x]<ballCounts[x])
return "Impossible";
}
return "Possible";
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int q = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int qItr = 0; qItr < q; qItr++) {
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[][] container = new int[n][n];
for (int i = 0; i < n; i++) {
String[] containerRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int j = 0; j < n; j++) {
int containerItem = Integer.parseInt(containerRowItems[j]);
container[i][j] = containerItem;
}
}
String result = organizingContainers(container);
bufferedWriter.write(result);
bufferedWriter.newLine();
}
bufferedWriter.close();
scanner.close();
}
}