-
Notifications
You must be signed in to change notification settings - Fork 0
/
CompareTheTriplets.cpp
110 lines (76 loc) · 2.05 KB
/
CompareTheTriplets.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
100
101
102
103
104
105
106
107
108
109
#include <bits/stdc++.h>
using namespace std;
vector <string> split_string(string);
/*
* Complete the solve function below.
*/
vector<int> solve(int a0, int a1, int a2, int b0, int b1, int b2)
{
auto alicePoints = 0;
auto bobPoints = 0;
if (a0 > b0)
++alicePoints;
if (a0 < b0)
++bobPoints;
if (a1 > b1)
++alicePoints;
if (a1 < b1)
++bobPoints;
if (a2 > b2)
++alicePoints;
if (a2 < b2)
++bobPoints;
return {alicePoints, bobPoints};
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string a0A1A2_temp;
getline(cin, a0A1A2_temp);
vector <string> a0A1A2 = split_string(a0A1A2_temp);
int a0 = stoi(a0A1A2[0]);
int a1 = stoi(a0A1A2[1]);
int a2 = stoi(a0A1A2[2]);
string b0B1B2_temp;
getline(cin, b0B1B2_temp);
vector <string> b0B1B2 = split_string(b0B1B2_temp);
int b0 = stoi(b0B1B2[0]);
int b1 = stoi(b0B1B2[1]);
int b2 = stoi(b0B1B2[2]);
vector<int> result = solve(a0, a1, a2, b0, b1, b2);
for (int result_itr = 0; result_itr < result.size(); result_itr++)
{
fout << result[result_itr];
if (result_itr != 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;
}