oj.uz

답안 #840688

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840688 2023-08-31T15:47:29 Z emeraldblock 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 23 ms 472 KB 
#include <bits/stdc++.h>
#include <random>
#include "longesttrip.h"

#ifndef LOCAL
#define cerr if (false) cerr
#endif

using namespace std;

std::vector<int> longest_trip(int N, int D)
{
    mt19937 mt(123213);
    vector<int> pi;
    pi.resize(N);
    iota(pi.begin(),pi.end(),0);
    shuffle(pi.begin(),pi.end(),mt);

    auto isline = [&](vector<int> a) {
        for (auto& x : a) x = pi[x];
#ifdef LOCAL
        for (int i = 1; i < a.size(); ++i) {
            assert(are_connected({a[i-1]}, {a[i]}));
        }
#endif
        return a;
    };
    auto check = [&](vector<int> a, vector<int> b) {
        for (auto& x : a) x = pi[x];
        for (auto& x : b) x = pi[x];
        return are_connected(a,b);
    };

    vector<int> path{0};
    vector<vector<int>> cliques;
    for (int i = 1; i < N; ++i) {
        cliques.push_back({i});
    }
    optional<vector<int>> disj;
    while (!cliques.empty()) {
        auto cand = cliques.back(); cliques.pop_back();
        cerr << path.back() << " : ";
        for (auto x : cand) cerr << x << ", ";
        cerr << "\n";
        if (check({path.back()}, cand)) {
            int lo = 0, hi = cand.size();
            while (hi-lo > 1) {
                int mid = (lo+hi)/2;
                vector<int> v;
                for (int i = lo; i < mid; ++i) {
                    v.push_back(cand[i]);
                }
                if (check({path.back()}, v)) {
                    hi = mid;
                } else {
                    lo = mid;
                }
            }
            swap(cand[0],cand[lo]);
            path.insert(path.end(),cand.begin(),cand.end());
            if (disj) {
                cliques.push_back(*disj);
                disj.reset();
            }
        } else {
            if (disj) {
                auto& v = disj.value();
                v.insert(v.end(),cand.begin(),cand.end());
            } else {
                disj = cand;
            }
        }
    }
    if (!disj) {
        return isline(path);
    }
    vector<int> rest = *disj;
    if (!check(path, rest)) {
        return isline(path.size() >= rest.size() ? path : rest);
    }
    if (check({path.front()},rest)) {
        reverse(path.begin(),path.end());
    } else {
        int lo = 0, hi = path.size();
        while (hi-lo > 1) {
            int mid = (lo+hi)/2;
            vector<int> v;
            for (int i = mid; i < hi; ++i) {
                v.push_back(path[i]);
            }
            if (check(v, rest)) {
                lo = mid;
            } else {
                hi = mid;
            }
        }
        rotate(path.begin(),path.begin()+hi,path.end());
    }
    int lo = 0, hi = rest.size();
    while (hi-lo > 1) {
        int mid = (lo+hi)/2;
        vector<int> v;
        for (int i = lo; i < mid; ++i) {
            v.push_back(rest[i]);
        }
        if (check({path.back()}, v)) {
            hi = mid;
        } else {
            lo = mid;
        }
    }
    rotate(rest.begin(),rest.begin()+lo,rest.end());
    path.insert(path.end(),rest.begin(),rest.end());
    return isline(path);
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 9 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 10 ms 208 KB Output is correct
5 Correct 10 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 10 ms 208 KB Output is correct
5 Correct 8 ms 332 KB Output is correct
6 Correct 13 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 7 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 6 ms 316 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 208 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 10 ms 208 KB Output is correct
5 Correct 9 ms 208 KB Output is correct
6 Correct 8 ms 256 KB Output is correct
7 Correct 11 ms 208 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 10 ms 208 KB Output is correct
10 Correct 10 ms 320 KB Output is correct
11 Correct 7 ms 208 KB Output is correct
12 Correct 6 ms 312 KB Output is correct
13 Correct 10 ms 336 KB Output is correct
14 Correct 11 ms 208 KB Output is correct
15 Correct 10 ms 208 KB Output is correct
16 Correct 7 ms 208 KB Output is correct
17 Correct 10 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 9 ms 208 KB Output is correct
20 Correct 11 ms 208 KB Output is correct
21 Correct 8 ms 208 KB Output is correct
22 Correct 7 ms 208 KB Output is correct
23 Correct 6 ms 324 KB Output is correct
24 Correct 11 ms 208 KB Output is correct
25 Correct 13 ms 208 KB Output is correct
26 Correct 12 ms 208 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 15 ms 208 KB Output is correct
30 Correct 12 ms 208 KB Output is correct
31 Correct 15 ms 208 KB Output is correct
32 Correct 13 ms 208 KB Output is correct
33 Correct 14 ms 332 KB Output is correct
34 Correct 12 ms 208 KB Output is correct
35 Correct 11 ms 208 KB Output is correct
36 Correct 10 ms 208 KB Output is correct
37 Correct 14 ms 208 KB Output is correct
38 Correct 17 ms 328 KB Output is correct
39 Correct 14 ms 356 KB Output is correct
40 Correct 16 ms 336 KB Output is correct
41 Correct 16 ms 336 KB Output is correct
42 Correct 12 ms 336 KB Output is correct
43 Correct 18 ms 360 KB Output is correct
44 Correct 13 ms 336 KB Output is correct
45 Correct 10 ms 208 KB Output is correct
46 Correct 16 ms 208 KB Output is correct
47 Correct 15 ms 208 KB Output is correct
48 Correct 15 ms 208 KB Output is correct
49 Correct 14 ms 208 KB Output is correct
50 Correct 13 ms 208 KB Output is correct
51 Correct 12 ms 336 KB Output is correct
52 Correct 13 ms 208 KB Output is correct
53 Correct 11 ms 316 KB Output is correct
54 Correct 16 ms 208 KB Output is correct
55 Correct 11 ms 208 KB Output is correct
56 Correct 15 ms 448 KB Output is correct
57 Correct 12 ms 336 KB Output is correct
58 Correct 19 ms 316 KB Output is correct
59 Correct 19 ms 332 KB Output is correct
60 Correct 11 ms 336 KB Output is correct
61 Correct 13 ms 336 KB Output is correct
62 Correct 13 ms 336 KB Output is correct
63 Correct 16 ms 344 KB Output is correct
64 Correct 13 ms 348 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 208 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 4 ms 208 KB Output is correct
4 Correct 9 ms 208 KB Output is correct
5 Correct 10 ms 208 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 11 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 9 ms 208 KB Output is correct
11 Correct 4 ms 316 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 10 ms 208 KB Output is correct
14 Correct 11 ms 208 KB Output is correct
15 Correct 13 ms 208 KB Output is correct
16 Correct 10 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 9 ms 208 KB Output is correct
20 Correct 8 ms 208 KB Output is correct
21 Correct 14 ms 208 KB Output is correct
22 Correct 14 ms 208 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 14 ms 228 KB Output is correct
25 Correct 15 ms 208 KB Output is correct
26 Correct 11 ms 208 KB Output is correct
27 Correct 12 ms 208 KB Output is correct
28 Correct 14 ms 208 KB Output is correct
29 Correct 14 ms 208 KB Output is correct
30 Correct 16 ms 208 KB Output is correct
31 Correct 16 ms 208 KB Output is correct
32 Correct 15 ms 208 KB Output is correct
33 Correct 15 ms 208 KB Output is correct
34 Correct 14 ms 208 KB Output is correct
35 Correct 11 ms 208 KB Output is correct
36 Correct 15 ms 208 KB Output is correct
37 Correct 10 ms 332 KB Output is correct
38 Correct 12 ms 328 KB Output is correct
39 Correct 7 ms 308 KB Output is correct
40 Correct 10 ms 332 KB Output is correct
41 Correct 12 ms 336 KB Output is correct
42 Correct 15 ms 208 KB Output is correct
43 Correct 11 ms 332 KB Output is correct
44 Correct 10 ms 320 KB Output is correct
45 Correct 9 ms 208 KB Output is correct
46 Correct 8 ms 208 KB Output is correct
47 Correct 11 ms 208 KB Output is correct
48 Partially correct 17 ms 316 KB Output is partially correct
49 Partially correct 8 ms 368 KB Output is partially correct
50 Partially correct 13 ms 344 KB Output is partially correct
51 Partially correct 16 ms 376 KB Output is partially correct
52 Correct 16 ms 336 KB Output is correct
53 Correct 12 ms 336 KB Output is correct
54 Correct 13 ms 336 KB Output is correct
55 Correct 11 ms 356 KB Output is correct
56 Partially correct 18 ms 320 KB Output is partially correct
57 Partially correct 13 ms 380 KB Output is partially correct
58 Partially correct 12 ms 336 KB Output is partially correct
59 Partially correct 15 ms 360 KB Output is partially correct
60 Correct 12 ms 344 KB Output is correct
61 Correct 23 ms 352 KB Output is correct
62 Partially correct 11 ms 208 KB Output is partially correct
63 Partially correct 10 ms 324 KB Output is partially correct
64 Partially correct 13 ms 208 KB Output is partially correct
65 Partially correct 15 ms 336 KB Output is partially correct
66 Partially correct 15 ms 336 KB Output is partially correct
67 Correct 15 ms 336 KB Output is correct
68 Correct 19 ms 472 KB Output is correct
69 Partially correct 15 ms 336 KB Output is partially correct
70 Correct 14 ms 356 KB Output is correct
71 Partially correct 14 ms 208 KB Output is partially correct
72 Partially correct 9 ms 352 KB Output is partially correct
73 Partially correct 17 ms 336 KB Output is partially correct
74 Partially correct 14 ms 348 KB Output is partially correct
75 Correct 18 ms 408 KB Output is correct
76 Correct 17 ms 336 KB Output is correct
77 Partially correct 11 ms 324 KB Output is partially correct
78 Partially correct 15 ms 340 KB Output is partially correct
79 Partially correct 18 ms 336 KB Output is partially correct
80 Partially correct 17 ms 388 KB Output is partially correct
81 Partially correct 21 ms 352 KB Output is partially correct
82 Correct 14 ms 336 KB Output is correct