제출 #986938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
986938		activedeltorre	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	7 ms	800 KiB

longesttrip

#include "longesttrip.h"
#include <deque>
#include <vector>
using namespace std;
deque<int>dq;
int fre[100005];
vector<int> longest_trip(int N, int D)
{
    int i,n=N,capst,capdr;
    vector<int>ans,pl1,pl2;
    pl1.push_back(1);
    pl2.push_back(0);
    if(are_connected(pl1,pl2)==1)
    {
        dq.push_front(0);
        dq.push_back(1);
        capst=0;
        capdr=1;
        fre[0]++;
        fre[1]++;
    }
    else
    {
        dq.push_front(0);
        dq.push_back(2);
        capst=0;
        capdr=2;
        fre[0]++;
        fre[2]++;
    }
    for(i=1;i<n;i++)
    {
        if(fre[i]==0)
        {
            pl1.clear();
            pl2.clear();
            pl1.push_back(capst);
            pl2.push_back(i);
            if(are_connected(pl1,pl2)==1)
            {
                capst=i;
                dq.push_front(i);
            }
            else
            {
                capdr=i;
                dq.push_back(i);
            }
        }
    }
    while(dq.size())
    {
        ans.push_back(dq.front());
        dq.pop_front();
    }
    for(i=0;i<n;i++)
    {
        fre[i]=0;
    }
    return ans;
}

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

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:9:21: warning: variable 'capdr' set but not used [-Wunused-but-set-variable]
    9 |     int i,n=N,capst,capdr;
      |                     ^~~~~

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