답안 #1081695

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1081695	2024-08-30T09:19:12 Z	slivajan	가장 긴 여행 (IOI23_longesttrip)	C++17	15 / 100	8 ms	596 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

typedef int un;
typedef vector<un> vuc;
typedef deque<un> duc;

#define REP(i, a, b) for (un i = (un)a; i < (un)b; i++)
#define FEAC(i, a) for (auto&& i : a)
#define ALL(x) (x).begin(), (x).end()
#define vec vector
#define DEB(x) cerr << #x << " = " << x << endl;

std::vector<int> longest_trip(int N, int D)
{
    if (D == 3){
        vuc ret(N);
        iota(ALL(ret), 0);
        return ret;
    }

    if (D == 2){
        duc ret;
        
        if (not are_connected({0}, {1})){
            ret = {0, 2, 1};
        }
        else if (not are_connected({1}, {2})){
            ret = {1, 0, 2};
        }
        else {
            ret = {0, 1, 2};
        }

        REP(i, 3, N){
            if (are_connected({ret.back()}, {i})){
                ret.push_back(i);
            }
            else{
                ret.push_front(i);
            }
        }

        return vuc(ALL(ret));
    }
}

Compilation message

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

Subtask #0

0.0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	596 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	344 KB	Output is correct
2	Correct	7 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	6 ms	344 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct
6	Correct	4 ms	344 KB	Output is correct
7	Correct	6 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	8 ms	344 KB	Output is correct
10	Correct	6 ms	344 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	8 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct

Subtask #3

0.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	344 KB	Output is correct
2	Correct	8 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	7 ms	344 KB	Output is correct
5	Correct	7 ms	344 KB	Output is correct
6	Correct	7 ms	344 KB	Output is correct
7	Correct	7 ms	344 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	8 ms	344 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	7 ms	344 KB	Output is correct
14	Incorrect	0 ms	344 KB	Incorrect
15	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	344 KB	Output is correct
2	Correct	5 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	6 ms	344 KB	Output is correct
5	Correct	8 ms	344 KB	Output is correct
6	Correct	5 ms	344 KB	Output is correct
7	Correct	8 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	7 ms	344 KB	Output is correct
10	Correct	7 ms	344 KB	Output is correct
11	Correct	8 ms	344 KB	Output is correct
12	Correct	8 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Incorrect	1 ms	344 KB	Incorrect
15	Halted	0 ms	0 KB	-