-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
108 lines (92 loc) · 2.11 KB
/
main.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
/************************************************************************/
/* Advent of Code:
/* Day 5: Doesn't He Have Intern-Elves For This?
/************************************************************************/
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <chrono>
uint32_t isNice(std::string line)
{
std::vector<std::string> naughtyList = { "ab", "cd", "pq", "xy" };
std::string vovels = "aeiou";
int nVovels = 0;
int nSeries = 0;
int nNaughty = 0;
for (auto& v : vovels)
{
for (size_t i = 0; i < line.size(); i++)
{
if (line[i] == v)
nVovels++;
}
}
for (size_t i = 0; i < line.size() - 1; i++)
{
if (line[i] == line[i + 1])
nSeries++;
}
for (auto& n : naughtyList)
{
if (line.find(n) != std::string::npos)
nNaughty++;
}
if (nNaughty)
return false;
return static_cast<uint32_t>((nVovels >= 3) && nSeries);
}
uint32_t isNicer(std::string line)
{
bool foundPair = false;
bool foundSpace = false;
for (size_t i = 0; i < line.size() - 2; i++)
{
std::string toFind = line.substr(i, 2);
std::string toCheck = line.substr(i + 2, line.size() - 2 - i);
if (toCheck.find(toFind) != std::string::npos)
{
foundPair = true;
break;
}
}
for (size_t i = 0; i < line.size() - 2; i++)
{
if (line[i] == line[i + 2])
{
foundSpace = true;
break;
}
}
return static_cast<uint32_t>(foundPair && foundSpace);
}
uint32_t partOne()
{
std::ifstream infile("data_d05.txt");
std::string input;
uint32_t nice = 0;
while (infile >> input)
{
nice += isNice(input);
}
return nice;
}
uint32_t partTwo()
{
std::ifstream infile("data_d05.txt");
std::string input;
uint32_t nice = 0;
while (infile >> input)
{
nice += isNicer(input);
}
return nice;
}
int main()
{
std::chrono::high_resolution_clock::time_point t1 = std::chrono::high_resolution_clock::now();
std::cout << partOne() << std::endl;
std::cout << partTwo() << std::endl;
std::chrono::duration<double> time_span = std::chrono::duration_cast<std::chrono::duration<double>>(std::chrono::high_resolution_clock::now() - t1);
std::cout << "Time: " << time_span.count() << "s.";
}