답안 #957457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
957457 2024-04-03T18:05:27 Z Turkhuu 가장 긴 여행 (IOI23_longesttrip) C++17
100 / 100
11 ms 952 KB
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int N, int D) {
    if (D > 1) {
        deque<int> a;
        if (are_connected({0}, {1})) {
            a = {0, 1};
            if (are_connected({0}, {2})) {
                a.push_front(2);
            } else {
                a.push_back(2);
            }
        } else {
            a = {0, 2, 1};
        }
        for (int i = 3; i < N; i++) {
            if (are_connected({a.front()}, {i})) {
                a.push_front(i);
            } else {
                a.push_back(i);
            }
        }
        return vector(a.begin(), a.end());
    }
    set<pair<int, int>> s;
    vector<int> a{0}, b{1};
    for (int i = 2; i < N; i++) {
        if (s.count(minmax(a.back(), b.back()))) {
            if (are_connected({i}, {a.back()})) {
                a.push_back(i);
            } else {
                s.insert(minmax(i, a.back()));
                b.push_back(i);
            }
        } else if (are_connected({i}, {a.back()})) {
            a.push_back(i);
        } else if (are_connected({i}, {b.back()})) {
            s.insert(minmax(i, a.back()));
            b.push_back(i);
        } else {
            s.insert(minmax(i, a.back()));
            s.insert(minmax(i, b.back()));
            a.insert(a.end(), b.rbegin(), b.rend());
            b = {i};
        }
    }
    if (!are_connected(a, b)) {
        return a.size() > b.size() ? a : b;
    }
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            if (are_connected({a.back()}, {b.front()})) {
                a.insert(a.end(), b.begin(), b.end());
                return a;
            }
            reverse(b.begin(), b.end());
        }
        reverse(a.begin(), a.end());
    }
    int i, lo, hi;
    lo = 0, hi = a.size() - 1;
    while (lo < hi) {
        int mi = (lo + hi) / 2;
        are_connected(vector(a.begin(), a.begin() + mi + 1), b) ? hi = mi : lo = mi + 1;
    }
    i = lo, lo = 0, hi = b.size() - 1;
    while (lo < hi) {
        int mi = (lo + hi) / 2;
        are_connected(vector(b.begin(), b.begin() + mi + 1), {a[i]}) ? hi = mi : lo = mi + 1;
    }
    vector<int> ans;
    ans.insert(ans.end(), a.begin() + i + 1, a.end());
    ans.insert(ans.end(), a.begin(), a.begin() + i + 1);
    ans.insert(ans.end(), b.begin() + lo, b.end());
    ans.insert(ans.end(), b.begin(), b.begin() + lo);
    return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 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 596 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 Correct 5 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 5 ms 436 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 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 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 584 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Correct 5 ms 356 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 6 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 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 5 ms 440 KB Output is correct
22 Correct 5 ms 600 KB Output is correct
23 Correct 5 ms 440 KB Output is correct
24 Correct 5 ms 448 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 7 ms 596 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 7 ms 428 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 6 ms 600 KB Output is correct
32 Correct 5 ms 436 KB Output is correct
33 Correct 5 ms 856 KB Output is correct
34 Correct 5 ms 344 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 5 ms 344 KB Output is correct
38 Correct 5 ms 600 KB Output is correct
39 Correct 5 ms 600 KB Output is correct
40 Correct 6 ms 600 KB Output is correct
41 Correct 6 ms 344 KB Output is correct
42 Correct 5 ms 344 KB Output is correct
43 Correct 5 ms 600 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Correct 11 ms 344 KB Output is correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 9 ms 596 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 5 ms 692 KB Output is correct
51 Correct 9 ms 440 KB Output is correct
52 Correct 7 ms 436 KB Output is correct
53 Correct 5 ms 692 KB Output is correct
54 Correct 5 ms 856 KB Output is correct
55 Correct 5 ms 600 KB Output is correct
56 Correct 5 ms 444 KB Output is correct
57 Correct 5 ms 700 KB Output is correct
58 Correct 6 ms 712 KB Output is correct
59 Correct 6 ms 872 KB Output is correct
60 Correct 6 ms 604 KB Output is correct
61 Correct 8 ms 612 KB Output is correct
62 Correct 7 ms 452 KB Output is correct
63 Correct 6 ms 444 KB Output is correct
64 Correct 7 ms 452 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 6 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 8 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 4 ms 600 KB Output is correct
10 Correct 4 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 600 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 8 ms 592 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 5 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 7 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 4 ms 344 KB Output is correct
27 Correct 6 ms 432 KB Output is correct
28 Correct 5 ms 436 KB Output is correct
29 Correct 5 ms 432 KB Output is correct
30 Correct 4 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 10 ms 344 KB Output is correct
33 Correct 10 ms 344 KB Output is correct
34 Correct 9 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 5 ms 436 KB Output is correct
38 Correct 6 ms 436 KB Output is correct
39 Correct 7 ms 436 KB Output is correct
40 Correct 5 ms 600 KB Output is correct
41 Correct 6 ms 600 KB Output is correct
42 Correct 6 ms 344 KB Output is correct
43 Correct 5 ms 696 KB Output is correct
44 Correct 5 ms 604 KB Output is correct
45 Correct 5 ms 436 KB Output is correct
46 Correct 5 ms 444 KB Output is correct
47 Correct 5 ms 344 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 5 ms 436 KB Output is correct
50 Correct 6 ms 348 KB Output is correct
51 Correct 5 ms 600 KB Output is correct
52 Correct 6 ms 344 KB Output is correct
53 Correct 5 ms 344 KB Output is correct
54 Correct 6 ms 600 KB Output is correct
55 Correct 5 ms 344 KB Output is correct
56 Correct 4 ms 344 KB Output is correct
57 Correct 5 ms 436 KB Output is correct
58 Correct 5 ms 444 KB Output is correct
59 Correct 6 ms 344 KB Output is correct
60 Correct 6 ms 344 KB Output is correct
61 Correct 5 ms 344 KB Output is correct
62 Correct 5 ms 608 KB Output is correct
63 Correct 7 ms 700 KB Output is correct
64 Correct 6 ms 456 KB Output is correct
65 Correct 6 ms 700 KB Output is correct
66 Correct 6 ms 448 KB Output is correct
67 Correct 6 ms 700 KB Output is correct
68 Correct 6 ms 704 KB Output is correct
69 Correct 7 ms 604 KB Output is correct
70 Correct 6 ms 608 KB Output is correct
71 Correct 6 ms 692 KB Output is correct
72 Correct 6 ms 704 KB Output is correct
73 Correct 6 ms 452 KB Output is correct
74 Correct 8 ms 704 KB Output is correct
75 Correct 8 ms 604 KB Output is correct
76 Correct 6 ms 856 KB Output is correct
77 Correct 5 ms 700 KB Output is correct
78 Correct 8 ms 700 KB Output is correct
79 Correct 7 ms 952 KB Output is correct
80 Correct 7 ms 700 KB Output is correct
81 Correct 7 ms 700 KB Output is correct
82 Correct 7 ms 700 KB Output is correct