oj.uz

답안 #903975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
903975 2024-01-11T15:51:26 Z LaviniaTornaghi 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 16 ms 1624 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;

struct XorList {
    struct Node {
        int val;
        Node *x, *y;

        Node(int val) : val(val), x(NULL), y(NULL) { }
    } *start, *end;

    void merge(XorList *o) {
        if (end->x == NULL) {
            end->x = o->start;
        } else {
            end->y = o->start;
        }

        if (o->start->x == NULL) {
            o->start->x = end;
        } else {
            o->start->y = end;
        }

        end = o->end;
        o->start = o->end = NULL;
    }

    vector<int> vectorize() {
        vector<int> ans;
        
        Node* curr = start, *old = NULL;
        while (curr != NULL) {
            ans.push_back(curr->val);

            if (old == curr->x) {
                old = curr;
                curr = old->y;
            } else {
                old = curr;
                curr = old->x;
            }
        }
        return ans;
    }

    int first() { return start->val; }
    int last() { return end->val; }
    void reverse() { swap(start, end); }
    XorList(int val) { start = end = new Node(val); }
};

vector<int> longest_trip(int N, int D) {
    XorList *a = new XorList(0);
    XorList *b = new XorList(1);
    
    for (int i = 2; i < N; i++) {
        int last_a = a->last();
        int last_b = b->last();
        XorList *m = new XorList(i);

        if (are_connected({last_a}, {last_b})) {
            b->reverse();
            a->merge(b);

            b = m;
        } else if (are_connected({last_a}, {i})) {
            a->merge(m);
        } else {
            b->merge(m);
        }
    }

    if (are_connected({a->first()}, {b->first()})) {
        a->reverse();
        a->merge(b);
        return a->vectorize();
    }

    if (are_connected({a->first()}, {b->last()})) {
        a->reverse();
        b->reverse();
        a->merge(b);
        return a->vectorize();
    }

    if (are_connected({a->last()}, {b->first()})) {
        a->merge(b);
        return a->vectorize();
    }

    if (are_connected({a->last()}, {b->last()})) {
        b->reverse();
        a->merge(b);
        return a->vectorize();
    }

    vector<int> chain_a = a->vectorize();
    vector<int> chain_b = b->vectorize();

    if (!are_connected(chain_a, chain_b)) {
        return chain_a.size() > chain_b.size() ? chain_a : chain_b;
    }

    int l1 = 0, r1 = chain_a.size();
    while (l1 + 1 < r1) {
        int m = (l1 + r1) / 2;
        if (are_connected(vector<int>(chain_a.begin() + m, chain_a.end()), chain_b)) {
            l1 = m;
        } else {
            r1 = m;
        }
    }

    int l2 = 0, r2 = chain_b.size();
    while (l2 + 1 < r2) {
        int m = (l2 + r2) / 2;
        if (are_connected(vector<int>(chain_b.begin() + m, chain_b.end()), {chain_a[l1]})) {
            l2 = m;
        } else {
            r2 = m;
        }
    }

    rotate(chain_a.begin(), chain_a.begin() + l1 + 1, chain_a.end());
    rotate(chain_b.begin(), chain_b.begin() + l2, chain_b.end());
    copy(chain_b.begin(), chain_b.end(), back_inserter(chain_a));

    return chain_a;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 600 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1212 KB Output is correct
2 Correct 7 ms 1240 KB Output is correct
3 Correct 7 ms 1132 KB Output is correct
4 Correct 6 ms 1112 KB Output is correct
5 Correct 6 ms 740 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1132 KB Output is correct
2 Correct 5 ms 600 KB Output is correct
3 Correct 5 ms 752 KB Output is correct
4 Correct 8 ms 980 KB Output is correct
5 Correct 6 ms 1272 KB Output is correct
6 Correct 8 ms 624 KB Output is correct
7 Correct 9 ms 1212 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 6 ms 644 KB Output is correct
10 Correct 6 ms 712 KB Output is correct
11 Correct 6 ms 1212 KB Output is correct
12 Correct 6 ms 1112 KB Output is correct
13 Correct 6 ms 1392 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 868 KB Output is correct
2 Correct 6 ms 1116 KB Output is correct
3 Correct 7 ms 1112 KB Output is correct
4 Correct 6 ms 700 KB Output is correct
5 Correct 6 ms 1240 KB Output is correct
6 Correct 11 ms 1216 KB Output is correct
7 Correct 7 ms 964 KB Output is correct
8 Correct 6 ms 1112 KB Output is correct
9 Correct 6 ms 1480 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 5 ms 992 KB Output is correct
12 Correct 6 ms 992 KB Output is correct
13 Correct 6 ms 736 KB Output is correct
14 Correct 13 ms 760 KB Output is correct
15 Correct 11 ms 964 KB Output is correct
16 Correct 8 ms 856 KB Output is correct
17 Correct 9 ms 1372 KB Output is correct
18 Correct 7 ms 1368 KB Output is correct
19 Correct 7 ms 872 KB Output is correct
20 Correct 6 ms 856 KB Output is correct
21 Correct 6 ms 1228 KB Output is correct
22 Correct 5 ms 876 KB Output is correct
23 Correct 6 ms 740 KB Output is correct
24 Correct 6 ms 968 KB Output is correct
25 Correct 12 ms 1480 KB Output is correct
26 Correct 16 ms 736 KB Output is correct
27 Correct 9 ms 1368 KB Output is correct
28 Correct 12 ms 968 KB Output is correct
29 Correct 10 ms 856 KB Output is correct
30 Correct 9 ms 972 KB Output is correct
31 Correct 11 ms 968 KB Output is correct
32 Correct 9 ms 976 KB Output is correct
33 Correct 9 ms 1136 KB Output is correct
34 Correct 9 ms 1488 KB Output is correct
35 Correct 9 ms 1128 KB Output is correct
36 Correct 8 ms 984 KB Output is correct
37 Correct 9 ms 600 KB Output is correct
38 Correct 10 ms 876 KB Output is correct
39 Correct 10 ms 980 KB Output is correct
40 Correct 9 ms 864 KB Output is correct
41 Correct 10 ms 1140 KB Output is correct
42 Correct 10 ms 1468 KB Output is correct
43 Correct 9 ms 720 KB Output is correct
44 Correct 8 ms 868 KB Output is correct
45 Correct 9 ms 1112 KB Output is correct
46 Correct 8 ms 1204 KB Output is correct
47 Correct 8 ms 1112 KB Output is correct
48 Correct 7 ms 1624 KB Output is correct
49 Correct 8 ms 856 KB Output is correct
50 Correct 6 ms 944 KB Output is correct
51 Correct 10 ms 952 KB Output is correct
52 Correct 12 ms 972 KB Output is correct
53 Correct 7 ms 1364 KB Output is correct
54 Correct 9 ms 1388 KB Output is correct
55 Correct 9 ms 1220 KB Output is correct
56 Correct 6 ms 976 KB Output is correct
57 Correct 9 ms 1116 KB Output is correct
58 Correct 10 ms 976 KB Output is correct
59 Correct 13 ms 872 KB Output is correct
60 Correct 12 ms 1496 KB Output is correct
61 Correct 10 ms 1136 KB Output is correct
62 Correct 11 ms 1256 KB Output is correct
63 Correct 10 ms 992 KB Output is correct
64 Correct 11 ms 964 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1112 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 5 ms 1212 KB Output is correct
4 Correct 4 ms 600 KB Output is correct
5 Correct 6 ms 1472 KB Output is correct
6 Correct 9 ms 864 KB Output is correct
7 Correct 6 ms 600 KB Output is correct
8 Correct 4 ms 620 KB Output is correct
9 Correct 4 ms 1112 KB Output is correct
10 Correct 5 ms 1128 KB Output is correct
11 Correct 6 ms 968 KB Output is correct
12 Correct 5 ms 968 KB Output is correct
13 Correct 4 ms 964 KB Output is correct
14 Correct 14 ms 980 KB Output is correct
15 Correct 12 ms 968 KB Output is correct
16 Correct 10 ms 972 KB Output is correct
17 Correct 8 ms 856 KB Output is correct
18 Correct 7 ms 1368 KB Output is correct
19 Correct 6 ms 1108 KB Output is correct
20 Correct 6 ms 1220 KB Output is correct
21 Correct 16 ms 872 KB Output is correct
22 Correct 13 ms 864 KB Output is correct
23 Correct 12 ms 964 KB Output is correct
24 Correct 8 ms 600 KB Output is correct
25 Correct 11 ms 600 KB Output is correct
26 Correct 7 ms 1212 KB Output is correct
27 Correct 9 ms 724 KB Output is correct
28 Correct 9 ms 1476 KB Output is correct
29 Correct 10 ms 1124 KB Output is correct
30 Correct 8 ms 856 KB Output is correct
31 Correct 9 ms 1232 KB Output is correct
32 Correct 8 ms 1376 KB Output is correct
33 Correct 13 ms 1120 KB Output is correct
34 Correct 8 ms 880 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 13 ms 856 KB Output is correct
37 Correct 8 ms 688 KB Output is correct
38 Correct 11 ms 1204 KB Output is correct
39 Correct 11 ms 976 KB Output is correct
40 Correct 9 ms 1368 KB Output is correct
41 Correct 10 ms 1120 KB Output is correct
42 Correct 8 ms 872 KB Output is correct
43 Correct 7 ms 940 KB Output is correct
44 Correct 6 ms 1000 KB Output is correct
45 Correct 6 ms 1236 KB Output is correct
46 Correct 7 ms 952 KB Output is correct
47 Partially correct 9 ms 1452 KB Output is partially correct
48 Partially correct 10 ms 1236 KB Output is partially correct
49 Partially correct 10 ms 876 KB Output is partially correct
50 Partially correct 12 ms 972 KB Output is partially correct
51 Partially correct 9 ms 1140 KB Output is partially correct
52 Partially correct 10 ms 992 KB Output is partially correct
53 Partially correct 9 ms 716 KB Output is partially correct
54 Partially correct 8 ms 1124 KB Output is partially correct
55 Partially correct 8 ms 964 KB Output is partially correct
56 Partially correct 11 ms 708 KB Output is partially correct
57 Partially correct 11 ms 976 KB Output is partially correct
58 Partially correct 9 ms 868 KB Output is partially correct
59 Partially correct 8 ms 472 KB Output is partially correct
60 Partially correct 9 ms 1152 KB Output is partially correct
61 Partially correct 10 ms 1380 KB Output is partially correct
62 Correct 7 ms 1224 KB Output is correct
63 Partially correct 9 ms 972 KB Output is partially correct
64 Partially correct 9 ms 616 KB Output is partially correct
65 Partially correct 11 ms 968 KB Output is partially correct
66 Partially correct 11 ms 1220 KB Output is partially correct
67 Partially correct 9 ms 976 KB Output is partially correct
68 Partially correct 11 ms 888 KB Output is partially correct
69 Partially correct 10 ms 984 KB Output is partially correct
70 Partially correct 13 ms 744 KB Output is partially correct
71 Partially correct 9 ms 728 KB Output is partially correct
72 Partially correct 9 ms 892 KB Output is partially correct
73 Partially correct 10 ms 872 KB Output is partially correct
74 Partially correct 15 ms 620 KB Output is partially correct
75 Partially correct 13 ms 1248 KB Output is partially correct
76 Partially correct 12 ms 860 KB Output is partially correct
77 Partially correct 9 ms 608 KB Output is partially correct
78 Partially correct 10 ms 972 KB Output is partially correct
79 Partially correct 10 ms 1008 KB Output is partially correct
80 Partially correct 13 ms 748 KB Output is partially correct
81 Partially correct 9 ms 1124 KB Output is partially correct
82 Partially correct 9 ms 1396 KB Output is partially correct