Submission #941840

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
941840	2024-03-09T14:50:26 Z	benjaminkleyn	Longest Trip (IOI23_longesttrip)	C++17	40 / 100	12 ms	852 KB

longesttrip

#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;

vector<int> longest_trip(int N, int D)
{
    if (D == 3)
    {
        vector<int> res(N);
        iota(res.begin(), res.end(), 0);
        return res;
    }

    if (D == 2)
    {
        vector<int> res;
        int cur;
        if (are_connected({0}, {1}))
            res = {0, 1}, cur = 2;
        else
            res = {0, 2, 1}, cur = 3;

        for (int i = cur; i < N; i++)
        {
            if (!are_connected({res.back()}, {i}))
                reverse(res.begin(), res.end());
            res.push_back(i);
        }

        return res;
    }

    vector<int> A = {0}, B = {1};
    for (int i = 2; i < N; i++)
    {
        if (are_connected({i}, {A.back(), B.back()}))
        {
            if (are_connected({i}, {A.back()}))
                A.push_back(i);
            else
                B.push_back(i);
        }
        else
        {
            reverse(B.begin(), B.end());
            for (int x : B)
                A.push_back(x);
            B = {i};
        }
    }
    if (A.size() > B.size())
        return A;
    return B;
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	344 KB	Output is correct
2	Correct	4 ms	344 KB	Output is correct
3	Correct	4 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	Correct	6 ms	344 KB	Output is correct
7	Correct	5 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	600 KB	Output is correct
11	Correct	4 ms	344 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	4 ms	436 KB	Output is correct

Subtask #3

25.0 / 25.0

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

Subtask #4

0.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-