SebastianStork/advent-of-code
1
0
Fork 0
mirror of https://github.com/SebastianStork/advent-of-code.git synced 2026-01-21 19:11:34 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

Move c++ solutions into separate directory

Browse source
This commit is contained in:
SebastianStork 2025-01-06 17:12:41 +01:00
parent 3c40f13cfc
commit 4adbe68617
28 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

59
2024/day-01/main.cpp
View file

@ -1,59 +0,0 @@
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void readInput(vector<int> &list1, vector<int> &list2)
{
int value1, value2;
while (cin >> value1 >> value2) {
list1.push_back(value1);
list2.push_back(value2);
}
}
void sortLists(vector<int> &list1, vector<int> &list2)
{
sort(list1.begin(), list1.end());
sort(list2.begin(), list2.end());
}
int calculateTotalDistance(const vector<int> &list1, const vector<int> &list2)
{
int totalDistance = 0;
for (size_t i = 0; i < list1.size(); i++) {
totalDistance += abs(list1[i] - list2[i]);
}
return totalDistance;
}
int calculateSimilarityScore(const vector<int> &list1, const vector<int> &list2)
{
int similarityScore = 0;
size_t index2 = 0;
for (size_t index1 = 0; index1 < list1.size(); index1++) {
while ((index2 < list2.size()) && (list1[index1] > list2[index2])) {
index2++;
}
while ((index2 < list2.size()) && (list1[index1] == list2[index2])) {
similarityScore += list2[index2];
index2++;
}
}
return similarityScore;
}
int main()
{
vector<int> list1, list2;
readInput(list1, list2);
sortLists(list1, list2);
// Part one
cout << "Total distance between the lists: " << calculateTotalDistance(list1, list2) << endl;
// Part two
cout << "Similarity Score: " << calculateSimilarityScore(list1, list2) << endl;
}