Submission #928419

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
928419	2024-02-16T10:58:28 Z	n1k	Longest Trip (IOI23_longesttrip)	C++17	30 / 100	9 ms	668 KB

longesttrip

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

using namespace std;

/*

OBSERVE:

path meargen

hinten und vorne dazu

* - * *

* - *

*/

std::vector<int> longest_trip(int N, int D){
    // vorraussetzung path[0].end nicht mit path[1].end verbunden
    vector<int> path[2];
    path[0].push_back(0);

    for(int i=1; i<N; i++){
        if(are_connected({*path[0].rbegin()}, {i})){
            path[0].push_back(i);
            if(path[1].size() and are_connected({path[0][path[0].size()-1]}, {path[1][path[1].size()-1]})){
                reverse(path[1].begin(), path[1].end());
                path[0].insert(path[0].end(), path[1].begin(), path[1].end());
                path[1].clear();
            }
        }else{
            path[1].push_back(i);
        }
    }
    if(path[0].size() > path[1].size()){
        return path[0];
    }else{
        return path[1];
    }
}

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

Subtask #4

0.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 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	-