day 3 challenge 1 doesnt work but thats all the time ive got

.vscode/settings.json

@@ -1,6 +1,44 @@
 {
     "files.associations": {
         "iosfwd": "cpp",
-        "vector": "cpp"
+        "vector": "cpp",
+        "cctype": "cpp",
+        "cmath": "cpp",
+        "cstddef": "cpp",
+        "cstdint": "cpp",
+        "cstdio": "cpp",
+        "cstdlib": "cpp",
+        "cstring": "cpp",
+        "cwchar": "cpp",
+        "exception": "cpp",
+        "fstream": "cpp",
+        "initializer_list": "cpp",
+        "ios": "cpp",
+        "iostream": "cpp",
+        "istream": "cpp",
+        "limits": "cpp",
+        "memory": "cpp",
+        "new": "cpp",
+        "ostream": "cpp",
+        "sstream": "cpp",
+        "stdexcept": "cpp",
+        "streambuf": "cpp",
+        "string": "cpp",
+        "system_error": "cpp",
+        "tuple": "cpp",
+        "type_traits": "cpp",
+        "typeinfo": "cpp",
+        "utility": "cpp",
+        "xfacet": "cpp",
+        "xiosbase": "cpp",
+        "xlocale": "cpp",
+        "xlocinfo": "cpp",
+        "xlocnum": "cpp",
+        "xmemory": "cpp",
+        "xmemory0": "cpp",
+        "xstddef": "cpp",
+        "xstring": "cpp",
+        "xtr1common": "cpp",
+        "xutility": "cpp"
     }
 }

2019/3rdDay/challenge.txt

@@ -0,0 +1,41 @@
+--- Day 3: Crossed Wires ---
+The gravity assist was successful, and you're well on your way to the Venus refuelling station. During the rush back on Earth, the fuel management system wasn't completely installed, so that's next on the priority list.
+
+Opening the front panel reveals a jumble of wires. Specifically, two wires are connected to a central port and extend outward on a grid. You trace the path each wire takes as it leaves the central port, one wire per line of text (your puzzle input).
+
+The wires twist and turn, but the two wires occasionally cross paths. To fix the circuit, you need to find the intersection point closest to the central port. Because the wires are on a grid, use the Manhattan distance for this measurement. While the wires do technically cross right at the central port where they both start, this point does not count, nor does a wire count as crossing with itself.
+
+For example, if the first wire's path is R8,U5,L5,D3, then starting from the central port (o), it goes right 8, up 5, left 5, and finally down 3:
+
+...........
+...........
+...........
+....+----+.
+....|....|.
+....|....|.
+....|....|.
+.........|.
+.o-------+.
+...........
+Then, if the second wire's path is U7,R6,D4,L4, it goes up 7, right 6, down 4, and left 4:
+
+...........
+.+-----+...
+.|.....|...
+.|..+--X-+.
+.|..|..|.|.
+.|.-X--+.|.
+.|..|....|.
+.|.......|.
+.o-------+.
+...........
+These wires cross at two locations (marked X), but the lower-left one is closer to the central port: its distance is 3 + 3 = 6.
+
+Here are a few more examples:
+
+R75,D30,R83,U83,L12,D49,R71,U7,L72
+U62,R66,U55,R34,D71,R55,D58,R83 = distance 159
+R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51
+U98,R91,D20,R16,D67,R40,U7,R15,U6,R7 = distance 135
+
+What is the Manhattan distance from the central port to the closest intersection?

2019/3rdDay/challenge1.cpp

