forked from ansh-ptel/HackerRank-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcutting_boards.cpp
94 lines (60 loc) · 2.03 KB
/
cutting_boards.cpp
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
#include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Complete the boardCutting function below.
int boardCutting(vector<int> cost_y, vector<int> cost_x) {
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
int q;
cin >> q;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
for (int q_itr = 0; q_itr < q; q_itr++) {
string mn_temp;
getline(cin, mn_temp);
vector<string> mn = split_string(mn_temp);
int m = stoi(mn[0]);
int n = stoi(mn[1]);
string cost_y_temp_temp;
getline(cin, cost_y_temp_temp);
vector<string> cost_y_temp = split_string(cost_y_temp_temp);
vector<int> cost_y(m-1);
for (int i = 0; i < m-1; i++) {
int cost_y_item = stoi(cost_y_temp[i]);
cost_y[i] = cost_y_item;
}
string cost_x_temp_temp;
getline(cin, cost_x_temp_temp);
vector<string> cost_x_temp = split_string(cost_x_temp_temp);
vector<int> cost_x(n-1);
for (int i = 0; i < n-1; i++) {
int cost_x_item = stoi(cost_x_temp[i]);
cost_x[i] = cost_x_item;
}
int result = boardCutting(cost_y, cost_x);
fout << result << "\n";
}
fout.close();
return 0;
}
vector<string> split_string(string input_string) {
string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
return x == y and x == ' ';
});
input_string.erase(new_end, input_string.end());
while (input_string[input_string.length() - 1] == ' ') {
input_string.pop_back();
}
vector<string> splits;
char delimiter = ' ';
size_t i = 0;
size_t pos = input_string.find(delimiter);
while (pos != string::npos) {
splits.push_back(input_string.substr(i, pos - i));
i = pos + 1;
pos = input_string.find(delimiter, i);
}
splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
return splits;
}