-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathOrganizingContainersOfBalls.c
119 lines (85 loc) · 2.42 KB
/
OrganizingContainersOfBalls.c
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
/*
* Complete the 'organizingContainers' function below.
*
* The function is expected to return a STRING.
* The function accepts 2D_INTEGER_ARRAY container as parameter.
*/
string organizingContainers(vector<vector<int>> container) {
int n = container.size();
vector<long long> rowSum(n, 0), colSum(n, 0);
// Calculate row sums and column sums
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
rowSum[i] += container[i][j];
colSum[j] += container[i][j];
}
}
// Sort both sums
sort(rowSum.begin(), rowSum.end());
sort(colSum.begin(), colSum.end());
// Compare if they are equal
if (rowSum == colSum) {
return "Possible";
} else {
return "Impossible";
}
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string q_temp;
getline(cin, q_temp);
int q = stoi(ltrim(rtrim(q_temp)));
for (int q_itr = 0; q_itr < q; q_itr++) {
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
vector<vector<int>> container(n);
for (int i = 0; i < n; i++) {
container[i].resize(n);
string container_row_temp_temp;
getline(cin, container_row_temp_temp);
vector<string> container_row_temp = split(rtrim(container_row_temp_temp));
for (int j = 0; j < n; j++) {
int container_row_item = stoi(container_row_temp[j]);
container[i][j] = container_row_item;
}
}
string result = organizingContainers(container);
fout << result << "\n";
}
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
vector<string> split(const string &str) {
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos) {
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}