-
Notifications
You must be signed in to change notification settings - Fork 178
/
Copy pathstub.cc
108 lines (72 loc) · 2.16 KB
/
stub.cc
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
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
/*
* Complete the 'getMaxArea' function below.
*
* The function is expected to return a LONG_INTEGER_ARRAY.
* The function accepts following parameters:
* 1. INTEGER w
* 2. INTEGER h
* 3. BOOLEAN_ARRAY isVertical
* 4. INTEGER_ARRAY distance
*/
vector<long> getMaxArea(int w, int h, vector<bool> isVertical, vector<int> distance) {
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string w_temp;
getline(cin, w_temp);
int w = stoi(ltrim(rtrim(w_temp)));
string h_temp;
getline(cin, h_temp);
int h = stoi(ltrim(rtrim(h_temp)));
string isVertical_count_temp;
getline(cin, isVertical_count_temp);
int isVertical_count = stoi(ltrim(rtrim(isVertical_count_temp)));
vector<bool> isVertical(isVertical_count);
for (int i = 0; i < isVertical_count; i++) {
string isVertical_item_temp;
getline(cin, isVertical_item_temp);
bool isVertical_item = stoi(ltrim(rtrim(isVertical_item_temp))) != 0;
isVertical[i] = isVertical_item;
}
string distance_count_temp;
getline(cin, distance_count_temp);
int distance_count = stoi(ltrim(rtrim(distance_count_temp)));
vector<int> distance(distance_count);
for (int i = 0; i < distance_count; i++) {
string distance_item_temp;
getline(cin, distance_item_temp);
int distance_item = stoi(ltrim(rtrim(distance_item_temp)));
distance[i] = distance_item;
}
vector<long> result = getMaxArea(w, h, isVertical, distance);
for (int i = 0; i < result.size(); i++) {
fout << result[i];
if (i != result.size() - 1) {
fout << "\n";
}
}
fout << "\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;
}