Submission #842930

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
842930	2023-09-03T13:34:16 Z	pit4h	Longest Trip (IOI23_longesttrip)	C++17	30 / 100	9 ms	616 KB

longesttrip

#include<bits/stdc++.h>
#include "longesttrip.h"

using namespace std;

vector<int> longest_trip(int N, int D)
{
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    vector<int> path[2];  

    path[0] = {0}; 

    for (int i = 1; i < N; i++) {
        bool which = uniform_int_distribution<int>(0, 1)(rng);
        if (path[which].empty()) {
            which = !which;
        }

        if (are_connected({path[which].back()}, {i})) {
            path[which].push_back(i);
            if (!path[!which].empty() && 
                are_connected({path[!which].back()}, {i})) {
                while (!path[!which].empty()) {
                    path[which].push_back(path[!which].back());
                    path[!which].pop_back();
                }        
            }
        }
        else {
            path[!which].push_back(i);
        }
    }

    if (path[0].empty()) {
        return path[1];
    }
    if (path[1].empty()) {
        return path[0];
    }

    // if (are_connected({path[0][0], path[0].back()}, {path[1][0], path[1].back()})) {
    //     vector<int> res;
    //     if (are_connected({path[0][0]}, {path[1][0]})) {
    //         for (int i: path[1]) {
    //             res.push_back(i);
    //         }
    //         reverse(res.begin(), res.end());
    //         for (int i: path[0]) {
    //             res.push_back(i);
    //         }
    //     }
    //     else if(are_connected({path[0][0]}, {path[1].back()})) {
    //         for (int i: path[1]) {
    //             res.push_back(i);
    //         }
    //         for (int i: path[0]) {
    //             res.push_back(i);
    //         }
    //     }
    //     else if(are_connected({path[0].back()}, {path[1][0]})) {
    //         for (int i: path[0]) {
    //             res.push_back(i);
    //         }
    //         for (int i: path[1]) {
    //             res.push_back(i);
    //         }
    //     }
    //     else {
    //         std::cerr << "connection between backs of paths -- impossible\n";
    //         assert(false);
    //     }
    //     return res;
    // }

    // pair<int, int> connection = find_connection(path[0], path[1]);

    vector<int> res = (path[0].size() > path[1].size())?path[0] : path[1];

    return res;
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	344 KB	Output is correct
2	Correct	6 ms	600 KB	Output is correct
3	Correct	4 ms	344 KB	Output is correct
4	Correct	4 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct

Subtask #2

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	344 KB	Output is correct
2	Correct	5 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	6 ms	344 KB	Output is correct
6	Incorrect	0 ms	344 KB	Incorrect
7	Halted	0 ms	0 KB	-

Subtask #3

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	344 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	8 ms	344 KB	Output is correct
7	Correct	6 ms	344 KB	Output is correct
8	Correct	5 ms	596 KB	Output is correct
9	Correct	5 ms	440 KB	Output is correct
10	Correct	4 ms	344 KB	Output is correct
11	Correct	5 ms	600 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	8 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	7 ms	344 KB	Output is correct
17	Correct	7 ms	340 KB	Output is correct
18	Correct	6 ms	544 KB	Output is correct
19	Correct	5 ms	600 KB	Output is correct
20	Correct	6 ms	600 KB	Output is correct
21	Correct	6 ms	344 KB	Output is correct
22	Correct	5 ms	344 KB	Output is correct
23	Correct	5 ms	344 KB	Output is correct
24	Correct	7 ms	344 KB	Output is correct
25	Correct	7 ms	344 KB	Output is correct
26	Correct	7 ms	344 KB	Output is correct
27	Correct	7 ms	344 KB	Output is correct
28	Correct	6 ms	344 KB	Output is correct
29	Correct	6 ms	344 KB	Output is correct
30	Correct	5 ms	344 KB	Output is correct
31	Correct	6 ms	344 KB	Output is correct
32	Correct	6 ms	344 KB	Output is correct
33	Correct	6 ms	344 KB	Output is correct
34	Correct	6 ms	344 KB	Output is correct
35	Correct	7 ms	344 KB	Output is correct
36	Correct	6 ms	344 KB	Output is correct
37	Correct	7 ms	344 KB	Output is correct
38	Correct	7 ms	440 KB	Output is correct
39	Correct	7 ms	344 KB	Output is correct
40	Correct	7 ms	600 KB	Output is correct
41	Correct	6 ms	344 KB	Output is correct
42	Correct	8 ms	600 KB	Output is correct
43	Correct	6 ms	344 KB	Output is correct
44	Correct	7 ms	616 KB	Output is correct
45	Correct	9 ms	600 KB	Output is correct
46	Correct	7 ms	344 KB	Output is correct
47	Correct	6 ms	344 KB	Output is correct
48	Correct	7 ms	344 KB	Output is correct
49	Correct	6 ms	344 KB	Output is correct
50	Correct	6 ms	340 KB	Output is correct
51	Correct	6 ms	344 KB	Output is correct
52	Correct	6 ms	344 KB	Output is correct
53	Correct	5 ms	600 KB	Output is correct
54	Correct	6 ms	440 KB	Output is correct
55	Correct	6 ms	436 KB	Output is correct
56	Correct	5 ms	344 KB	Output is correct
57	Correct	7 ms	600 KB	Output is correct
58	Correct	9 ms	344 KB	Output is correct
59	Correct	7 ms	600 KB	Output is correct
60	Correct	6 ms	440 KB	Output is correct
61	Correct	6 ms	600 KB	Output is correct
62	Correct	7 ms	344 KB	Output is correct
63	Correct	7 ms	436 KB	Output is correct
64	Correct	6 ms	344 KB	Output is correct

Subtask #4

0.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	344 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	4 ms	344 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct
6	Incorrect	0 ms	344 KB	Incorrect
7	Halted	0 ms	0 KB	-