답안 #842966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
842966	2023-09-03T13:59:40 Z	pit4h	가장 긴 여행 (IOI23_longesttrip)	C++17	40 / 100	14 ms	852 KB

longesttrip

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

using namespace std;

vector<int> longest_trip(int N, int D)
{
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    vector<int> path[2];  

    path[0] = {0}; 

    for (int i = 1; i < N; i++) {
        bool which = uniform_int_distribution<int>(0, 1)(rng);
        if (path[which].empty()) {
            which = !which;
        }

        if (are_connected({path[which].back()}, {i})) {
            path[which].push_back(i);
            if (!path[!which].empty() && 
                are_connected({path[!which].back()}, {i})) {
                while (!path[!which].empty()) {
                    path[which].push_back(path[!which].back());
                    path[!which].pop_back();
                }        
            }
        }
        else {
            path[!which].push_back(i);
        }
    }

    if (path[0].empty()) {
        return path[1];
    }
    if (path[1].empty()) {
        return path[0];
    }

    vector<int> res;
    // if (true && are_connected({path[0][0], path[0].back()}, {path[1][0], path[1].back()})) {
        if (are_connected({path[0][0]}, {path[1][0]})) {
            for (int i: path[1]) {
                res.push_back(i);
            }
            reverse(res.begin(), res.end());
            for (int i: path[0]) {
                res.push_back(i);
            }
        }
        else if(are_connected({path[0][0]}, {path[1].back()})) {
            for (int i: path[1]) {
                res.push_back(i);
            }
            for (int i: path[0]) {
                res.push_back(i);
            }
        }
        else if(are_connected({path[0].back()}, {path[1][0]})) {
            for (int i: path[0]) {
                res.push_back(i);
            }
            for (int i: path[1]) {
                res.push_back(i);
            }
        }
        else {
            res = (path[0].size() > path[1].size())?path[0] : path[1];
        }
    // }
    // else {
    //     res = (path[0].size() > path[1].size())?path[0] : path[1];
    // }

    return res;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	344 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	4 ms	344 KB	Output is correct
4	Correct	4 ms	344 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct
6	Correct	9 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	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	5 ms	852 KB	Output is correct

Subtask #3
25.0 / 25.0

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

Subtask #4
0.0 / 60.0

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

답안 #842966

Compilation message

Subtask #0 0.0 / 0.0

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 25.0 / 25.0

Subtask #4 0.0 / 60.0

Subtask #0
0.0 / 0.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
25.0 / 25.0

Subtask #4
0.0 / 60.0