oj.uz

답안 #1070625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070625 2024-08-22T16:13:12 Z Plurm 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 118 ms 856 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

int dc_left(vector<int> a, vector<int> b) {
    if (a.size() == 1)
        return a.back();
    vector<int> left(a.begin(), a.begin() + a.size() / 2);
    vector<int> right(a.begin() + a.size() / 2, a.end());
    if (are_connected(left, b))
        return dc_left(left, b);
    else
        return dc_left(right, b);
}

int dc_right(vector<int> a, vector<int> b) {
    if (b.size() == 1)
        return b.back();
    vector<int> left(b.begin(), b.begin() + b.size() / 2);
    vector<int> right(b.begin() + b.size() / 2, b.end());
    if (are_connected(a, left))
        return dc_right(a, left);
    else
        return dc_right(a, right);
}

void join(vector<deque<int>> &comp, int u, int v) {
    int a = -1;
    int b = -1;
    for (int i = 0; i < comp.size(); i++) {
        if (!comp[i].empty()) {
            if (comp[i].front() == u) {
                reverse(comp[i].begin(), comp[i].end());
                a = i;
            } else if (comp[i].back() == u) {
                a = i;
            }
            if (comp[i].front() == v) {
                b = i;
            } else if (comp[i].back() == v) {
                reverse(comp[i].begin(), comp[i].end());
                b = i;
            }
        }
    }
    comp[a].insert(comp[a].end(), comp[b].begin(), comp[b].end());
    comp.erase(comp.begin() + b);
}

vector<int> longest_trip(int N, int D) {
    vector<deque<int>> comp(N);
    for (int i = 0; i < N; i++)
        comp[i].push_back(i);
    set<pair<int, int>> known;
    while (comp.size() > 2) {
        sort(comp.begin(), comp.end(),
             [](auto a, auto b) { return a.size() < b.size(); });
        int i = 0;
        int j = 1;
        int k = 2;
        int u = comp[i].back();
        int v = comp[j].back();
        int w = comp[k].back();
        int vv = comp[j].front();
        int ww = comp[k].front();
        if (known.count(minmax(u, v)) + known.count(minmax(v, w)) +
                known.count(minmax(u, w)) ==
            2) {
            if (!known.count(minmax(u, v)))
                join(comp, u, v);
            else if (!known.count(minmax(u, w)))
                join(comp, u, w);
            else
                join(comp, v, w);
            continue;
        }
        swap(v, vv);
        if (known.count(minmax(u, v)) + known.count(minmax(v, w)) +
                known.count(minmax(u, w)) ==
            2) {
            if (!known.count(minmax(u, v)))
                join(comp, u, v);
            else if (!known.count(minmax(u, w)))
                join(comp, u, w);
            else
                join(comp, v, w);
            continue;
        }
        swap(w, ww);
        if (known.count(minmax(u, v)) + known.count(minmax(v, w)) +
                known.count(minmax(u, w)) ==
            2) {
            if (!known.count(minmax(u, v)))
                join(comp, u, v);
            else if (!known.count(minmax(u, w)))
                join(comp, u, w);
            else
                join(comp, v, w);
            continue;
        }
        swap(v, vv);
        if (known.count(minmax(u, v)) + known.count(minmax(v, w)) +
                known.count(minmax(u, w)) ==
            2) {
            if (!known.count(minmax(u, v)))
                join(comp, u, v);
            else if (!known.count(minmax(u, w)))
                join(comp, u, w);
            else
                join(comp, v, w);
            continue;
        }
        swap(w, ww);
        if (!known.count(minmax(u, v)) && are_connected({u}, {v})) {
            join(comp, u, v);
        } else if (!known.count(minmax(vv, ww)) && are_connected({vv}, {ww})) {
            known.insert(minmax(u, v));
            join(comp, ww, vv);
        } else {
            known.insert(minmax(u, v));
            known.insert(minmax(vv, ww));
            if (known.count(minmax(u, v)) + known.count(minmax(v, w)) +
                    known.count(minmax(u, w)) ==
                2) {
                if (!known.count(minmax(u, v)))
                    join(comp, u, v);
                else if (!known.count(minmax(u, w)))
                    join(comp, u, w);
                else
                    join(comp, v, w);
                continue;
            }
            if (!known.count(minmax(u, w)) && are_connected({u}, {w})) {
                reverse(comp[j].begin(), comp[j].end());
                join(comp, u, w);
            } else {
                known.insert(minmax(u, w));
                join(comp, v, w);
            }
        }
    }
    if (comp[0].size() < comp[1].size()) {
        swap(comp[0], comp[1]);
    }
    if (are_connected({comp[0].back()}, {comp[1].back()})) {
        reverse(comp[1].begin(), comp[1].end());
        comp[0].insert(comp[0].end(), comp[1].begin(), comp[1].end());
    } else if (are_connected({comp[0].back()}, {comp[1].front()})) {
        comp[0].insert(comp[0].end(), comp[1].begin(), comp[1].end());
    } else if (are_connected({comp[0].front()}, {comp[1].front()})) {
        reverse(comp[0].begin(), comp[0].end());
        comp[0].insert(comp[0].end(), comp[1].begin(), comp[1].end());
    } else if (are_connected({comp[0].front()}, {comp[1].back()})) {
        reverse(comp[0].begin(), comp[0].end());
        reverse(comp[1].begin(), comp[1].end());
        comp[0].insert(comp[0].end(), comp[1].begin(), comp[1].end());
    } else if (are_connected(vector<int>(comp[0].begin(), comp[0].end()),
                             vector<int>(comp[1].begin(), comp[1].end()))) {
        // two cycles, connected
        int l = dc_left(vector<int>(comp[0].begin(), comp[0].end()),
                        vector<int>(comp[1].begin(), comp[1].end()));
        int r = dc_right({l}, vector<int>(comp[1].begin(), comp[1].end()));
        int l_idx = find(comp[0].begin(), comp[0].end(), l) - comp[0].begin();
        int r_idx = find(comp[1].begin(), comp[1].end(), r) - comp[1].begin();
        vector<int> ret;
        for (int i = 0; i < comp[0].size(); i++)
            ret.push_back(comp[0][(l_idx + 1 + i) % comp[0].size()]);
        for (int i = 0; i < comp[1].size(); i++)
            ret.push_back(comp[1][(r_idx + i) % comp[1].size()]);
        return ret;
    }
    return vector<int>(comp[0].begin(), comp[0].end());
}

