You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
250 lines
5.4 KiB
250 lines
5.4 KiB
#pragma region Hidden Setup Stuff
|
|
#define OLC_PGE_APPLICATION
|
|
#include "olcPixelGameEngine.h"
|
|
|
|
using namespace olc;
|
|
|
|
enum Run{
|
|
FILE1,
|
|
FILE2
|
|
};
|
|
|
|
// Override base class with your custom functionality
|
|
class AoC2023 : public olc::PixelGameEngine
|
|
{
|
|
std::vector<std::string>lines;
|
|
bool waitForRender=false;
|
|
|
|
void wait(int pauseMs=0){
|
|
waitForRender=true;
|
|
while(waitForRender);
|
|
std::this_thread::sleep_for(std::chrono::milliseconds(pauseMs));
|
|
}
|
|
|
|
#pragma endregion
|
|
|
|
const int DAY = 9;
|
|
Run runInput=FILE2;
|
|
|
|
void doStuff2(){
|
|
while(true){ //lines is accessible as a global.
|
|
std::vector<std::vector<int>>numbers;
|
|
int increasingNumb=0;
|
|
int prevNumb=0;
|
|
bool increasingAllSame=true;
|
|
bool increasingNumberSet=false;
|
|
long long sum=0;
|
|
for(std::string&line:lines){
|
|
numbers.clear();
|
|
numbers.push_back({});
|
|
while(line.length()>0){
|
|
size_t spacePos=line.find(' ');
|
|
int numb;
|
|
if(spacePos==std::string::npos){
|
|
numb=std::stoi(line);
|
|
line="";
|
|
}else{
|
|
numb=std::stoi(line.substr(0,spacePos));
|
|
line=line.substr(spacePos+1);
|
|
}
|
|
numbers.back().push_back(numb);
|
|
if(numbers.back().size()>=2){
|
|
if(!increasingNumberSet){
|
|
increasingNumberSet=true;
|
|
}else{
|
|
if(increasingAllSame){
|
|
if(numb-prevNumb!=increasingNumb){
|
|
increasingAllSame=false;
|
|
}
|
|
}
|
|
}
|
|
increasingNumb=numb-prevNumb;
|
|
}
|
|
prevNumb=numb;
|
|
}
|
|
while(true){
|
|
if(increasingAllSame){
|
|
bool previousNumberSet=false;
|
|
if(numbers.size()==1){
|
|
sum+=numbers.back().front()-increasingNumb;
|
|
}else{
|
|
for(int i=numbers.size()-1;i>=0;i--){
|
|
std::vector<int>&numList=numbers[i];
|
|
if(!previousNumberSet){
|
|
previousNumberSet=true;
|
|
prevNumb=numList.front();
|
|
}else{
|
|
prevNumb=numList.front()-prevNumb;
|
|
}
|
|
}
|
|
sum+=prevNumb;
|
|
}
|
|
std::cout<<sum<<std::endl;
|
|
break;
|
|
}else{
|
|
numbers.push_back({});
|
|
increasingNumb=0;
|
|
prevNumb=0;
|
|
increasingAllSame=true;
|
|
increasingNumberSet=false;
|
|
for(int numb:numbers[numbers.size()-2]){
|
|
if(!increasingNumberSet){
|
|
increasingNumberSet=true;
|
|
}else{
|
|
numbers.back().push_back(numb-prevNumb);
|
|
if(increasingAllSame){
|
|
if(numb-prevNumb!=increasingNumb){
|
|
increasingAllSame=false;
|
|
}
|
|
}
|
|
}
|
|
prevNumb=numb;
|
|
increasingNumb=numb-prevNumb;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
std::cout<<sum<<std::endl;
|
|
break;
|
|
//wait(0); //Wait for 0ms and render the screen (calls draw())
|
|
}
|
|
}
|
|
|
|
|
|
void doStuff(){
|
|
while(true){ //lines is accessible as a global.
|
|
std::vector<std::vector<int>>numbers;
|
|
int increasingNumb=0;
|
|
int prevNumb=0;
|
|
bool increasingAllSame=true;
|
|
bool increasingNumberSet=false;
|
|
long long sum=0;
|
|
for(std::string&line:lines){
|
|
numbers.clear();
|
|
numbers.push_back({});
|
|
while(line.length()>0){
|
|
size_t spacePos=line.find(' ');
|
|
int numb;
|
|
if(spacePos==std::string::npos){
|
|
numb=std::stoi(line);
|
|
line="";
|
|
}else{
|
|
numb=std::stoi(line.substr(0,spacePos));
|
|
line=line.substr(spacePos+1);
|
|
}
|
|
numbers.back().push_back(numb);
|
|
if(numbers.back().size()>=2){
|
|
if(!increasingNumberSet){
|
|
increasingNumberSet=true;
|
|
}else{
|
|
if(increasingAllSame){
|
|
if(numb-prevNumb!=increasingNumb){
|
|
increasingAllSame=false;
|
|
}
|
|
}
|
|
}
|
|
increasingNumb=numb-prevNumb;
|
|
}
|
|
prevNumb=numb;
|
|
}
|
|
while(true){
|
|
if(increasingAllSame){
|
|
bool previousNumberSet=false;
|
|
if(numbers.size()==1){
|
|
sum+=numbers.back().back()+increasingNumb;
|
|
}else{
|
|
for(int i=numbers.size()-1;i>=0;i--){
|
|
std::vector<int>&numList=numbers[i];
|
|
if(!previousNumberSet){
|
|
previousNumberSet=true;
|
|
prevNumb=numList.back();
|
|
}else{
|
|
prevNumb=prevNumb+numList.back();
|
|
}
|
|
}
|
|
sum+=prevNumb;
|
|
}
|
|
std::cout<<sum<<std::endl;
|
|
break;
|
|
}else{
|
|
numbers.push_back({});
|
|
increasingNumb=0;
|
|
prevNumb=0;
|
|
increasingAllSame=true;
|
|
increasingNumberSet=false;
|
|
for(int numb:numbers[numbers.size()-2]){
|
|
if(!increasingNumberSet){
|
|
increasingNumberSet=true;
|
|
}else{
|
|
numbers.back().push_back(numb-prevNumb);
|
|
if(increasingAllSame){
|
|
if(numb-prevNumb!=increasingNumb){
|
|
increasingAllSame=false;
|
|
}
|
|
}
|
|
}
|
|
prevNumb=numb;
|
|
increasingNumb=numb-prevNumb;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
std::cout<<sum<<std::endl;
|
|
break;
|
|
//wait(0); //Wait for 0ms and render the screen (calls draw())
|
|
}
|
|
}
|
|
|
|
void draw(){ //Only use Sprites! If using decals, you must reference global variables!
|
|
Clear(BLACK);
|
|
int count=0;
|
|
for(std::string&line:lines){
|
|
DrawString({0,count*32},line,WHITE,4);
|
|
count++;
|
|
}
|
|
}
|
|
|
|
#pragma region Hidden Engine Stuff
|
|
public:
|
|
AoC2023()
|
|
{
|
|
// Name your application
|
|
std::string fileName="day"+std::to_string(DAY)+"_1.txt";
|
|
if(runInput==FILE2){fileName="day"+std::to_string(DAY)+"_2.txt";}
|
|
std::ifstream file(fileName);
|
|
while(file.good()){
|
|
std::string line;
|
|
std::getline(file,line);
|
|
lines.push_back(line);
|
|
}
|
|
|
|
sAppName = "Advent of Code 2023 - Day "+std::to_string(DAY);
|
|
}
|
|
|
|
public:
|
|
bool OnUserCreate() override
|
|
{
|
|
|
|
return true;
|
|
}
|
|
|
|
bool OnUserUpdate(float fElapsedTime) override
|
|
{
|
|
static std::thread aocSolver(&AoC2023::doStuff2,this);
|
|
|
|
if(waitForRender){
|
|
draw();
|
|
waitForRender=false;
|
|
}
|
|
return true;
|
|
}
|
|
};
|
|
|
|
int main()
|
|
{
|
|
AoC2023 game;
|
|
if (game.Construct(640, 480, 2, 2))
|
|
game.Start();
|
|
return 0;
|
|
}
|
|
#pragma endregion |