-
Notifications
You must be signed in to change notification settings - Fork 111
/
solution.cpp
100 lines (72 loc) · 2.43 KB
/
solution.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
95
96
97
98
99
#include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Implemented Part
vector<int> breakingRecords(vector<int> scores) {
// Initialize highestScore and lowestScore to first value of scores
// number of times she breaks her record i.e initialize 0 to countLow and countHigh
int high = scores[0], low = scores[0], countHigh = 0, countLow = 0;
vector<int> result;
for(int i = 1; i < scores.size(); i++){
// compare current score with lowest score
// if condition satisfies then do changes as given
if(scores[i] < low){
countLow++;
low = scores[i];
}else if(scores[i] > high){
// compare current score with highest score
// if above condition satisfies then update the values
countHigh++;
high = scores[i];
}
}
// then push countHigh and countLow in returning vector i.e result
result.push_back(countHigh);
result.push_back(countLow);
return result;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
int n;
cin >> n;
cin.ignore(numeric_limits<streamsize>::max(), '\n');
string scores_temp_temp;
getline(cin, scores_temp_temp);
vector<string> scores_temp = split_string(scores_temp_temp);
vector<int> scores(n);
for (int i = 0; i < n; i++) {
int scores_item = stoi(scores_temp[i]);
scores[i] = scores_item;
}
vector<int> result = breakingRecords(scores);
for (int i = 0; i < result.size(); i++) {
fout << result[i];
if (i != result.size() - 1) {
fout << " ";
}
}
fout << "\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;
}