답안 #928441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928441	2024-02-16T11:50:05 Z	n1k	가장 긴 여행 (IOI23_longesttrip)	C++17	85 / 100	12 ms	1116 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[1].empty() or not are_connected(path[0], path[1])){
        if(path[0].size() > path[1].size())
            return path[0];

        return path[1];
    }

    if(are_connected({path[0][0]}, {path[1][0]})){
        reverse(path[0].begin(), path[0].end());
        path[0].insert(path[0].end(), path[1].begin(), path[1].end());

        return path[0];
    }
    if(are_connected({path[0][0]}, {path[1][path[1].size()-1]})){
        path[1].insert(path[1].end(), path[0].begin(), path[0].end());

        return path[1];
    }
    if(are_connected({path[0][path[0].size()-1]}, {path[1][0]})){
        path[0].insert(path[0].end(), path[1].begin(), path[1].end());

        return path[0];
    }

    // jetzt wissen wir das path[0].begin - path[0].end
    // jetzt wissen wir das path[1].begin - path[1].end
    // und die pfade sind nicht disjoint

    // eine node in path[0] finden die mit path[1] verbunden ist
    // find i

    int li = 0, ri = path[0].size()-1;
    while(li<ri){
        int mi = (li + ri) / 2;
        vector<int> sub(path[0].begin(), path[0].begin()+mi+1);
        if(are_connected(sub, path[1])){
            ri = mi;
        }else{
            li = mi + 1;
        }
    }

    int i = li;

    int lj = 0, rj = path[1].size()-1;
    while(lj<rj){
        int mj = (lj + rj) / 2;
        vector<int> sub(path[1].begin(), path[1].begin()+mj+1);
        if(are_connected({path[0][i]}, sub)){
            rj = mj;
        }else{
            lj = mj + 1;
        }
    }

    int j = lj;

    vector<int> ans;

    ans.insert(ans.end(), path[0].begin() + i + 1, path[0].end());
    ans.insert(ans.end(), path[0].begin(), path[0].begin() + i + 1);

    ans.insert(ans.end(), path[1].begin() + j, path[1].end());
    ans.insert(ans.end(), path[1].begin(), path[1].begin() + j);

    return ans;
}

Subtask #0
0.0 / 0.0

#	결과	실행 시간	메모리	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

#	결과	실행 시간	메모리	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	4 ms	344 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 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	4 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	7 ms	344 KB	Output is correct
7	Correct	5 ms	596 KB	Output is correct
8	Correct	6 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	6 ms	600 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	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	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	4 ms	344 KB	Output is correct
10	Correct	4 ms	344 KB	Output is correct
11	Correct	4 ms	344 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	5 ms	432 KB	Output is correct
14	Correct	7 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	6 ms	344 KB	Output is correct
17	Correct	6 ms	600 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	7 ms	600 KB	Output is correct
20	Correct	5 ms	344 KB	Output is correct
21	Correct	6 ms	600 KB	Output is correct
22	Correct	6 ms	344 KB	Output is correct
23	Correct	5 ms	600 KB	Output is correct
24	Correct	5 ms	340 KB	Output is correct
25	Correct	8 ms	344 KB	Output is correct
26	Correct	7 ms	344 KB	Output is correct
27	Correct	10 ms	344 KB	Output is correct
28	Correct	6 ms	344 KB	Output is correct
29	Correct	9 ms	344 KB	Output is correct
30	Correct	8 ms	344 KB	Output is correct
31	Correct	7 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	8 ms	504 KB	Output is correct
35	Correct	9 ms	344 KB	Output is correct
36	Correct	8 ms	600 KB	Output is correct
37	Correct	8 ms	344 KB	Output is correct
38	Correct	9 ms	436 KB	Output is correct
39	Correct	8 ms	600 KB	Output is correct
40	Correct	7 ms	344 KB	Output is correct
41	Correct	6 ms	344 KB	Output is correct
42	Correct	7 ms	344 KB	Output is correct
43	Correct	7 ms	600 KB	Output is correct
44	Correct	7 ms	344 KB	Output is correct
45	Correct	7 ms	344 KB	Output is correct
46	Correct	7 ms	344 KB	Output is correct
47	Correct	8 ms	344 KB	Output is correct
48	Correct	6 ms	344 KB	Output is correct
49	Correct	6 ms	344 KB	Output is correct
50	Correct	6 ms	692 KB	Output is correct
51	Correct	7 ms	440 KB	Output is correct
52	Correct	8 ms	428 KB	Output is correct
53	Correct	6 ms	692 KB	Output is correct
54	Correct	9 ms	604 KB	Output is correct
55	Correct	7 ms	444 KB	Output is correct
56	Correct	5 ms	448 KB	Output is correct
57	Correct	9 ms	700 KB	Output is correct
58	Correct	8 ms	956 KB	Output is correct
59	Correct	8 ms	616 KB	Output is correct
60	Correct	8 ms	956 KB	Output is correct
61	Correct	7 ms	860 KB	Output is correct
62	Correct	7 ms	696 KB	Output is correct
63	Correct	8 ms	856 KB	Output is correct
64	Correct	8 ms	948 KB	Output is correct

