답안 #1075196

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1075196	2024-08-25T19:43:08 Z	Maite_Morale	가장 긴 여행 (IOI23_longesttrip)	C++17	15 / 100	8 ms	452 KB

longesttrip

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define MAX 500005
#define F first
#define S second 

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

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

ll pass[MAX];
std::vector<int> longest_trip(int N, int D)
{
    if(D==3){
        std::vector<int> r={};
        for(int i=0;i<N;i++)r.push_back(i);
        return r;
    }
    vi r={0};
    if(are_connected({0},{1})==0)r.push_back(2);
    r.push_back(1);vi fron={};
    for(int i=r.size();i<N;i++){
        if(are_connected({r.back()},{i})==0)fron.push_back(i);
        else                                    r.push_back(i);
    }
    reverse(fron.begin(),fron.end());
    for(auto u : r)fron.push_back(u);
    return fron;
}

Subtask #0

0.0 / 0.0

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

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	344 KB	Output is correct
2	Correct	5 ms	344 KB	Output is correct
3	Correct	6 ms	344 KB	Output is correct
4	Correct	7 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	7 ms	340 KB	Output is correct
7	Correct	6 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	8 ms	452 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	7 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	5 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	6 ms	344 KB	Output is correct
6	Correct	5 ms	344 KB	Output is correct
7	Correct	5 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	7 ms	344 KB	Output is correct
13	Correct	6 ms	348 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	7 ms	344 KB	Output is correct
2	Correct	7 ms	344 KB	Output is correct
3	Correct	6 ms	344 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	6 ms	448 KB	Output is correct
6	Correct	6 ms	344 KB	Output is correct
7	Correct	6 ms	344 KB	Output is correct
8	Correct	6 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	440 KB	Output is correct
11	Correct	7 ms	344 KB	Output is correct
12	Correct	7 ms	344 KB	Output is correct
13	Correct	5 ms	340 KB	Output is correct
14	Incorrect	0 ms	344 KB	Incorrect
15	Halted	0 ms	0 KB	-