@@ -0,0 +1,165 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <string>
+#include <vector>
+#include <unordered_map>
+#include <algorithm>
+
+std::vector<std::string> tokenise( std::string input )
+{
+    std::stringstream ssInput( input );
+    std::vector<std::string> stream;
+
+    std::string s;
+	while( std::getline( ssInput, s, ',' ) ) {
+		stream.push_back( s );
+	}
+
+    return stream;
+}
+
+struct vec2
+{
+    int x;
+    int y;
+
+    bool operator==(const vec2& v) const
+    {
+        return x == v.x && y == v.y;
+    }
+};
+
+namespace std
+{
+    template <>
+    struct hash<vec2>
+    {
+        size_t operator()( const vec2& v ) const
+        {
+            return v.x ^ v.y;
+        }
+    };
+}
+
+struct Wire
+{
+    vec2 Head = { 0, 0 };
+    vec2 Origin = { 0, 0 };
+    std::vector<vec2> Visited;
+};
+
+void step( std::vector<vec2>& path, vec2& pos, int steps, char dir )
+{
+
+    auto up     = []( vec2& p ) { p.y -= 1; };
+	auto down   = []( vec2& p ) { p.y += 1; };
+	auto left   = []( vec2& p ) { p.x -= 1; };
+	auto right  = []( vec2& p ) { p.x += 1; };
+
+    void (*stepSingle)(vec2&);
+
+    switch ( dir )
+    {
+        case 'U': stepSingle = up; break;
+        case 'D': stepSingle = down; break;
+        case 'R': stepSingle = right; break;
+        case 'L': stepSingle = left; break;
+        default: break;
+    }
+
+	for( int i = 0; i < steps; i++ )
+	{
+		stepSingle( pos );
+		path.push_back( pos );
+	}
+
+}
+
+int main(int argc, char** argv)
+{
+
+    std::ifstream infile( argv[1] );
+
+    std::string input;
+
+    std::getline( infile, input );
+    std::vector<std::string> wireS1 = tokenise( "R75,D30,R83,U83,L12,D49,R71,U7,L72"); // tokenise( input );
+
+    std::getline( infile, input );
+    std::vector<std::string> wireS2 = tokenise( "U62,R66,U55,R34,D71,R55,D58,R83" );// tokenise( input );
+
+    // Construct map of nodes
+    // for each point a wire
+    // lays on, one is added
+    // to the node
+
+    // Wires are assumed to start at 0,0
+
+    Wire wire1;
+    for ( auto& element : wireS1 )
+    {
+
+        // Seperate the direction from the displacement
+
+        char direction = element[0];
+        int displacement = std::stoi( element.substr( 1, element.size() ) );
+
+        step(wire1.Visited, wire1.Head, displacement, direction);
+
+        std::cout << "Wire 1 " << element << std::endl;
+
+    }
+
+    Wire wire2;
+    for ( auto& element : wireS2 )
+    {
+
+        // Seperate the direction from the displacement
+
+        char direction = element[0];
+        int displacement = std::stoi( element.substr( 1, element.size() ) );
+
+        step(wire2.Visited, wire2.Head, displacement, direction);
+
+        std::cout << "Wire 2 " << element << std::endl;
+
+    }
+
+    auto find = []( std::vector<vec2> arr, vec2 el ) {
+        for ( int i = 0; i < arr.size(); i++ )
+            if ( arr[i] == el ) return i;
+        return -1;
+    };
+
+
+    std::unordered_map<vec2, int> wires;
+
+    for ( int i = 0; i < wire1.Visited.size(); i++ )
+    {
+        wires[wire1.Visited[i]] = 1;
+    }
+
+    for ( int i = 0; i < wire2.Visited.size(); i++ )
+    {
+        if ( wires[wire1.Visited[i]] == 1 )
+            wires[wire1.Visited[i]]++;
+    }
+ 
+    std::vector<int> intersectDistances;
+
+	for ( auto it = wires.begin(); it != wires.end(); it++ )
+    {
+        if ( it->second == 2 )
+        {
+            vec2 v = it->first;
+            std::cout << v.x << " " << v.y << std::endl;
+            intersectDistances.push_back( std::abs( v.x ) + std::abs( v.y ) );
+        }
+    }
+
+    int minDistance = *std::min_element( intersectDistances.cbegin(), intersectDistances.cend() );
+
+    std::cout << "Minimum Distance to Intersect : " << minDistance << std::endl;
+
+}

2019/3rdDay/input.txt

