답안 #1028931

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1028931	2024-07-20T10:29:28 Z	Mr_Husanboy	가장 긴 여행 (IOI23_longesttrip)	C++17	40 / 100	12 ms	600 KB

longesttrip

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

using namespace std;

#define ll long long
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()

template<typename T>
int len(T &a){return a.size();}


int ask(int a, int b){
    return are_connected({a}, {b});
}


vector<int> longest_trip(int n, int d)
{
    if(d >= 2){
        deque<int> cur = {0};
        vector<int> done(n, 0);
        done[0] = 1;
        for(int i = 1; i < n; i ++){
            if(ask(cur[0], i)){
                cur.push_back(i);
                done[i] = 1;
                break;
            }
        }
        for(int i = 0; i < n; i ++){
            if(done[i]) continue;
            if(ask(cur[0], i)){
                cur.push_front(i);
            }else cur.push_back(i);
        }
        vector<int> res;
        for(auto u : cur) res.push_back(u);
        return res;  
    }
    deque<int> a = {0}, b = {1};
    for(int i = 2; i < n; i ++){
        if(ask(a.back(), i)){
            a.push_back(i);
        }else if(ask(b.back(), i)){
            b.push_back(i);
        }else{
            for(int i = len(b) - 1; i >= 0; i --) a.push_back(b[i]);
            b = {i};
        }
    }
    if(len(b) > len(a)) swap(a, b);
    vector<int> res;
    for(auto u : a) res.push_back(u);
    return res;
}

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	9 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	5 ms	344 KB	Output is correct
5	Correct	5 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	8 ms	344 KB	Output is correct
3	Correct	7 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	5 ms	344 KB	Output is correct
7	Correct	5 ms	344 KB	Output is correct
8	Correct	4 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	4 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	6 ms	344 KB	Output is correct

Subtask #3

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	344 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	4 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	432 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	Correct	4 ms	344 KB	Output is correct
15	Correct	4 ms	344 KB	Output is correct
16	Correct	6 ms	344 KB	Output is correct
17	Correct	6 ms	344 KB	Output is correct
18	Correct	6 ms	344 KB	Output is correct
19	Correct	4 ms	344 KB	Output is correct
20	Correct	6 ms	344 KB	Output is correct
21	Correct	6 ms	344 KB	Output is correct
22	Correct	6 ms	436 KB	Output is correct
23	Correct	4 ms	344 KB	Output is correct
24	Correct	5 ms	344 KB	Output is correct
25	Correct	5 ms	344 KB	Output is correct
26	Correct	5 ms	344 KB	Output is correct
27	Correct	5 ms	344 KB	Output is correct
28	Correct	7 ms	344 KB	Output is correct
29	Correct	6 ms	344 KB	Output is correct
30	Correct	6 ms	344 KB	Output is correct
31	Correct	7 ms	344 KB	Output is correct
32	Correct	12 ms	344 KB	Output is correct
33	Correct	8 ms	344 KB	Output is correct
34	Correct	9 ms	344 KB	Output is correct
35	Correct	6 ms	344 KB	Output is correct
36	Correct	5 ms	344 KB	Output is correct
37	Correct	6 ms	344 KB	Output is correct
38	Correct	7 ms	344 KB	Output is correct
39	Correct	8 ms	344 KB	Output is correct
40	Correct	7 ms	344 KB	Output is correct
41	Correct	7 ms	344 KB	Output is correct
42	Correct	7 ms	344 KB	Output is correct
43	Correct	7 ms	344 KB	Output is correct
44	Correct	7 ms	344 KB	Output is correct
45	Correct	6 ms	344 KB	Output is correct
46	Correct	5 ms	344 KB	Output is correct
47	Correct	4 ms	344 KB	Output is correct
48	Correct	5 ms	344 KB	Output is correct
49	Correct	8 ms	344 KB	Output is correct
50	Correct	5 ms	344 KB	Output is correct
51	Correct	7 ms	344 KB	Output is correct
52	Correct	7 ms	344 KB	Output is correct
53	Correct	5 ms	344 KB	Output is correct
54	Correct	7 ms	344 KB	Output is correct
55	Correct	6 ms	344 KB	Output is correct
56	Correct	6 ms	344 KB	Output is correct
57	Correct	7 ms	344 KB	Output is correct
58	Correct	7 ms	344 KB	Output is correct
59	Correct	6 ms	432 KB	Output is correct
60	Correct	7 ms	344 KB	Output is correct
61	Correct	7 ms	344 KB	Output is correct
62	Correct	11 ms	600 KB	Output is correct
63	Correct	7 ms	344 KB	Output is correct
64	Correct	8 ms	344 KB	Output is correct

Subtask #4

0.0 / 60.0

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