oj.uz

답안 #1070622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070622 2024-08-22T16:11:29 Z Plurm 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 17 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) {
        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:164:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  164 |         for (int i = 0; i < comp[0].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~
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[1].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 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 6 ms 344 KB Output is correct
5 Correct 8 ms 600 KB Output is correct
6 Correct 12 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 7 ms 600 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 9 ms 600 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 7 ms 600 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 7 ms 600 KB Output is correct
11 Correct 7 ms 600 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 7 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 8 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 10 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 8 ms 600 KB Output is correct
22 Correct 10 ms 600 KB Output is correct
23 Correct 8 ms 600 KB Output is correct
24 Correct 9 ms 600 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 12 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 8 ms 344 KB Output is correct
30 Correct 10 ms 344 KB Output is correct
31 Correct 12 ms 476 KB Output is correct
32 Correct 9 ms 344 KB Output is correct
33 Correct 6 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 10 ms 344 KB Output is correct
36 Correct 7 ms 600 KB Output is correct
37 Correct 12 ms 612 KB Output is correct
38 Correct 12 ms 600 KB Output is correct
39 Correct 11 ms 600 KB Output is correct
40 Correct 12 ms 600 KB Output is correct
41 Correct 11 ms 600 KB Output is correct
42 Correct 11 ms 600 KB Output is correct
43 Correct 11 ms 600 KB Output is correct
44 Correct 10 ms 600 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 9 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 9 ms 344 KB Output is correct
51 Correct 9 ms 344 KB Output is correct
52 Correct 14 ms 344 KB Output is correct
53 Correct 10 ms 344 KB Output is correct
54 Correct 9 ms 344 KB Output is correct
55 Correct 10 ms 344 KB Output is correct
56 Correct 9 ms 600 KB Output is correct
57 Correct 11 ms 600 KB Output is correct
58 Correct 13 ms 600 KB Output is correct
59 Correct 14 ms 600 KB Output is correct
60 Correct 11 ms 600 KB Output is correct
61 Correct 14 ms 600 KB Output is correct
62 Correct 10 ms 608 KB Output is correct
63 Correct 11 ms 600 KB Output is correct
64 Correct 10 ms 608 KB Output is correct

Subtask #4
45.0 / 60.0

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