-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathBeautifulDaysAtTheMovies.cpp
More file actions
83 lines (59 loc) · 1.82 KB
/
BeautifulDaysAtTheMovies.cpp
File metadata and controls
83 lines (59 loc) · 1.82 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
#include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Complete the designerPdfViewer function below.
int designerPdfViewer(vector<int> h, string word) {
int l = word.length() ;
int code = 0 ;
int temp[l] ;
for ( int i = 0 ; i < l ; i++ )
temp [i] = int ( word[i] ) - 97 ;
for ( int i = 0 ; i < l ; i++ )
for ( int j = 0 ; j < 26 ; j++ )
if ( temp [i] == j )
temp[i] = h[j] ;
int large = temp[0] ;
for ( int i = 0 ; i < l ; i++ )
if ( temp[i] > large )
large = temp[i] ;
int area = large * 1 * l ;
return area ;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string h_temp_temp;
getline(cin, h_temp_temp);
vector<string> h_temp = split_string(h_temp_temp);
vector<int> h(26);
for (int i = 0; i < 26; i++) {
int h_item = stoi(h_temp[i]);
h[i] = h_item;
}
string word;
getline(cin, word);
int result = designerPdfViewer(h, word);
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;
}