@@ -0,0 +1,2 @@
+R992,U284,L447,D597,R888,D327,R949,U520,R27,U555,L144,D284,R538,U249,R323,U297,R136,U838,L704,D621,R488,U856,R301,U539,L701,U363,R611,D94,L734,D560,L414,U890,R236,D699,L384,D452,R702,D637,L164,U410,R649,U901,L910,D595,R339,D346,R959,U777,R218,D667,R534,D762,R484,D914,L25,U959,R984,D922,R612,U999,L169,D599,L604,D357,L217,D327,L730,D949,L565,D332,L114,D512,R460,D495,L187,D697,R313,U319,L8,D915,L518,D513,R738,U9,R137,U542,L188,U440,R576,D307,R734,U58,R285,D401,R166,U156,L859,U132,L10,U753,L933,U915,R459,D50,R231,D166,L253,U844,R585,D871,L799,U53,R785,U336,R622,D108,R555,D918,L217,D668,L220,U738,L997,D998,R964,D456,L54,U930,R985,D244,L613,D116,L994,D20,R949,D245,L704,D564,L210,D13,R998,U951,L482,U579,L793,U680,L285,U770,L975,D54,R79,U613,L907,U467,L256,D783,R883,U810,R409,D508,L898,D286,L40,U741,L759,D549,R210,U411,R638,D643,L784,U538,L739,U771,L773,U491,L303,D425,L891,U182,R412,U951,L381,U501,R482,D625,R870,D320,L464,U555,R566,D781,L540,D754,L211,U73,L321,D869,R994,D177,R496,U383,R911,U819,L651,D774,L591,U666,L883,U767,R232,U822,L499,U44,L45,U873,L98,D487,L47,U803,R855,U256,R567,D88,R138,D678,L37,U38,R783,U569,L646,D261,L597,U275,L527,U48,R433,D324,L631,D160,L145,D128,R894,U223,R664,U510,R756,D700,R297,D361,R837,U996,L769,U813,L477,U420,L172,U482,R891,D379,L329,U55,R284,U155,L816,U659,L671,U996,R997,U252,R514,D718,L661,D625,R910,D960,L39,U610,R853,U859,R174,U215,L603,U745,L587,D736,R365,U78,R306,U158,L813,U885,R558,U631,L110,D232,L519,D366,R909,D10,R294
+L1001,D833,L855,D123,R36,U295,L319,D700,L164,U576,L68,D757,R192,D738,L640,D660,R940,D778,R888,U772,R771,U900,L188,D464,L572,U184,R889,D991,L961,U751,R560,D490,L887,D748,R37,U910,L424,D401,L385,U415,L929,U193,R710,D855,L596,D323,L966,D505,L422,D139,L108,D135,R737,U176,R538,D173,R21,D951,R949,D61,L343,U704,R127,U468,L240,D834,L858,D127,R328,D863,R329,U477,R131,U864,R997,D38,R418,U611,R28,U705,R148,D414,R786,U264,L785,D650,R201,D250,R528,D910,R670,U309,L658,U190,R704,U21,R288,D7,R930,U62,R782,U621,R328,D725,R305,U700,R494,D137,R969,U142,L867,U577,R300,U162,L13,D698,R333,U865,R941,U796,L60,U902,L784,U832,R78,D578,R196,D390,R728,D922,R858,D994,L457,U547,R238,D345,R329,D498,R873,D212,R501,U474,L657,U910,L335,U133,R213,U417,R698,U829,L2,U704,L273,D83,R231,D247,R675,D23,L692,D472,L325,D659,L408,U746,L715,U395,L596,U296,R52,D849,L713,U815,R684,D551,L319,U768,R176,D182,R557,U731,R314,D543,L9,D256,R38,D809,L567,D332,R375,D572,R81,D479,L71,U968,L831,D247,R989,U390,R463,D576,R740,D539,R488,U367,L596,U375,L763,D824,R70,U448,R979,D977,L744,D379,R488,D671,L516,D334,L542,U517,L488,D390,L713,D932,L28,U924,L448,D229,L488,D501,R19,D910,L979,D411,R711,D824,L973,U291,R794,D485,R208,U370,R655,U450,L40,D804,L374,D671,R962,D829,L209,U111,L84,D876,L832,D747,L733,D560,L702,D972,R188,U817,L111,U26,L492,U485,L71,D59,L269,D870,L152,U539,R65,D918,L932,D260,L485,U77,L699,U254,R924,U643,L264,U96,R395,D917,R360,U354,R101,D682,R854,U450,L376,D378,R872,D311,L881,U630,R77,D766,R672