oj.uz

답안 #1086386

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086386 2024-09-10T11:53:43 Z qwerasdfzxcl 가장 긴 여행 (IOI23_longesttrip) C++17
25 / 100
 10 ms 856 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;
    for (int i=1;i<N;i++){
        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 (true){
        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;

    assert(A.size()==1 || E(A[0], A.back()));

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

    rotate(A.begin(), A.begin()+ans, A.end());
    return B + A;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 352 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 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

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

Subtask #4
0.0 / 60.0

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