답안 #1086389

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086389 2024-09-10T12:08:01 Z qwerasdfzxcl 가장 긴 여행 (IOI23_longesttrip) C++17
100 / 100
13 ms 968 KB
#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int adj[256][256], n;

int E(int x, int y){
    assert(x != y);
    if (adj[x][y] != -1) return adj[x][y];
    adj[x][y] = adj[y][x] = are_connected({x}, {y});

    for (int z=0;z<n;z++) if (x!=z && y!=z){
        if (!adj[x][y] && !adj[x][z]) adj[y][z] = adj[z][y] = 1;
        if (!adj[x][y] && !adj[y][z]) adj[x][z] = adj[z][x] = 1;
    }

    return adj[x][y];
}

vector<int> rev(vector<int> A){
    reverse(A.begin(), A.end());
    return A;
}

vector<int> operator + (const vector<int> &A, const vector<int> &B){
    vector<int> ret = A;
    for (auto &x:B) ret.push_back(x);
    return ret;
}


std::vector<int> longest_trip(int N, int D)
{
    n = N;
    for (int i=0;i<N;i++) for (int j=0;j<N;j++) adj[i][j] = -1;
    for (int i=0;i<N;i++) adj[i][i] = 0;

    vector<int> A = {0}, B, fuck;
    mt19937 seed(1557);
    for (int i=1;i<N;i++) fuck.push_back(i);
    shuffle(fuck.begin(), fuck.end(), seed);
    for (int i:fuck){
        if (B.empty()) {B.push_back(i); continue;}
        if (E(A.back(), i)) {A.push_back(i); continue;}
        if (E(B.back(), i)) {B.push_back(i); continue;}
        
        A = A + rev(B);

        B.clear();
        B.push_back(i);
    }

    if (!are_connected(A, B)){
        if (A.size() >= B.size()) return A;
        return B;
    }

    if (E(A.back(), B[0])) return A + B;
    if (E(A.back(), B.back())) return A + rev(B);
    if (E(A[0], B.back())) return rev(A) + rev(B);
    if (E(A[0], B[0])) return rev(A) + B;

    int l = 0, r = (int)A.size()-1, ans1 = (int)A.size()-1;
    while(l<=r){
        int mid = (l+r)>>1;
        if (are_connected(vector<int>(A.begin(), A.begin()+mid+1), B)) ans1 = mid, r = mid-1;
        else l = mid+1;
    }

    l = 0, r = (int)B.size()-1;
    int ans2 = (int)B.size()-1;
    while(l<=r){
        int mid = (l+r)>>1;
        if (are_connected({A[ans1]}, vector<int>(B.begin(), B.begin()+mid+1))) ans2 = mid, r = mid-1;
        else l = mid+1;
    }

    rotate(A.begin(), A.begin()+ans1, A.end());
    rotate(B.begin(), B.begin()+ans2, B.end());
    return rev(A) + B;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 10 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 6 ms 600 KB Output is correct
11 Correct 6 ms 600 KB Output is correct
12 Correct 6 ms 600 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 7 ms 576 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 6 ms 544 KB Output is correct
10 Correct 7 ms 600 KB Output is correct
11 Correct 6 ms 704 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 8 ms 600 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 7 ms 600 KB Output is correct
18 Correct 7 ms 500 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 6 ms 600 KB Output is correct
22 Correct 9 ms 856 KB Output is correct
23 Correct 6 ms 596 KB Output is correct
24 Correct 7 ms 712 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 7 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 7 ms 344 KB Output is correct
33 Correct 5 ms 344 KB Output is correct
34 Correct 6 ms 344 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 7 ms 856 KB Output is correct
37 Correct 6 ms 856 KB Output is correct
38 Correct 8 ms 708 KB Output is correct
39 Correct 7 ms 600 KB Output is correct
40 Correct 7 ms 696 KB Output is correct
41 Correct 7 ms 600 KB Output is correct
42 Correct 7 ms 600 KB Output is correct
43 Correct 10 ms 600 KB Output is correct
44 Correct 7 ms 600 KB Output is correct
45 Correct 9 ms 344 KB Output is correct
46 Correct 13 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 8 ms 340 KB Output is correct
50 Correct 6 ms 512 KB Output is correct
51 Correct 10 ms 344 KB Output is correct
52 Correct 9 ms 344 KB Output is correct
53 Correct 7 ms 600 KB Output is correct
54 Correct 9 ms 344 KB Output is correct
55 Correct 7 ms 344 KB Output is correct
56 Correct 6 ms 600 KB Output is correct
57 Correct 6 ms 600 KB Output is correct
58 Correct 7 ms 712 KB Output is correct
59 Correct 7 ms 600 KB Output is correct
60 Correct 9 ms 600 KB Output is correct
61 Correct 10 ms 700 KB Output is correct
62 Correct 11 ms 684 KB Output is correct
63 Correct 9 ms 856 KB Output is correct
64 Correct 8 ms 712 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 10 ms 856 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 7 ms 600 KB Output is correct
12 Correct 6 ms 856 KB Output is correct
13 Correct 8 ms 704 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 7 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 10 ms 492 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 10 ms 344 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 5 ms 508 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 6 ms 552 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 4 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 10 ms 344 KB Output is correct
35 Correct 10 ms 344 KB Output is correct
36 Correct 11 ms 344 KB Output is correct
37 Correct 6 ms 344 KB Output is correct
38 Correct 8 ms 344 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 8 ms 600 KB Output is correct
42 Correct 6 ms 560 KB Output is correct
43 Correct 6 ms 600 KB Output is correct
44 Correct 6 ms 600 KB Output is correct
45 Correct 6 ms 600 KB Output is correct
46 Correct 6 ms 600 KB Output is correct
47 Correct 6 ms 600 KB Output is correct
48 Correct 6 ms 708 KB Output is correct
49 Correct 7 ms 600 KB Output is correct
50 Correct 7 ms 600 KB Output is correct
51 Correct 7 ms 600 KB Output is correct
52 Correct 8 ms 600 KB Output is correct
53 Correct 7 ms 600 KB Output is correct
54 Correct 10 ms 600 KB Output is correct
55 Correct 8 ms 600 KB Output is correct
56 Correct 8 ms 600 KB Output is correct
57 Correct 6 ms 600 KB Output is correct
58 Correct 7 ms 600 KB Output is correct
59 Correct 6 ms 600 KB Output is correct
60 Correct 7 ms 600 KB Output is correct
61 Correct 7 ms 600 KB Output is correct
62 Correct 6 ms 600 KB Output is correct
63 Correct 6 ms 968 KB Output is correct
64 Correct 10 ms 696 KB Output is correct
65 Correct 7 ms 600 KB Output is correct
66 Correct 7 ms 708 KB Output is correct
67 Correct 8 ms 600 KB Output is correct
68 Correct 8 ms 856 KB Output is correct
69 Correct 10 ms 600 KB Output is correct
70 Correct 9 ms 856 KB Output is correct
71 Correct 8 ms 600 KB Output is correct
72 Correct 6 ms 600 KB Output is correct
73 Correct 7 ms 600 KB Output is correct
74 Correct 11 ms 600 KB Output is correct
75 Correct 9 ms 684 KB Output is correct
76 Correct 11 ms 600 KB Output is correct
77 Correct 6 ms 600 KB Output is correct
78 Correct 10 ms 708 KB Output is correct
79 Correct 7 ms 600 KB Output is correct
80 Correct 12 ms 856 KB Output is correct
81 Correct 8 ms 600 KB Output is correct
82 Correct 8 ms 704 KB Output is correct