답안 #848632

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
848632	2023-09-13T06:18:56 Z	piOOE	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	22 ms	1108 KB

longesttrip

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

using namespace std;

std::vector<int> longest_trip(int N, int D) {
    mt19937 rnd(228);

    vector<int> a, b, ord(N);
    iota(ord.begin(), ord.end(), 0);
    shuffle(ord.begin(), ord.end(), rnd);
    int known = -1;

    for (int x : ord) {
        if (a.empty() || b.empty()) {
            (a.empty() ? a : b).push_back(x);
            continue;
        }
        if (rnd() % 2) {
            swap(a, b);
        }
        if (1) {
            int res = are_connected({a.back()}, {x});
            if (res == 1) {
                a.push_back(x);
                known = -1;
            } else if (known != -1) {
                if (known == 1) { // unreachable
                    a.insert(a.end(), b.rbegin(), b.rend());
                    b = {x};
                    known = -1;
                } else {
                    b.push_back(x);
                    known = 0;
                }
            } else {
                res = are_connected({b.back()}, {x});
                if (res == 0) {
                    a.insert(a.end(), b.rbegin(), b.rend());
                    b = {x};
                    known = -1;
                } else {
                    b.push_back(x);
                    known = 0;
                }
            }
        } else {
            if (are_connected({a.back()}, {x})) {
                a.push_back(x);
            } else if (are_connected({b.back()}, {x})) {
                b.push_back(x);
            } else {
                a.insert(a.end(), b.rbegin(), b.rend());
                b = {x};
            }
        }
    }

    if (a.empty() || b.empty() || !are_connected(a, b)) {
        return a.size() > b.size() ? a : b;
    }

    if (size(a) < size(b)) {
        swap(a, b);
    }

    if (!are_connected(a, {b[0]}) && !are_connected(a, {b.back()})) {
        int lo = 0, hi = size(b);
        while (lo + 1 < hi) {
            int mid = lo + hi >> 1;
            if (are_connected(a, vector(b.begin(), b.begin() + mid))) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        rotate(b.begin(), b.begin() + lo, b.end());
    } else if (!are_connected(a, {b[0]})) {
        reverse(b.begin(), b.end());
    }

    assert(are_connected(a, {b[0]}));

    if (are_connected({a[0], a.back()}, {b[0]})) {
        if (are_connected({a[0]}, {b[0]})) {
            reverse(a.begin(), a.end());
        }
        a.insert(a.end(), b.begin(), b.end());
        return a;
    } else {
        int lo = 0, hi = size(a);
        while (lo + 1 < hi) {
            int mid = lo + hi >> 1;
            if (are_connected(vector(a.begin(), a.begin() + mid), {b[0]})) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        rotate(a.begin(), a.begin() + hi, a.end());
        a.insert(a.end(), b.begin(), b.end());
        return a;
    }
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:70:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |             int mid = lo + hi >> 1;
      |                       ~~~^~~~
longesttrip.cpp:93:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   93 |             int mid = lo + hi >> 1;
      |                       ~~~^~~~

Subtask #0

0.0 / 0.0

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

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 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	600 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	19 ms	344 KB	Output is correct
2	Correct	10 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	596 KB	Output is correct
6	Correct	17 ms	344 KB	Output is correct
7	Correct	11 ms	344 KB	Output is correct
8	Correct	5 ms	440 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	4 ms	444 KB	Output is correct
13	Correct	5 ms	444 KB	Output is correct

Subtask #3

25.0 / 25.0

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

Subtask #4

60.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 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	600 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	15 ms	344 KB	Output is correct
7	Correct	10 ms	344 KB	Output is correct
8	Correct	5 ms	600 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	4 ms	344 KB	Output is correct
12	Correct	4 ms	600 KB	Output is correct
13	Correct	5 ms	444 KB	Output is correct
14	Correct	7 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	9 ms	344 KB	Output is correct
17	Correct	6 ms	600 KB	Output is correct
18	Correct	6 ms	344 KB	Output is correct
19	Correct	6 ms	600 KB	Output is correct
20	Correct	6 ms	856 KB	Output is correct
21	Correct	7 ms	344 KB	Output is correct
22	Correct	6 ms	344 KB	Output is correct
23	Correct	9 ms	344 KB	Output is correct
24	Correct	6 ms	344 KB	Output is correct
25	Correct	6 ms	344 KB	Output is correct
26	Correct	5 ms	692 KB	Output is correct
27	Correct	6 ms	440 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct
29	Correct	5 ms	600 KB	Output is correct
30	Correct	6 ms	600 KB	Output is correct
31	Correct	6 ms	688 KB	Output is correct
32	Correct	14 ms	344 KB	Output is correct
33	Correct	12 ms	344 KB	Output is correct
34	Correct	9 ms	344 KB	Output is correct
35	Correct	9 ms	344 KB	Output is correct
36	Correct	10 ms	344 KB	Output is correct
37	Correct	6 ms	692 KB	Output is correct
38	Correct	7 ms	440 KB	Output is correct
39	Correct	7 ms	436 KB	Output is correct
40	Correct	6 ms	344 KB	Output is correct
41	Correct	6 ms	600 KB	Output is correct
42	Correct	7 ms	600 KB	Output is correct
43	Correct	5 ms	448 KB	Output is correct
44	Correct	5 ms	600 KB	Output is correct
45	Correct	5 ms	696 KB	Output is correct
46	Correct	5 ms	448 KB	Output is correct
47	Correct	6 ms	600 KB	Output is correct
48	Correct	5 ms	440 KB	Output is correct
49	Correct	5 ms	636 KB	Output is correct
50	Correct	5 ms	600 KB	Output is correct
51	Correct	8 ms	444 KB	Output is correct
52	Correct	6 ms	344 KB	Output is correct
53	Correct	6 ms	344 KB	Output is correct
54	Correct	6 ms	440 KB	Output is correct
55	Correct	5 ms	444 KB	Output is correct
56	Correct	5 ms	444 KB	Output is correct
57	Correct	5 ms	444 KB	Output is correct
58	Correct	5 ms	344 KB	Output is correct
59	Correct	5 ms	344 KB	Output is correct
60	Correct	6 ms	344 KB	Output is correct
61	Correct	7 ms	344 KB	Output is correct
62	Correct	6 ms	856 KB	Output is correct
63	Correct	7 ms	604 KB	Output is correct
64	Correct	7 ms	696 KB	Output is correct
65	Correct	6 ms	600 KB	Output is correct
66	Correct	6 ms	444 KB	Output is correct
67	Correct	7 ms	600 KB	Output is correct
68	Correct	6 ms	440 KB	Output is correct
69	Correct	6 ms	688 KB	Output is correct
70	Correct	7 ms	860 KB	Output is correct
71	Correct	6 ms	952 KB	Output is correct
72	Correct	7 ms	856 KB	Output is correct
73	Correct	6 ms	444 KB	Output is correct
74	Correct	7 ms	692 KB	Output is correct
75	Correct	7 ms	700 KB	Output is correct
76	Correct	6 ms	444 KB	Output is correct
77	Correct	7 ms	700 KB	Output is correct
78	Correct	7 ms	696 KB	Output is correct
79	Correct	6 ms	604 KB	Output is correct
80	Correct	9 ms	1108 KB	Output is correct
81	Correct	7 ms	600 KB	Output is correct
82	Correct	6 ms	600 KB	Output is correct