-
Notifications
You must be signed in to change notification settings - Fork 0
/
part2.cpp
68 lines (55 loc) · 1.19 KB
/
part2.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
#include <bits/stdc++.h>
using namespace std;
size_t getPriority(char c)
{
if (c >= 'a' && c <= 'z')
return (c - 'a' + 1);
else
return (c - 'A' + 27);
}
size_t getBadgePriority(vector<string> group)
{
vector<set<char>> sets;
for (auto& rucksack : group)
{
set<char> s;
for (auto& c : rucksack)
s.insert(c);
sets.push_back(s);
}
for (auto& c : sets[0])
{
if (sets[1].find(c) != sets[1].end() && sets[2].find(c) != sets[2].end())
return getPriority(c);
}
return 0;
}
void solve(vector<vector<string>> rucksacks)
{
size_t res = 0;
for (auto& group : rucksacks)
res += getBadgePriority(group);
cout << res << '\n';
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string line;
vector<vector<string>> rucksacks;
vector<string> rucksack;
size_t group = 0;
while (getline(cin, line))
{
rucksack.push_back(line);
group++;
if (group % 3 == 0)
{
group = 0;
rucksacks.push_back(rucksack);
rucksack.clear();
}
}
solve(rucksacks);
return 0;
}