Submission #1070335

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1070335	2024-08-22T13:22:37 Z	Plurm	Longest Trip (IOI23_longesttrip)	C++17	25 / 100	14 ms	612 KB

longesttrip

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

vector<int> longest_trip(int N, int D) {
    vector<vector<int>> g(N);
    vector<deque<int>> comp(N);
    for (int i = 0; i < N; i++)
        comp[i].push_back(i);
    while (comp.size() > 2) {
        int i = 0;
        int j = 1;
        int k = 2;
        int u = comp[i].back();
        int v = comp[j].back();
        int w = comp[k].back();
        if (are_connected({v}, {w})) {
            swap(u, w);
            swap(i, k);
        } else if (are_connected({u}, {w})) {
            swap(v, w);
            swap(j, k);
        }
        g[u].push_back(v);
        g[v].push_back(u);
        reverse(comp[j].begin(), comp[j].end());
        comp[i].insert(comp[i].end(), comp[j].begin(), comp[j].end());
        comp.erase(comp.begin() + j);
    }
    if (comp[0].size() < comp[1].size()) {
        swap(comp[0], comp[1]);
    }
    return vector<int>(comp[0].begin(), comp[0].end());
}

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

0.0 / 5.0

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

Subtask #2

0.0 / 10.0

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

Subtask #3

25.0 / 25.0

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