제출 #900535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
900535		abcvuitunggio	가장 긴 여행 (IOI23_longesttrip)	C++17	85 / 100	15 ms	1112 KiB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> longest_trip(int N, int D){
    if (D>1){
        deque <int> q={0};
        if (!are_connected({0},{1}))
            q.push_back(2);
        q.push_back(1);
        for (int i=q.size();i<N;i++)
            if (are_connected({i},{q.front()}))
                q.push_front(i);
            else
                q.push_back(i);
        vector <int> res;
        for (int i:q)
            res.push_back(i);
        return res;
    }
    vector <int> a,b;
    a.push_back(0);
    b.push_back(1);
    for (int i=2;i<N;i++){
        if (are_connected({a.back()},{i})){
            a.push_back(i);
            continue;
        }
        if (are_connected({b.back()},{i})){
            b.push_back(i);
            continue;
        }
        reverse(b.begin(),b.end());
        for (int i:b)
            a.push_back(i);
        b={i};
    }
    if (a.size()<b.size())
        swap(a,b);
    if (!are_connected(a,b))
        return a;
    vector <int> x={0,a.size()-1},y={0,b.size()-1};
    for (int i:x)
        for (int j:y)
            if (are_connected({a[i]},{b[j]})){
                if (!i)
                    reverse(a.begin(),a.end());
                if (j)
                    reverse(b.begin(),b.end());
                for (int k:b)
                    a.push_back(k);
                return a;
            }
    int l=0,r=b.size()-1,i=-1;
    while (l<=r){
        int mid=(l+r)>>1;
        vector <int> tmp;
        for (int i=0;i<=mid;i++)
            tmp.push_back(b[i]);
        if (are_connected(a,tmp)){
            i=mid;
            r=mid-1;
        }
        else
            l=mid+1;
    }
    l=0,r=a.size()-1;
    int j=-1;
    while (l<=r){
        int mid=(l+r)>>1;
        vector <int> tmp;
        for (int i=0;i<=mid;i++)
            tmp.push_back(a[i]);
        if (are_connected(tmp,{b[i]})){
            j=mid;
            r=mid-1;
        }
        else
            l=mid+1;
    }
    vector <int> c;
    for (int k=(j+1)%a.size();c.size()<a.size();k=(k+1)%a.size())
        c.push_back(a[k]);
    for (int k=i;c.size()<a.size()+b.size();k=(k+1)%b.size())
        c.push_back(b[k]);
    return c;
}

컴파일 시 표준 에러 (stderr) 메시지

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:41:31: warning: narrowing conversion of '(a.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
   41 |     vector <int> x={0,a.size()-1},y={0,b.size()-1};
      |                       ~~~~~~~~^~
longesttrip.cpp:41:31: warning: narrowing conversion of '(a.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
longesttrip.cpp:41:48: warning: narrowing conversion of '(b.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
   41 |     vector <int> x={0,a.size()-1},y={0,b.size()-1};
      |                                        ~~~~~~~~^~
longesttrip.cpp:41:48: warning: narrowing conversion of '(b.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 25 / 25
• Subtask 4: 45 / 60