oj.uz

답안 #843107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
843107 2023-09-03T17:08:45 Z pit4h 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 12 ms 864 KB 
#include<bits/stdc++.h>
#include "longesttrip.h"

using namespace std;


vector<int> order, rev_order;

bool are_connected_wrapper(vector<int> vec1, vector<int> vec2) {
    vector<int> param1, param2;
    for (int i: vec1) {
        param1.push_back(order[i]);
    }
    for (int i: vec2) {
        param2.push_back(order[i]);
    }
    return are_connected(param1, param2);
}

vector<int> get_result(vector<int> path) {
    vector<int> res;
    for (int i: path) {
        res.push_back(order[i]);
    }
    return res;
}

pair<int, int> find_connection(vector<int> vec1, vector<int> vec2, bool is_checked=false) {
    if (!is_checked && !are_connected_wrapper(vec1, vec2)) {
        return make_pair(-1, -1);
    }
    if (vec1.size() == 1 && vec2.size() == 1) {
        return make_pair(vec1[0], vec2[0]);
    } 
    if (vec1.size() == 1) {
        pair<int, int> res = find_connection(vec2, vec1, true);
        return make_pair(res.second, res.first);
    }

    vector<int> half;
    for (int i = 0; i < (int)vec1.size() / 2; i++) {
        half.push_back(vec1[i]);
    }
    pair<int, int> res = find_connection(half, vec2);
    if (res != make_pair(-1, -1)) {
        return res;
    }

    half.clear();
    for (int i = (int)vec1.size() / 2; i < (int)vec1.size(); i++) {
        half.push_back(vec1[i]);
    }
    return find_connection(half, vec2);
}

int find_position(int el, vector<int> vec) {
    for (int i = 0; i < (int)vec.size(); i++) {
        if (vec[i] == el) {
            return i;
        }
    }
    return -1;
}

vector<int> longest_trip(int N, int D)
{
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

    order.resize(N);
    rev_order.resize(N);
    for (int i = 0; i < N; i++) {
        order[i] = i;
    }
    shuffle(order.begin(), order.end(), rng);
    for (int i = 0; i < N; ++i) {
        rev_order[order[i]] = i;
    }

    vector<int> path[2];  

    path[0] = {0}; 

    for (int i = 1; i < N; i++) {
        bool which = uniform_int_distribution<int>(0, 1)(rng);
        if (path[which].empty()) {
            which = !which;
        }
 
        if (are_connected_wrapper({path[which].back()}, {i})) {
            path[which].push_back(i);
            if (!path[!which].empty() && 
                are_connected_wrapper({path[!which].back()}, {i})) {
                while (!path[!which].empty()) {
                    path[which].push_back(path[!which].back());
                    path[!which].pop_back();
                }        
            }
        }
        else {
            path[!which].push_back(i);
        } 
    }

    if (path[0].empty()) {
        return get_result(path[1]);
    }
    if (path[1].empty()) {
        return get_result(path[0]);
    }

    vector<int> res;
    vector<int> path_ends[2];

    for (int i = 0; i <= 1; i++) {
        if (path[i].size() == 1u) {
            path_ends[i] = {path[i][0]};
        }
        else {
            path_ends[i] = {path[i][0], path[i].back()};
        }
    }

    if (are_connected_wrapper(path_ends[0], path_ends[1])) {
        if (are_connected_wrapper({path[0][0]}, {path[1][0]})) {
            for (int i: path[1]) {
                res.push_back(i);
            }
            reverse(res.begin(), res.end());
            for (int i: path[0]) {
                res.push_back(i);
            }
        }
        else if(are_connected_wrapper({path[0][0]}, {path[1].back()})) {
            for (int i: path[1]) {
                res.push_back(i);
            }
            for (int i: path[0]) {
                res.push_back(i);
            }
        }
        else if(are_connected_wrapper({path[0].back()}, {path[1][0]})) {
            for (int i: path[0]) {
                res.push_back(i);
            }
            for (int i: path[1]) {
                res.push_back(i);
            }
        }
        else {
            assert(false);
        }
    }
    else {
        pair<int, int> conn = find_connection(path[0], path[1]);
        if (conn == make_pair(-1, -1)) {
            res = (path[0].size() > path[1].size())?path[0] : path[1];
        }
        else {
            int pos[2] = {find_position(conn.first, path[0]), find_position(conn.second, path[1])};
            for (int i = (pos[0] + 1) % path[0].size(); i != pos[0]; i = (i + 1) % path[0].size()) {
                res.push_back(path[0][i]);
            }        
            res.push_back(conn.first);
            res.push_back(conn.second);
            for (int i = (pos[1] + 1) % path[1].size(); i != pos[1]; i = (i + 1) % path[1].size()) {
                res.push_back(path[1][i]);
            }
        }
    }

    return get_result(res);
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 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 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #4
45.0 / 60.0

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