답안 #859120

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
859120 2023-10-09T18:54:33 Z Ludissey 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
10 ms 856 KB
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
 
std::vector<int> longest_trip(int n, int d)
{
    vector<int> A;
    vector<int> B;
    A.push_back(0);
    for (int i = 1; i < n-1; i+=2)
    {
        if(are_connected({i},{i+1})){
            if(are_connected({i}, {A.back()})){
                A.push_back(i);
                A.push_back(i+1);
            } 
            else if(B.size()==0 || are_connected({i}, {B.back()})){
                B.push_back(i);
                B.push_back(i+1);
            } 
            else {
                for (int x = B.size()-1; x >= 0; x--) A.push_back(B[x]);
                B.clear();
                B.push_back(i);
                B.push_back(i+1);
            }
        }else{
            if(are_connected({i}, {A.back()})){
                A.push_back(i);
                if(B.size()==0 || are_connected({i}, {B.back()})){
                    for (int x = B.size()-1; x >= 0; x--) A.push_back(B[x]);
                    B.clear();
                }
                B.push_back(i+1);
            } 
            else if(B.size()==0 || are_connected({i}, {B.back()})){
                B.push_back(i);
                if(are_connected({i}, {A.back()})){
                    for (int x = A.size()-1; x >= 0; x--) B.push_back(A[x]);
                    A.clear();
                    B.push_back(i+1);
                    swap(A,B);
                }else{
                    A.push_back(i+1);
                }
            } 
            else {
                A.push_back(i+1);
                for (int x = B.size()-1; x >= 0; x--) A.push_back(B[x]);
                B.clear();
                B.push_back(i);
            }
        }
    }
    if(n%2==0){
        int i=n-1;
        if(are_connected({i}, {A.back()})) A.push_back(i);
        else if(B.size()==0 || are_connected({i}, {B.back()})) B.push_back(i);
        else {
            for (int x = B.size()-1; x >= 0; x--) A.push_back(B[x]);
            B.clear();
            B.push_back(i);
        }
    }
    if(A.size()<B.size()) swap(A,B);
    vector<int> outp;
    if(B.size()==0 || !are_connected({A},{B})) return A;
    int aN=A.size(), bN=B.size();
    if(are_connected({A[aN-1]}, {B[bN-1]})){
        for (int i = 0; i < aN; i++) outp.push_back(A[i]);
        for (int i = bN-1; i >= 0; i--) outp.push_back(B[i]);
        // cout << "method1\n";
    }else if(are_connected({A[aN-1]}, {B[0]})){
        for (int i = 0; i < aN; i++) outp.push_back(A[i]);
        for (int i = 0; i < bN; i++) outp.push_back(B[i]);
        //cout << A.size() << " " << B.size() << " method2\n";
    }else if(are_connected({A[0]}, {B[bN-1]})){
        for (int i = aN-1; i >= 0; i--) outp.push_back(A[i]);
        for (int i = bN-1; i >= 0; i--) outp.push_back(B[i]);
        //cout << "method3\n";
    }else if(are_connected({A[0]}, {B[0]})){
        for (int i = aN-1; i >= 0; i--) outp.push_back(A[i]);
        for (int i = 0; i < bN; i++) outp.push_back(B[i]);
        //cout << "method4\n";
    }else{
        int l=0;
        int r=aN-1;
        while(l<r)
        {
            int mid=(l+r)/2;
            vector<int> vec;
            for (int i = l; i <= mid; i++) vec.push_back(A[i]);
            
            if(are_connected(vec, B)){
                r=mid;
            }else{
                l=mid+1;
            }
        }
        int aConnect=l;
        l=0;
        r=bN-1;
        while(l<r)
        {
            int mid=(l+r)/2;
            vector<int> vec;
            for (int i = l; i <= mid; i++) vec.push_back(B[i]);
            
            if(are_connected({A[aConnect]}, vec)){
                r=mid;
            }else{
                l=mid+1;
            }
        }
        int bConnect=l;
        for (int i = aConnect+1; i < aN; i++) outp.push_back(A[i]);
        for (int i = 0; i <= aConnect; i++) outp.push_back(A[i]);
        for (int i = bConnect; i < bN; i++) outp.push_back(B[i]);
        for (int i = 0; i < bConnect; i++) outp.push_back(B[i]);
        //cout << "methodLast\n";
    }
    return outp;
}
//
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 600 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 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 6 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 5 ms 344 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 8 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 5 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 5 ms 344 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 6 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 6 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 5 ms 344 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 4 ms 600 KB Output is correct
38 Correct 5 ms 344 KB Output is correct
39 Correct 6 ms 600 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 6 ms 344 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 7 ms 600 KB Output is correct
45 Correct 9 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 9 ms 344 KB Output is correct
49 Correct 8 ms 344 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Correct 7 ms 340 KB Output is correct
52 Correct 7 ms 344 KB Output is correct
53 Correct 5 ms 344 KB Output is correct
54 Correct 6 ms 636 KB Output is correct
55 Correct 5 ms 344 KB Output is correct
56 Correct 4 ms 344 KB Output is correct
57 Correct 6 ms 344 KB Output is correct
58 Correct 7 ms 600 KB Output is correct
59 Correct 7 ms 600 KB Output is correct
60 Correct 7 ms 604 KB Output is correct
61 Correct 7 ms 436 KB Output is correct
62 Correct 8 ms 436 KB Output is correct
63 Correct 7 ms 344 KB Output is correct
64 Correct 7 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 6 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 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 8 ms 344 KB Output is correct
22 Correct 10 ms 340 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 4 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 6 ms 344 KB Output is correct
30 Correct 6 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 8 ms 596 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 10 ms 344 KB Output is correct
37 Correct 5 ms 596 KB Output is correct
38 Correct 7 ms 344 KB Output is correct
39 Correct 8 ms 340 KB Output is correct
40 Correct 5 ms 596 KB Output is correct
41 Correct 5 ms 344 KB Output is correct
42 Correct 6 ms 344 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 600 KB Output is correct
46 Correct 6 ms 600 KB Output is correct
47 Correct 4 ms 432 KB Output is correct
48 Correct 5 ms 600 KB Output is correct
49 Correct 5 ms 344 KB Output is correct
50 Correct 7 ms 432 KB Output is correct
51 Correct 6 ms 600 KB Output is correct
52 Correct 8 ms 344 KB Output is correct
53 Correct 6 ms 344 KB Output is correct
54 Correct 6 ms 600 KB Output is correct
55 Correct 6 ms 344 KB Output is correct
56 Correct 5 ms 344 KB Output is correct
57 Correct 6 ms 600 KB Output is correct
58 Correct 6 ms 344 KB Output is correct
59 Correct 6 ms 608 KB Output is correct
60 Correct 7 ms 344 KB Output is correct
61 Correct 6 ms 344 KB Output is correct
62 Correct 5 ms 600 KB Output is correct
63 Correct 5 ms 600 KB Output is correct
64 Partially correct 7 ms 600 KB Output is partially correct
65 Partially correct 7 ms 604 KB Output is partially correct
66 Partially correct 7 ms 440 KB Output is partially correct
67 Partially correct 6 ms 344 KB Output is partially correct
68 Partially correct 8 ms 600 KB Output is partially correct
69 Partially correct 6 ms 344 KB Output is partially correct
70 Partially correct 7 ms 608 KB Output is partially correct
71 Correct 5 ms 344 KB Output is correct
72 Partially correct 6 ms 344 KB Output is partially correct
73 Partially correct 7 ms 440 KB Output is partially correct
74 Partially correct 8 ms 856 KB Output is partially correct
75 Partially correct 7 ms 344 KB Output is partially correct
76 Partially correct 7 ms 600 KB Output is partially correct
77 Correct 5 ms 600 KB Output is correct
78 Partially correct 6 ms 440 KB Output is partially correct
79 Correct 6 ms 340 KB Output is correct
80 Correct 8 ms 856 KB Output is correct
81 Partially correct 8 ms 600 KB Output is partially correct
82 Partially correct 8 ms 344 KB Output is partially correct