Keke's delivery service

input/code.cpp: In function 'long double Shortest(std::array<std::pair<std::complex<long double>, std::complex<long double> >, 10>&, std::complex<long double>, std::string)':
input/code.cpp:37:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::array<std::pair<std::complex<long double>, std::complex<long double> >, 10>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for (int i = 0; i < points.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
input/code.cpp: In function 'void solve()':
input/code.cpp:68:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::array<std::pair<std::complex<long double>, std::complex<long double> >, 10>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for (int i = 0; i < points.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
input/code.cpp:75:23: warning: narrowing conversion of 'a' from 'long long int' to 'long do...

#include <iostream>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <climits>
#include <cmath>
#include <functional>
#include <type_traits>
#include <fstream>
#include <bitset>
#include <complex>
#include <iomanip>
 
#define int long long
using namespace std;
 
#define cross(x, y) (((x)*conj(y)).imag())
#define mag(x) (sqrt(x.imag() * x.imag() + x.real() * x.real())
#define sign(v) ((0 < (v)) - ((v) < 0))

unordered_map<string, long double> mp;

int A = 917563753;
int B = 1946186274;

long double Shortest(array<pair<complex<long double>, complex<long double>>, 10>& points, complex<long double> from, string hash)
{
    if (mp.find(hash) != mp.end())
        return mp[hash];

    long double dist = LLONG_MAX;
    for (int i = 0; i < points.size(); i++)
    {
        if (points[i].first.real() == LLONG_MAX)
            continue;
        
        auto p1 = points[i].first;
        auto p2 = points[i].second;
        points[i] = {p2, {LLONG_MAX, LLONG_MAX}};

        string newHash = hash;
        newHash[i+1]++;
        newHash[0] = i+'0';

        dist = min(dist, Shortest(points, p1, newHash) + abs(from - p1));
        points[i] = {p1, p2};
    }

    mp[hash] = dist == LLONG_MAX ? abs(from) : dist;

    if (dist == LLONG_MAX)
        return abs(from);
    else
        return dist;
}

void solve()
{
    int n;
    cin >> n;
    
    array<pair<complex<long double>, complex<long double>>, 10> points;
    for (int i = 0; i < points.size(); i++)
        points[i] = {{LLONG_MAX, LLONG_MAX}, {LLONG_MAX, LLONG_MAX}};

    for (int i = 0; i < n; i++)
    {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        points[i] = {{a, b}, {c, d}};
    }

    cout << Shortest(points, {0, 0}, "00000000000");

}
 
 
signed main()
{
    ios::sync_with_stdio(0);
    cout.precision(25);
    //setprecision(10);
    //cin.tie(0);
 
    int t = 1;
 
    //cin >> t;
    //ifstream f("testcase.txt");
    //cin.rdbuf(f.rdbuf());
 
    for (int i = 0; i < t; i++)
        solve();
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED