Submission details
Task:Keke's delivery service
Sender:aalto26jw_001
Submission time:2026-11-11 17:45:35 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.01 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.01 sdetails
#24ACCEPTED0.01 sdetails
#25ACCEPTED0.01 sdetails
#26ACCEPTED0.01 sdetails
#27ACCEPTED0.01 sdetails
#28ACCEPTED0.01 sdetails
#29ACCEPTED0.01 sdetails
#30ACCEPTED0.01 sdetails
#31ACCEPTED0.01 sdetails
#32ACCEPTED0.01 sdetails
#33ACCEPTED0.58 sdetails
#34ACCEPTED0.57 sdetails
#35ACCEPTED0.57 sdetails
#36ACCEPTED0.57 sdetails
#37ACCEPTED0.57 sdetails
#38--details
#39--details
#40--details
#41--details
#42--details
#43--details
#44--details
#45--details
#46--details
#47--details
#48--details
#49--details
#50--details
#51--details
#52--details
#53--details
#54--details
#55--details
#56--details
#57--details
#58--details
#59--details
#60--details
#61--details
#62--details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:26:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::complex<double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for (int j = 0; j < points.size(); ++j) {
      |                         ~~^~~~~~~~~~~~~~~

Code

#include <complex>
typedef double C;
typedef std::complex<C> Point;
#define X real()
#define Y imag() 

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>

int main() {
    int n;
    std::cin >> n;

    std::vector<Point> points;
    points.push_back({0, 0});
    std::vector<std::vector<int>> needed_paths(n);
    for (int i = 0; i < n; ++i) {
        C x1, y1, x2, y2;
        std::cin >> x1 >> y1 >> x2 >> y2;
        Point a = {x1, y1};
        int a_i = -1;
        Point b = {x2, y2};
        int b_i = -1;
        for (int j = 0; j < points.size(); ++j) {
            if (points[j] == a) a_i = j;
            if (points[j] == b) b_i = j;
        }
        if (a_i == -1) {
            a_i = points.size();
            points.push_back(a);
        }
        if (b_i == -1) {
            b_i = points.size();
            points.push_back(b);
        }
        needed_paths[i] = {a_i, b_i};
        //std::cout << needed_paths[i][0] << " " << needed_paths[i][1];
    }

    int point_count = points.size();
    std::vector<std::vector<double>> distances(point_count, std::vector<double>(point_count));
    for (int i = 0; i < point_count; ++i) {
        for (int j = 0; j < point_count; ++j) {
            distances[i][j] = std::abs(points[i]-points[j]);
            //std::cout << distances[i][j] << " ";
        }
        //std::cout << std::endl;
    }

    std::vector<bool> avaiable(n, true);
    std::vector<bool> picked_up(n, false);

    std::function<double(int)> get_shortest = [&](int current) -> double {
        double shortest = std::numeric_limits<double>::max();
        //std::cout << "Testing " << current << std::endl;
        for (int i = 0; i < n; ++i) {
            if (avaiable[i]) {
                avaiable[i] = false;
                picked_up[i] = true;
                double dist = get_shortest(needed_paths[i][0]) + distances[current][needed_paths[i][0]];
                if (dist < shortest) shortest = dist;
                avaiable[i] = true;
                picked_up[i] = false;
            }

            if (picked_up[i]) {
                picked_up[i] = false;
                double dist = get_shortest(needed_paths[i][1]) + distances[current][needed_paths[i][1]];
                if (dist < shortest) shortest = dist;
                picked_up[i] = true;
            }
        }
        
        //std::cout << "shortest: " << shortest << std::endl;
        if (shortest == std::numeric_limits<double>::max()) return distances[current][0];
        return shortest;
    };

    double all_shortest = get_shortest(0);
    std::cout << all_shortest;
}

Test details

Test 1

Verdict:

input
1
1 2 5 7 

correct output
17.24151748197526515596

user output
17.2415

Test 2

Verdict:

input
1
-2 10 5 9 

correct output
27.56473698003804521928

user output
27.5647

Test 3

Verdict: ACCEPTED

input
2
-1 -7 -10 9 
1 9 -1 0 

correct output
46.64817201984418185146

user output
46.6482

Test 4

Verdict: ACCEPTED

input
2
1 -9 4 7 
-4 -8 0 1 

correct output
38.53321457061962859031

user output
38.5332

Test 5

Verdict: ACCEPTED

input
2
6 2 -6 8 
7 8 10 -7 

correct output
58.49347834429028263753

user output
58.4935

Test 6

Verdict: ACCEPTED

input
2
6 2 -6 8 
7 8 10 -7 

correct output
58.49347834429028263753

user output
58.4935

Test 7

Verdict: ACCEPTED

input
3
10 8 1 -7 
10 7 5 2 
4 2 -6 -8 

correct output
47.94841075476520489418

user output
47.9484

Test 8

Verdict: ACCEPTED

input
3
-6 -9 8 7 
-6 -3 9 10 
0 -9 2 -2 

correct output
53.42086935541394488933

user output
53.4209

Test 9

Verdict: ACCEPTED

input
3
8 9 -4 -6 
7 -9 -10 -3 
-8 10 2 -8 

correct output
75.43730966940650396746

user output
75.4373

Test 10

Verdict: ACCEPTED

input
3
8 4 2 -1 
-5 -8 -7 -7 
-2 -7 -8 -5 

correct output
41.03401888405835429979

user output
41.034

Test 11

Verdict: ACCEPTED

input
3
-4 4 0 -4 
6 1 6 -8 
8 -8 -7 -6 

correct output
51.02746211319720185187

user output
51.0275

Test 12

Verdict: ACCEPTED

input
3
-1 -1 -4 4 
-6 -5 -5 -10 
7 4 -8 0 

correct output
49.16957315214831639866

user output
49.1696

Test 13

Verdict: ACCEPTED

input
3
5 -9 2 5 
9 7 -7 8 
6 -9 -3 9 

correct output
56.01093630215238362152

user output
56.0109

Test 14

Verdict: ACCEPTED

input
4
-9 -6 6 -4 
-1 10 5 -1 
10 -4 1 -5 
0 -9 -9 -2 

correct output
69.46799309053363308958

user output
69.468

Test 15

Verdict: ACCEPTED

input
4
8 -10 10 -5 
8 -3 1 7 
-6 -2 -10 2 
-1 6 -2 -2 

correct output
62.32599841627421704063

user output
62.326

Test 16

Verdict: ACCEPTED

input
4
-10 -3 0 0 
0 -10 -8 -4 
-8 -10 -6 8 
-2 -8 -5 -8 

correct output
49.37474628842959419733

user output
49.3747

Test 17

Verdict: ACCEPTED

input
4
9 -10 3 -3 
5 -10 -8 6 
-9 -3 6 8 
-4 5 1 4 

correct output
70.54491148050797239000

user output
70.5449

Test 18

Verdict: ACCEPTED

input
4
3 2 0 9 
1 3 8 5 
4 -6 5 -8 
5 7 -6 10 

correct output
55.77371783018015604511

user output
55.7737

Test 19

Verdict: ACCEPTED

input
4
4 5 0 7 
7 5 -10 4 
6 -6 1 10 
-4 2 -10 0 

correct output
58.25155150420911822143

user output
58.2516

Test 20

Verdict: ACCEPTED

input
4
-7 3 -4 -6 
-9 3 -1 -5 
7 1 9 2 
5 5 6 8 

correct output
51.95472904146592808827

user output
51.9547

Test 21

Verdict: ACCEPTED

input
4
8 3 -7 6 
0 6 9 -8 
-2 8 -9 -9 
9 -6 3 -2 

correct output
71.27875557664922673284

user output
71.2788

Test 22

Verdict: ACCEPTED

input
4
6 -7 1 10 
-8 -6 3 -9 
-9 -7 -4 -9 
-2 5 1 -7 

correct output
64.30357123791869498886

user output
64.3036

Test 23

Verdict: ACCEPTED

input
5
3 9 -3 -6 
3 -2 -7 3 
10 4 -3 2 
10 9 -6 4 
...

correct output
65.29921928785613079865

user output
65.2992

Test 24

Verdict: ACCEPTED

input
5
-4 -10 10 -4 
6 2 10 3 
-6 -3 -8 -6 
9 9 -9 9 
...

correct output
82.23748773331917538004

user output
82.2375

Test 25

Verdict: ACCEPTED

input
5
8 -9 -3 -2 
1 -4 10 5 
5 5 7 -3 
-8 -1 9 -5 
...

correct output
67.56153807887115932823

user output
67.5615

Test 26

Verdict: ACCEPTED

input
5
-5 4 -1 4 
-2 9 -5 -8 
8 5 -7 2 
-10 7 10 8 
...

correct output
86.95689997133690237602

user output
86.9569

Test 27

Verdict: ACCEPTED

input
5
-10 -6 6 -2 
-9 -2 3 -1 
-10 -8 9 5 
-2 -3 -5 -2 
...

correct output
60.24622192778474186192

user output
60.2462

Test 28

Verdict: ACCEPTED

input
5
-1 -1 -4 4 
-6 -5 -5 -10 
7 4 -8 0 
3 2 -5 -5 
...

correct output
56.09845589945781874422

user output
56.0985

Test 29

Verdict: ACCEPTED

input
5
5 -9 2 5 
9 7 -7 8 
6 -9 -3 9 
-7 0 -5 -2 
...

correct output
66.46035926536274213855

user output
66.4604

Test 30

Verdict: ACCEPTED

input
5
9 -8 -1 1 
-6 5 2 -4 
3 8 4 -9 
-8 3 5 3 
...

