답안 #855516

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
855516	2023-10-01T11:30:01 Z	Nonoze	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	14 ms	960 KB

longesttrip

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

using namespace std;

std::vector<int> longest_trip(int N, int D)
{
    list <int> l1,l2;
    l1.push_back(0);
    bool flag=false;
    for (int i(1); i < N; i++) {

        if (l2.empty()) l2.push_back(i), flag=false;
        else if (are_connected({i},{l1.back()})) {
            l1.push_back(i);
            flag=false;
        }
        else if (flag || are_connected({i},{l2.front()})){
            l2.push_front(i);
            flag=true;
        }
        else  {
            l1.insert(l1.end(), l2.begin(), l2.end());
            l2.clear();
            l2.push_back(i);
            flag=false;
        }
    }
    vector< int > v1, v2;

    while (!l1.empty()) {
        v1.push_back(l1.front());
        l1.pop_front();
    }
    while (!l2.empty()) {
        v2.push_back(l2.front());
        l2.pop_front();
    }
    if (v2.size()==0) return v1;
    if (!are_connected(v1, v2)) {
        if (v1.size() > v2.size()) return v1;
        return v2;
    }

    if (v1.size()>1 && !are_connected({v1[0]}, {v1.back()})) {
        if (are_connected({v2[0]}, {v1.back()})) {
            v1.insert(v1.end(), v2.begin(), v2.end());
        }

        else {
            v1.insert(v1.begin(), v2.rbegin(), v2.rend());
        }
        return v1;
    }

    if (v2.size()>1 && !are_connected({v2[0]}, {v2.back()})) {
        if (are_connected({v1.back()}, {v2[0]})) {
            v1.insert(v1.end(), v2.begin(), v2.end());
        }

        else {
            v1.insert(v1.end(), v2.rbegin(), v2.rend());
        }
        return v1;
    }
    

    int l=0, r=v1.size();
    while (l<r) {
        int mid=(l+r)/2;
        if (are_connected(vector<int>(v1.begin(), v1.begin()+mid + 1), v2)) r=mid;
        else l=mid+1;
    }

    int empl1=l;
    l=0, r=v2.size();
    while (l<r) {
        int mid=(l+r)/2;
        if (are_connected(vector<int>(v2.begin(), v2.begin()+mid + 1), {v1[empl1]})) r=mid;
        else l=mid+1;
    }
    
    int empl2=l;

    vector<int> ans;
    ans=vector<int>(v1.begin()+empl1+1, v1.end());
    ans.insert(ans.end(), v1.begin(), v1.begin()+empl1+1);
    ans.insert(ans.end(), v2.begin()+empl2, v2.end());
    ans.insert(ans.end(), v2.begin(), v2.begin()+empl2);
    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	12 ms	344 KB	Output is correct
2	Correct	9 ms	596 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	444 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	344 KB	Output is correct
2	Correct	8 ms	344 KB	Output is correct
3	Correct	6 ms	344 KB	Output is correct
4	Correct	6 ms	600 KB	Output is correct
5	Correct	5 ms	444 KB	Output is correct
6	Correct	12 ms	344 KB	Output is correct
7	Correct	8 ms	344 KB	Output is correct
8	Correct	6 ms	600 KB	Output is correct
9	Correct	5 ms	340 KB	Output is correct
10	Correct	7 ms	860 KB	Output is correct
11	Correct	4 ms	440 KB	Output is correct
12	Correct	5 ms	600 KB	Output is correct
13	Correct	5 ms	444 KB	Output is correct

Subtask #3

25.0 / 25.0

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

Subtask #4

60.0 / 60.0

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