제출 #1007022

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1007022		3as8	Longest Trip (IOI23_longesttrip)	C++17	5 / 100	8 ms	348 KiB

longesttrip

#include "longesttrip.h"

#include<bits/stdc++.h>

#define ll long long
using namespace std;

bool con[300][300];
bool vis[300];

ll n;
void dfs(ll startIndex, vector<int>& curr) {


    vis[startIndex] = true;
    curr.push_back(startIndex);

    for(int i = 0; i < n; i++) {
        if(!vis[i] && are_connected({startIndex}, {i})) {
            dfs(i, curr);
        }
    }

}


std::vector<int> longest_trip(int N, int D) {

    n = N;


    vector<ll> ans;
    ll mx = LLONG_MIN;
    for(int j = 0; j < n; j++) vis[j] = false;

    vector<int> curr;
    dfs(0, curr);

    return curr;
}

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

longesttrip.cpp: In function 'void dfs(long long int, std::vector<int>&)':
longesttrip.cpp:19:38: warning: narrowing conversion of 'startIndex' from 'long long int' to 'int' [-Wnarrowing]
   19 |         if(!vis[i] && are_connected({startIndex}, {i})) {
      |                                      ^~~~~~~~~~
longesttrip.cpp:19:38: warning: narrowing conversion of 'startIndex' from 'long long int' to 'int' [-Wnarrowing]
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:33:8: warning: unused variable 'mx' [-Wunused-variable]
   33 |     ll mx = LLONG_MIN;
      |        ^~

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