Subtask #4
45.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 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	4 ms	344 KB	Output is correct
5	Correct	5 ms	600 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	4 ms	344 KB	Output is correct
10	Correct	5 ms	600 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	9 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	5 ms	600 KB	Output is correct
18	Correct	6 ms	344 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	5 ms	344 KB	Output is correct
21	Correct	6 ms	344 KB	Output is correct
22	Correct	7 ms	344 KB	Output is correct
23	Correct	8 ms	344 KB	Output is correct
24	Correct	9 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	7 ms	344 KB	Output is correct
29	Correct	7 ms	344 KB	Output is correct
30	Correct	6 ms	344 KB	Output is correct
31	Correct	8 ms	344 KB	Output is correct
32	Correct	7 ms	344 KB	Output is correct
33	Correct	12 ms	344 KB	Output is correct
34	Correct	8 ms	344 KB	Output is correct
35	Correct	7 ms	344 KB	Output is correct
36	Correct	8 ms	344 KB	Output is correct
37	Correct	6 ms	688 KB	Output is correct
38	Correct	8 ms	436 KB	Output is correct
39	Correct	8 ms	432 KB	Output is correct
40	Correct	6 ms	600 KB	Output is correct
41	Correct	8 ms	696 KB	Output is correct
42	Correct	8 ms	860 KB	Output is correct
43	Correct	5 ms	344 KB	Output is correct
44	Correct	5 ms	344 KB	Output is correct
45	Correct	5 ms	344 KB	Output is correct
46	Correct	5 ms	600 KB	Output is correct
47	Partially correct	7 ms	344 KB	Output is partially correct
48	Partially correct	8 ms	344 KB	Output is partially correct
49	Partially correct	9 ms	436 KB	Output is partially correct
50	Partially correct	7 ms	344 KB	Output is partially correct
51	Partially correct	7 ms	600 KB	Output is partially correct
52	Correct	6 ms	436 KB	Output is correct
53	Correct	7 ms	344 KB	Output is correct
54	Correct	7 ms	608 KB	Output is correct
55	Correct	6 ms	432 KB	Output is correct
56	Partially correct	9 ms	600 KB	Output is partially correct
57	Partially correct	8 ms	592 KB	Output is partially correct
58	Partially correct	8 ms	600 KB	Output is partially correct
59	Partially correct	9 ms	344 KB	Output is partially correct
60	Correct	8 ms	344 KB	Output is correct
61	Correct	6 ms	600 KB	Output is correct
62	Correct	5 ms	856 KB	Output is correct
63	Partially correct	7 ms	440 KB	Output is partially correct
64	Partially correct	7 ms	448 KB	Output is partially correct
65	Partially correct	7 ms	612 KB	Output is partially correct
66	Partially correct	7 ms	600 KB	Output is partially correct
67	Correct	7 ms	604 KB	Output is correct
68	Correct	9 ms	864 KB	Output is correct
69	Partially correct	8 ms	696 KB	Output is partially correct
70	Partially correct	7 ms	696 KB	Output is partially correct
71	Partially correct	10 ms	864 KB	Output is partially correct
72	Partially correct	7 ms	608 KB	Output is partially correct
73	Partially correct	7 ms	864 KB	Output is partially correct
74	Partially correct	9 ms	868 KB	Output is partially correct
75	Correct	7 ms	696 KB	Output is correct
76	Correct	8 ms	616 KB	Output is correct
77	Partially correct	10 ms	452 KB	Output is partially correct
78	Partially correct	8 ms	960 KB	Output is partially correct
79	Partially correct	8 ms	856 KB	Output is partially correct
80	Partially correct	7 ms	1116 KB	Output is partially correct
81	Correct	7 ms	440 KB	Output is correct
82	Correct	7 ms	856 KB	Output is correct

답안 #928441

Compilation message

Subtask #0 0.0 / 0.0

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 25.0 / 25.0

Subtask #4 45.0 / 60.0

Subtask #0
0.0 / 0.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
25.0 / 25.0

Subtask #4
45.0 / 60.0