oj.uz

답안 #980230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980230 2024-05-12T01:25:43 Z vjudge1 가장 긴 여행 (IOI23_longesttrip) C++17
25 / 100
 16 ms 1112 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>

#include <vector>
#define MP make_pair
#define f first
#define s second
typedef long long ll;
using namespace std;

mt19937_64 rnd(286);

const int INF = (int)1e6;

bool conectados(int A, int B) {
    vector<int> a,b;
    a.push_back(A);
    b.push_back(B);
    return are_connected(a,b);
}

struct linea{
    deque <int> lin;
    linea(){}
    linea(int A) {
        lin.push_front(A);
    }
    void unir(linea B) {
        while (!B.lin.empty()) {
            lin.push_front(B.lin.front());
            B.lin.pop_front();
        }
        return;
    }
};

vector <int> base(int N) {
    vector <int> ans;
    ans.push_back(0);
    if (conectados(0, 1)) ans.push_back(1);
    return ans;
}

std::vector<int> longest_trip(int N, int D) {
    if (N <= 2) return base(N);
    vector <linea> V;
    vector <int> ans;
    for (int i = 0; i < N; i++)
        V.push_back(linea(i));
    shuffle(V.begin(),V.end(),rnd);
    while (V.size() >= 3) {
        linea A = V.back();
        V.pop_back();
        linea B = V.back();
        V.pop_back();
        linea C = V.back();
        V.pop_back();
        if (conectados(A.lin.front(), B.lin.front())) {
            A.unir(B);
            V.push_back(A);
            V.push_back(C);
        }
        else if (conectados(A.lin.front(), C.lin.front())) {
            A.unir(C);
            V.push_back(A);
            V.push_back(B);
        }
        else {
            B.unir(C);
            V.push_back(B);
            V.push_back(A);
        }
    }
    if (V[0].lin.size() > V[1].lin.size()) swap(V[0], V[1]);
    while (!V[1].lin.empty()) {
        ans.push_back(V[1].lin.front());
        V[1].lin.pop_front();
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

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 9 ms 756 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 8 ms 936 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 10 ms 856 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 7 ms 680 KB Output is correct
12 Correct 7 ms 936 KB Output is correct
13 Correct 8 ms 756 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 10 ms 600 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 9 ms 856 KB Output is correct
19 Correct 8 ms 344 KB Output is correct
20 Correct 7 ms 856 KB Output is correct
21 Correct 9 ms 1112 KB Output is correct
22 Correct 11 ms 688 KB Output is correct
23 Correct 11 ms 1112 KB Output is correct
24 Correct 9 ms 1112 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 10 ms 344 KB Output is correct
28 Correct 14 ms 344 KB Output is correct
29 Correct 10 ms 344 KB Output is correct
30 Correct 10 ms 600 KB Output is correct
31 Correct 11 ms 500 KB Output is correct
32 Correct 12 ms 496 KB Output is correct
33 Correct 10 ms 852 KB Output is correct
34 Correct 13 ms 600 KB Output is correct
35 Correct 13 ms 600 KB Output is correct
36 Correct 8 ms 684 KB Output is correct
37 Correct 12 ms 752 KB Output is correct
38 Correct 16 ms 856 KB Output is correct
39 Correct 15 ms 680 KB Output is correct
40 Correct 13 ms 600 KB Output is correct
41 Correct 12 ms 856 KB Output is correct
42 Correct 11 ms 856 KB Output is correct
43 Correct 12 ms 676 KB Output is correct
44 Correct 13 ms 856 KB Output is correct
45 Correct 9 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 9 ms 344 KB Output is correct
48 Correct 11 ms 596 KB Output is correct
49 Correct 11 ms 344 KB Output is correct
50 Correct 9 ms 344 KB Output is correct
51 Correct 13 ms 496 KB Output is correct
52 Correct 11 ms 492 KB Output is correct
53 Correct 10 ms 552 KB Output is correct
54 Correct 11 ms 548 KB Output is correct
55 Correct 11 ms 864 KB Output is correct
56 Correct 9 ms 684 KB Output is correct
57 Correct 12 ms 856 KB Output is correct
58 Correct 13 ms 856 KB Output is correct
59 Correct 14 ms 856 KB Output is correct
60 Correct 14 ms 684 KB Output is correct
61 Correct 11 ms 676 KB Output is correct
62 Correct 16 ms 856 KB Output is correct
63 Correct 15 ms 856 KB Output is correct
64 Correct 11 ms 856 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -