답안 #859106

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
859106	2023-10-09T17:51:42 Z	Ludissey	가장 긴 여행 (IOI23_longesttrip)	C++17	컴파일 오류	0 ms	0 KB

longesttrip

#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; i++)
    {
        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;
        int l=0;
        int 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;
}
//0-1

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:56:13: error: redeclaration of 'int l'
   56 |         int l=0;
      |             ^
longesttrip.cpp:41:13: note: 'int l' previously declared here
   41 |         int l=0;
      |             ^
longesttrip.cpp:57:13: error: redeclaration of 'int r'
   57 |         int r=bN-1;
      |             ^
longesttrip.cpp:42:13: note: 'int r' previously declared here
   42 |         int r=aN-1;
      |             ^
longesttrip.cpp:64:46: error: could not convert 'A.std::vector<int>::operator[](((std::vector<int>::size_type)aConnect))' from '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} to 'std::vector<int>'
   64 |             if(are_connected(A[aConnect], vec)){
      |                                              ^
      |                                              |
      |                                              __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type {aka int}