제출 #1056713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056713		perekopskad	가장 긴 여행 (IOI23_longesttrip)	C++17	5 / 100	2 ms	344 KiB

longesttrip

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define el '\n'
#define ff first
#define ss second
#define pii pair <ll, ll>
#define pb push_back
#define mkp make_pair
#define fr(i, l, r) for(ll i = l; i <= r; i++)
#define debug(x) \
    { cout << #x << " = " << x << el; }

template<class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}

template<class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}

const ll N = 2e5 + 10;
const ll M = 1e5 + 10;
const ll K = 400;
const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll LOG = 20;
const ll mod = 1000002022;
mt19937 rnd(time(0));

bool are_connected(std::vector<int> A, std::vector<int> B);

std::vector<int> longest_trip(int N, int D) {
    if(D == 3) {
        vector <int> v;
        fr(i, 0, N - 1)
            v.pb(i);
        return v;
    }
}

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

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
   44 | }
      | ^

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