correct output
68.92236432287188030443

user output
68.9224

Test 31

Verdict: ACCEPTED

input
5
-2 8 8 9 
9 8 4 -2 
3 9 2 1 
-6 -7 -2 -8 
...

correct output
68.57347683433427024124

user output
68.5735

Test 32

Verdict: ACCEPTED

input
5
1 -10 6 7 
7 -3 -8 7 
2 2 1 -2 
-1 -6 -1 4 
...

correct output
67.26306049003909036388

user output
67.2631

Test 33

Verdict: ACCEPTED

input
6
633196515 485923574 -954265220...

correct output
7364359200.7228123750537633895...

user output
7.36436e+09

Test 34

Verdict: ACCEPTED

input
6
-54250287 -57195506 925370083 ...

correct output
6070544873.2142193284817039966...

user output
6.07054e+09

Test 35

Verdict: ACCEPTED

input
6
717786754 -23244255 -670216484...

correct output
6236901804.9330618907697498798...

user output
6.2369e+09

Test 36

Verdict: ACCEPTED

input
6
-747595481 -560868740 20781968...

correct output
6206348638.7408930636011064052...

user output
6.20635e+09

Test 37

Verdict: ACCEPTED

input
6
369551931 -830851741 -63146575...

correct output
7466232851.6345729152671992778...

user output
7.46623e+09

Test 38

Verdict:

input
7
-503438465 -401188031 -2915208...

correct output
7182008964.6697172718122601509...

user output
(empty)

Test 39

Verdict:

input
7
-774852389 498112692 -73382627...

correct output
7322574754.7929240637458860874...

user output
(empty)

Test 40

Verdict:

input
7
-745557241 -362230062 11872950...

correct output
7345290128.8702740180306136608...

user output
(empty)

Test 41

Verdict:

input
7
-280510503 487323735 82609299 ...

correct output
8284167601.0197063554078340530...

user output
(empty)

Test 42

Verdict:

input
7
-194568921 -912512861 44703011...

correct output
9098246106.3207166725769639015...

user output
(empty)

Test 43

Verdict:

input
8
383287698 969195218 -182348842...

correct output
7016551085.8444829522632062435...

user output
(empty)

Test 44

Verdict:

input
8
-385704087 -937741013 -3077950...

correct output
8127710933.8054637983441352844...

user output
(empty)

Test 45

Verdict:

input
8
844450667 -871888619 -19960889...

correct output
8213584640.6935460437089204788...

user output
(empty)

Test 46

Verdict:

input
8
-466328566 481082051 -33685140...

correct output
9423990911.6089521860703825950...

user output
(empty)

Test 47

Verdict:

input
8
-917189424 -579600323 67525298...

correct output
8227519630.3055775831453502178...

user output
(empty)

Test 48

Verdict:

input
9
-31221656 -526597392 -52535813...

correct output
8856995290.3726284708827733993...

user output
(empty)

Test 49

Verdict:

input
9
-23884334 -938550432 -56172498...

correct output
7357984723.6206405288539826870...

user output
(empty)

Test 50

Verdict:

input
9
-114003248 747828772 -69571861...

correct output
7938964098.6173283923417329788...

user output
(empty)

Test 51

Verdict:

input
9
166708726 -263032442 565409766...

correct output
7766653103.2631514174863696098...

user output
(empty)

Test 52

Verdict:

input
9
-325935302 409170424 652212820...

correct output
8170515916.9658243129961192607...

user output
(empty)

Test 53

Verdict:

input
10
178568022 273124119 535857466 ...

correct output
8231356926.8400429780595004558...

user output
(empty)

Test 54

Verdict:

input
10
-104452078 546885062 -99975436...

correct output
9390756029.7148792939260601997...

user output
(empty)

Test 55

Verdict:

input
10
-63708076 -602539257 -94432385...

correct output
8497255968.9021178991533815860...

user output
(empty)

Test 56

Verdict:

input
10
182829493 -848119476 520735868...

correct output
9795917686.1810622680932283401...

user output
(empty)

Test 57

Verdict:

input
10
934069847 175172315 -629139614...

correct output
10107572824.729460356757044792...

user output
(empty)

Test 58

Verdict:

input
10
-523273295 -881501593 86988338...

correct output
9378626642.9278714880347251892...

user output
(empty)

Test 59

Verdict:

input
10
917402565 -287078799 -55030325...

correct output
9067761971.7593543389812111854...

user output
(empty)

Test 60

Verdict:

input
10
-836129193 -511793054 67486286...

correct output
9294216739.0473321685567498207...

user output
(empty)

Test 61

Verdict:

input
10
875675361 -976131926 -48580743...

correct output
10188158256.107221888378262519...

user output
(empty)

Test 62

Verdict:

input
10
-977721665 -217325906 77767487...

correct output
9173124717.6331664901226758956...

user output
(empty)