답안 #971990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971990 2024-04-29T16:24:15 Z thinknoexit 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
15 ms 1108 KB
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
using ll = long long;
int n;
vector<int> longest_trip(int N, int D) {
    n = N;
    vector<int> p1, p2;
    p1.push_back(0);
    for (int i = 1;i < n;i++) {
        if (p2.empty()) {
            if (are_connected({ p1.back() }, { i })) p1.push_back(i);
            else p2.push_back(i);
        }
        else {
            if (are_connected({ p1.back() }, { p2.back(), i })) {
                p1.push_back(i);
                if (are_connected({ p1.back() }, { p2.back() })) {
                    reverse(p2.begin(), p2.end());
                    for (auto& x : p2) p1.push_back(x);
                    p2.clear();
                }
            }
            else {
                p2.push_back(i);
            }
        }
    }
    if (p1.size() > p2.size()) swap(p1, p2);
    if ((int)p2.size() == n) return p2;
    int l = 0, r = p1.size();
    while (l < r) {
        int mid = (l + r) / 2;
        vector<int> t;
        for (int j = 0;j <= mid;j++) t.push_back(p1[j]);
        if (are_connected(t, p2)) r = mid;
        else l = mid + 1;
    }
    if (l == (int)p1.size()) return p2;
    if (are_connected({ p1.back() }, p2)) {
        reverse(p1.begin(), p1.end());
    }
    else {
        vector<int> p3;
        for (int i = 0;i < (int)p1.size();i++) {
            p3.push_back(p1[(i + l) % ((int)p1.size())]);
        }
        swap(p1, p3);
    }
    l = 0, r = p2.size() - 2;
    while (l < r) {
        int mid = (l + r) / 2;
        vector<int> t;
        for (int j = 0;j <= mid;j++) t.push_back(p2[j]);
        if (are_connected(t, { p1.front() })) r = mid;
        else l = mid + 1;
    }
    if (are_connected({ p1.front() }, { p2.back() })) {
        vector<int> ans;
        for (auto& x : p2) ans.push_back(x);
        for (auto& x : p1) ans.push_back(x);
        return ans;
    }
    else {
        vector<int> p3;
        for (int i = 0;i < (int)p2.size();i++) {
            p3.push_back(p2[(i + l) % ((int)p2.size())]);
        }
        swap(p2, p3);
    }
    reverse(p2.begin(), p2.end());
    vector<int> ans;
    for (auto& x : p2) ans.push_back(x);
    for (auto& x : p1) ans.push_back(x);
    return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 5 ms 344 KB Output is correct
5 Correct 7 ms 600 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 6 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 6 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 5 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 4 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 500 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 6 ms 436 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 9 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 5 ms 344 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 6 ms 600 KB Output is correct
23 Correct 6 ms 340 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 6 ms 596 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 7 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 8 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 7 ms 344 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 7 ms 600 KB Output is correct
37 Correct 10 ms 344 KB Output is correct
38 Correct 9 ms 600 KB Output is correct
39 Correct 9 ms 608 KB Output is correct
40 Correct 8 ms 600 KB Output is correct
41 Correct 7 ms 344 KB Output is correct
42 Correct 8 ms 344 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 9 ms 600 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 8 ms 344 KB Output is correct
50 Correct 6 ms 600 KB Output is correct
51 Correct 8 ms 432 KB Output is correct
52 Correct 8 ms 344 KB Output is correct
53 Correct 6 ms 340 KB Output is correct
54 Correct 9 ms 412 KB Output is correct
55 Correct 8 ms 600 KB Output is correct
56 Correct 6 ms 848 KB Output is correct
57 Correct 7 ms 600 KB Output is correct
58 Correct 7 ms 696 KB Output is correct
59 Correct 8 ms 444 KB Output is correct
60 Correct 9 ms 856 KB Output is correct
61 Correct 9 ms 600 KB Output is correct
62 Correct 8 ms 600 KB Output is correct
63 Correct 7 ms 600 KB Output is correct
64 Correct 9 ms 600 KB Output is correct
# 결과 실행 시간 메모리 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 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 9 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 600 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 7 ms 600 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 344 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 5 ms 608 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 8 ms 344 KB Output is correct
28 Correct 9 ms 540 KB Output is correct
29 Correct 8 ms 344 KB Output is correct
30 Correct 7 ms 344 KB Output is correct
31 Correct 7 ms 600 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 9 ms 344 KB Output is correct
35 Correct 10 ms 344 KB Output is correct
36 Correct 15 ms 344 KB Output is correct
37 Correct 7 ms 432 KB Output is correct
38 Correct 10 ms 600 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 9 ms 440 KB Output is correct
42 Correct 8 ms 344 KB Output is correct
43 Correct 8 ms 344 KB Output is correct
44 Correct 5 ms 600 KB Output is correct
45 Correct 5 ms 596 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Partially correct 7 ms 344 KB Output is partially correct
48 Partially correct 9 ms 432 KB Output is partially correct
49 Partially correct 9 ms 600 KB Output is partially correct
50 Partially correct 8 ms 344 KB Output is partially correct
51 Partially correct 7 ms 344 KB Output is partially correct
52 Correct 8 ms 344 KB Output is correct
53 Correct 7 ms 584 KB Output is correct
54 Correct 10 ms 596 KB Output is correct
55 Correct 7 ms 344 KB Output is correct
56 Partially correct 10 ms 344 KB Output is partially correct
57 Partially correct 7 ms 436 KB Output is partially correct
58 Partially correct 7 ms 608 KB Output is partially correct
59 Partially correct 7 ms 344 KB Output is partially correct
60 Correct 7 ms 600 KB Output is correct
61 Correct 8 ms 600 KB Output is correct
62 Correct 7 ms 860 KB Output is correct
63 Partially correct 7 ms 696 KB Output is partially correct
64 Partially correct 7 ms 696 KB Output is partially correct
65 Partially correct 10 ms 608 KB Output is partially correct
66 Partially correct 7 ms 1108 KB Output is partially correct
67 Correct 7 ms 432 KB Output is correct
68 Correct 8 ms 600 KB Output is correct
69 Correct 8 ms 640 KB Output is correct
70 Correct 7 ms 600 KB Output is correct
71 Partially correct 11 ms 444 KB Output is partially correct
72 Partially correct 9 ms 444 KB Output is partially correct
73 Partially correct 8 ms 604 KB Output is partially correct
74 Partially correct 9 ms 612 KB Output is partially correct
75 Correct 8 ms 600 KB Output is correct
76 Correct 8 ms 600 KB Output is correct
77 Partially correct 11 ms 696 KB Output is partially correct
78 Partially correct 8 ms 604 KB Output is partially correct
79 Partially correct 8 ms 440 KB Output is partially correct
80 Partially correct 10 ms 696 KB Output is partially correct
81 Correct 9 ms 604 KB Output is correct
82 Correct 8 ms 852 KB Output is correct