oj.uz

답안 #1070388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070388 2024-08-22T13:51:00 Z Plurm 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 129 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);
}

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);
    while (comp.size() > 2) {
        sort(comp.begin(), comp.end(),
             [](auto x, auto y) { return x.size() < y.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();
        if (are_connected({v}, {w})) {
            swap(u, w);
            swap(i, k);
        } else if (are_connected({u}, {w})) {
            swap(v, w);
            swap(j, k);
        }
        reverse(comp[j].begin(), comp[j].end());
        comp[i].insert(comp[i].end(), comp[j].begin(), comp[j].end());
        comp.erase(comp.begin() + j);
    }
    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 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:75:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |         for (int i = 0; i < comp[0].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~
longesttrip.cpp:77:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         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 28 ms 600 KB Output is correct

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 23 ms 344 KB Output is correct
4 Correct 37 ms 344 KB Output is correct
5 Correct 74 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 18 ms 344 KB Output is correct
9 Correct 26 ms 344 KB Output is correct
10 Correct 92 ms 600 KB Output is correct
11 Correct 96 ms 600 KB Output is correct
12 Correct 105 ms 608 KB Output is correct
13 Correct 71 ms 600 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 10 ms 340 KB Output is correct
3 Correct 24 ms 344 KB Output is correct
4 Correct 56 ms 344 KB Output is correct
5 Correct 69 ms 600 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 21 ms 344 KB Output is correct
9 Correct 37 ms 344 KB Output is correct
10 Correct 69 ms 600 KB Output is correct
11 Correct 86 ms 600 KB Output is correct
12 Correct 86 ms 344 KB Output is correct
13 Correct 92 ms 600 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 13 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 15 ms 456 KB Output is correct
18 Correct 18 ms 344 KB Output is correct
19 Correct 44 ms 504 KB Output is correct
20 Correct 29 ms 344 KB Output is correct
21 Correct 92 ms 600 KB Output is correct
22 Correct 97 ms 612 KB Output is correct
23 Correct 87 ms 600 KB Output is correct
24 Correct 81 ms 608 KB Output is correct
25 Correct 12 ms 344 KB Output is correct
26 Correct 14 ms 344 KB Output is correct
27 Correct 10 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 13 ms 344 KB Output is correct
30 Correct 29 ms 476 KB Output is correct
31 Correct 20 ms 344 KB Output is correct
32 Correct 19 ms 344 KB Output is correct
33 Correct 43 ms 504 KB Output is correct
34 Correct 50 ms 340 KB Output is correct
35 Correct 45 ms 344 KB Output is correct
36 Correct 120 ms 600 KB Output is correct
37 Correct 79 ms 600 KB Output is correct
38 Correct 96 ms 608 KB Output is correct
39 Correct 100 ms 600 KB Output is correct
40 Correct 90 ms 600 KB Output is correct
41 Correct 82 ms 600 KB Output is correct
42 Correct 85 ms 596 KB Output is correct
43 Correct 85 ms 600 KB Output is correct
44 Correct 117 ms 600 KB Output is correct
45 Correct 12 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 13 ms 344 KB Output is correct
48 Correct 13 ms 344 KB Output is correct
49 Correct 10 ms 344 KB Output is correct
50 Correct 20 ms 344 KB Output is correct
51 Correct 20 ms 344 KB Output is correct
52 Correct 19 ms 344 KB Output is correct
53 Correct 41 ms 344 KB Output is correct
54 Correct 44 ms 596 KB Output is correct
55 Correct 26 ms 344 KB Output is correct
56 Correct 108 ms 600 KB Output is correct
57 Correct 76 ms 600 KB Output is correct
58 Correct 74 ms 600 KB Output is correct
59 Correct 107 ms 600 KB Output is correct
60 Correct 73 ms 604 KB Output is correct
61 Correct 80 ms 600 KB Output is correct
62 Correct 102 ms 856 KB Output is correct
63 Correct 74 ms 604 KB Output is correct
64 Correct 92 ms 596 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 24 ms 344 KB Output is correct
4 Correct 33 ms 344 KB Output is correct
5 Correct 75 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 21 ms 344 KB Output is correct
9 Correct 39 ms 344 KB Output is correct
10 Correct 84 ms 604 KB Output is correct
11 Correct 108 ms 600 KB Output is correct
12 Correct 108 ms 596 KB Output is correct
13 Correct 93 ms 600 KB Output is correct
14 Correct 18 ms 344 KB Output is correct
15 Correct 16 ms 344 KB Output is correct
16 Correct 9 ms 596 KB Output is correct
17 Correct 18 ms 600 KB Output is correct
18 Correct 14 ms 344 KB Output is correct
19 Correct 25 ms 344 KB Output is correct
20 Correct 35 ms 344 KB Output is correct
21 Correct 14 ms 344 KB Output is correct
22 Correct 12 ms 344 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 11 ms 344 KB Output is correct
25 Correct 13 ms 344 KB Output is correct
26 Correct 17 ms 344 KB Output is correct
27 Correct 18 ms 344 KB Output is correct
28 Correct 26 ms 600 KB Output is correct
29 Correct 28 ms 344 KB Output is correct
30 Correct 42 ms 344 KB Output is correct
31 Correct 33 ms 344 KB Output is correct
32 Correct 9 ms 340 KB Output is correct
33 Correct 7 ms 344 KB Output is correct
34 Correct 13 ms 344 KB Output is correct
35 Correct 13 ms 344 KB Output is correct
36 Correct 18 ms 344 KB Output is correct
37 Correct 18 ms 344 KB Output is correct
38 Correct 28 ms 344 KB Output is correct
39 Correct 23 ms 344 KB Output is correct
40 Correct 30 ms 344 KB Output is correct
41 Correct 28 ms 504 KB Output is correct
42 Correct 35 ms 344 KB Output is correct
43 Correct 105 ms 844 KB Output is correct
44 Correct 91 ms 600 KB Output is correct
45 Correct 81 ms 600 KB Output is correct
46 Correct 104 ms 604 KB Output is correct
47 Correct 78 ms 600 KB Output is correct
48 Correct 84 ms 600 KB Output is correct
49 Correct 101 ms 600 KB Output is correct
50 Correct 87 ms 856 KB Output is correct
51 Correct 83 ms 608 KB Output is correct
52 Partially correct 88 ms 600 KB Output is partially correct
53 Correct 116 ms 604 KB Output is correct
54 Correct 107 ms 600 KB Output is correct
55 Correct 110 ms 608 KB Output is correct
56 Correct 93 ms 600 KB Output is correct
57 Correct 129 ms 600 KB Output is correct
58 Correct 76 ms 600 KB Output is correct
59 Correct 81 ms 600 KB Output is correct
60 Correct 107 ms 600 KB Output is correct
61 Correct 117 ms 600 KB Output is correct
62 Correct 74 ms 600 KB Output is correct
63 Correct 78 ms 604 KB Output is correct
64 Correct 89 ms 600 KB Output is correct
65 Partially correct 96 ms 600 KB Output is partially correct
66 Partially correct 100 ms 600 KB Output is partially correct
67 Partially correct 112 ms 600 KB Output is partially correct
68 Correct 71 ms 600 KB Output is correct
69 Partially correct 85 ms 600 KB Output is partially correct
70 Partially correct 85 ms 600 KB Output is partially correct
71 Correct 101 ms 600 KB Output is correct
72 Correct 68 ms 856 KB Output is correct
73 Correct 113 ms 600 KB Output is correct
74 Partially correct 114 ms 600 KB Output is partially correct
75 Partially correct 70 ms 604 KB Output is partially correct
76 Partially correct 79 ms 600 KB Output is partially correct
77 Correct 102 ms 600 KB Output is correct
78 Correct 70 ms 600 KB Output is correct
79 Correct 104 ms 600 KB Output is correct
80 Partially correct 72 ms 600 KB Output is partially correct
81 Partially correct 103 ms 856 KB Output is partially correct
82 Partially correct 89 ms 856 KB Output is partially correct