Compilation message

longesttrip.cpp: In function 'void join(std::vector<std::deque<int> >&, int, int)':
longesttrip.cpp:30:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::deque<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for (int i = 0; i < comp.size(); i++) {
      |                     ~~^~~~~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:166:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |         for (int i = 0; i < comp[0].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~
longesttrip.cpp:168:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |         for (int i = 0; i < comp[1].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 14 ms 344 KB Output is correct
4 Correct 46 ms 344 KB Output is correct
5 Correct 87 ms 608 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 13 ms 344 KB Output is correct
4 Correct 35 ms 344 KB Output is correct
5 Correct 92 ms 600 KB Output is correct
6 Correct 12 ms 344 KB Output is correct
7 Correct 11 ms 344 KB Output is correct
8 Correct 20 ms 344 KB Output is correct
9 Correct 41 ms 508 KB Output is correct
10 Correct 84 ms 600 KB Output is correct
11 Correct 81 ms 596 KB Output is correct
12 Correct 74 ms 600 KB Output is correct
13 Correct 76 ms 600 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 13 ms 340 KB Output is correct
4 Correct 45 ms 344 KB Output is correct
5 Correct 95 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 14 ms 344 KB Output is correct
9 Correct 45 ms 344 KB Output is correct
10 Correct 82 ms 600 KB Output is correct
11 Correct 74 ms 856 KB Output is correct
12 Correct 105 ms 600 KB Output is correct
13 Correct 70 ms 600 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 12 ms 448 KB Output is correct
18 Correct 17 ms 344 KB Output is correct
19 Correct 37 ms 344 KB Output is correct
20 Correct 28 ms 344 KB Output is correct
21 Correct 118 ms 600 KB Output is correct
22 Correct 80 ms 604 KB Output is correct
23 Correct 88 ms 844 KB Output is correct
24 Correct 85 ms 600 KB Output is correct
25 Correct 12 ms 344 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 10 ms 344 KB Output is correct
28 Correct 14 ms 344 KB Output is correct
29 Correct 17 ms 344 KB Output is correct
30 Correct 23 ms 344 KB Output is correct
31 Correct 30 ms 344 KB Output is correct
32 Correct 20 ms 344 KB Output is correct
33 Correct 38 ms 512 KB Output is correct
34 Correct 35 ms 512 KB Output is correct
35 Correct 28 ms 344 KB Output is correct
36 Correct 72 ms 600 KB Output is correct
37 Correct 73 ms 600 KB Output is correct
38 Correct 86 ms 600 KB Output is correct
39 Correct 76 ms 600 KB Output is correct
40 Correct 79 ms 600 KB Output is correct
41 Correct 92 ms 608 KB Output is correct
42 Correct 79 ms 600 KB Output is correct
43 Correct 77 ms 600 KB Output is correct
44 Correct 117 ms 600 KB Output is correct
45 Correct 9 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 13 ms 344 KB Output is correct
48 Correct 10 ms 344 KB Output is correct
49 Correct 9 ms 344 KB Output is correct
50 Correct 19 ms 484 KB Output is correct
51 Correct 36 ms 344 KB Output is correct
52 Correct 21 ms 344 KB Output is correct
53 Correct 27 ms 344 KB Output is correct
54 Correct 32 ms 340 KB Output is correct
55 Correct 49 ms 508 KB Output is correct
56 Correct 87 ms 600 KB Output is correct
57 Correct 95 ms 600 KB Output is correct
58 Correct 87 ms 600 KB Output is correct
59 Correct 76 ms 600 KB Output is correct
60 Correct 75 ms 600 KB Output is correct
61 Correct 77 ms 600 KB Output is correct
62 Correct 76 ms 600 KB Output is correct
63 Correct 91 ms 608 KB Output is correct
64 Correct 77 ms 600 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 13 ms 344 KB Output is correct
4 Correct 32 ms 344 KB Output is correct
5 Correct 70 ms 600 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 14 ms 344 KB Output is correct
9 Correct 27 ms 344 KB Output is correct
10 Correct 73 ms 600 KB Output is correct
11 Correct 96 ms 600 KB Output is correct
12 Correct 70 ms 600 KB Output is correct
13 Correct 77 ms 600 KB Output is correct
14 Correct 13 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 14 ms 344 KB Output is correct
17 Correct 11 ms 600 KB Output is correct
18 Correct 16 ms 344 KB Output is correct
19 Correct 42 ms 344 KB Output is correct
20 Correct 28 ms 344 KB Output is correct
21 Correct 12 ms 344 KB Output is correct
22 Correct 13 ms 344 KB Output is correct
23 Correct 10 ms 344 KB Output is correct
24 Correct 10 ms 344 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 18 ms 484 KB Output is correct
27 Correct 21 ms 344 KB Output is correct
28 Correct 21 ms 344 KB Output is correct
29 Correct 39 ms 600 KB Output is correct
30 Correct 28 ms 344 KB Output is correct
31 Correct 28 ms 504 KB Output is correct
32 Correct 12 ms 344 KB Output is correct
33 Correct 11 ms 344 KB Output is correct
34 Correct 13 ms 344 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 10 ms 344 KB Output is correct
37 Correct 20 ms 344 KB Output is correct
38 Correct 23 ms 344 KB Output is correct
39 Correct 32 ms 344 KB Output is correct
40 Correct 27 ms 344 KB Output is correct
41 Correct 33 ms 344 KB Output is correct
42 Correct 28 ms 344 KB Output is correct
43 Correct 72 ms 600 KB Output is correct
44 Correct 76 ms 612 KB Output is correct
45 Correct 98 ms 600 KB Output is correct
46 Correct 74 ms 600 KB Output is correct
47 Correct 72 ms 600 KB Output is correct
48 Correct 81 ms 856 KB Output is correct
49 Correct 75 ms 600 KB Output is correct
50 Partially correct 79 ms 600 KB Output is partially correct
51 Partially correct 91 ms 600 KB Output is partially correct
52 Partially correct 75 ms 600 KB Output is partially correct
53 Partially correct 100 ms 848 KB Output is partially correct
54 Partially correct 84 ms 596 KB Output is partially correct
55 Partially correct 116 ms 596 KB Output is partially correct
56 Correct 99 ms 600 KB Output is correct
57 Correct 82 ms 600 KB Output is correct
58 Partially correct 78 ms 600 KB Output is partially correct
59 Partially correct 75 ms 600 KB Output is partially correct
60 Partially correct 96 ms 600 KB Output is partially correct
61 Partially correct 81 ms 600 KB Output is partially correct
62 Correct 77 ms 600 KB Output is correct
63 Correct 74 ms 600 KB Output is correct
64 Correct 92 ms 600 KB Output is correct
65 Partially correct 94 ms 600 KB Output is partially correct
66 Partially correct 88 ms 848 KB Output is partially correct
67 Partially correct 82 ms 612 KB Output is partially correct
68 Partially correct 77 ms 600 KB Output is partially correct
69 Partially correct 76 ms 600 KB Output is partially correct
70 Partially correct 81 ms 600 KB Output is partially correct
71 Correct 74 ms 600 KB Output is correct
72 Correct 76 ms 852 KB Output is correct
73 Partially correct 75 ms 600 KB Output is partially correct
74 Partially correct 80 ms 600 KB Output is partially correct
75 Partially correct 75 ms 600 KB Output is partially correct
76 Partially correct 95 ms 600 KB Output is partially correct
77 Correct 74 ms 600 KB Output is correct
78 Correct 75 ms 848 KB Output is correct
79 Partially correct 75 ms 600 KB Output is partially correct
80 Partially correct 97 ms 600 KB Output is partially correct
81 Partially correct 78 ms 600 KB Output is partially correct
82 Partially correct 75 ms 600 KB Output is partially correct