답안 #840761

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
840761	2023-08-31T16:47:10 Z	emeraldblock	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	18 ms	428 KB

longesttrip

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

using namespace std;

vector<int> pi,ip;
bool check(vector<int> a, vector<int> b) {
    for (auto& x : a) x = pi[x];
    for (auto& x : b) x = pi[x];
    return are_connected(a,b);
}

vector<int> isline(vector<int> a) {
    for (auto& x : a) x = pi[x];
#ifdef LOCAL
    for (int i = 1; i < a.size(); ++i) {
        assert(are_connected({a[i-1]}, {a[i]}));
    }
#endif
    return a;
}

mt19937 mt(361);

std::vector<int> longest_trip(int N, int D)
{
    pi.resize(N);
    iota(pi.begin(),pi.end(),0);
    shuffle(pi.begin(),pi.end(),mt);
    vector<int> s1({0}),s2({1});
    bool sep = false;
    for (int i = 2; i < N; ++i) {
        if (check({s1.back()}, {i})) {
            s1.push_back(i);
            sep = false;
        } else if (sep || check({s2.back()}, {i})) {
            s2.push_back(i);
            sep = true;
        } else {
            if (false && i < N-1) {
                if (check({i},{i+1})) {
                    while (!s2.empty()) {
                        s1.push_back(s2.back());
                        s2.pop_back();
                    }
                    s2.push_back(i);
                    s2.push_back(i+1);
                } else {
                    s1.push_back(i+1);
                    while (!s2.empty()) {
                        s1.push_back(s2.back());
                        s2.pop_back();
                    }
                    s2.push_back(i);
                }
                ++i;
            } else {
                while (!s2.empty()) {
                    s1.push_back(s2.back());
                    s2.pop_back();
                }
                s2.push_back(i);
            }
        }
    }
    // for (auto x : s1) cerr << x << " ";
    // cerr << "\n";
    // for (auto x : s2) cerr << x << " ";
    // cerr << "\n";
    if (!check(s1, s2)) {
        return isline(s1.size() >= s2.size() ? s1 : s2);
    }
    if (check(s1,{s2.front()})) {
            reverse(s2.begin(),s2.end());
    } else {
        int lo = 0, hi = s2.size();
        while (hi-lo>1) {
            int mid = (lo+hi)/2;
            vector<int> v;
            for (int i = mid; i < hi; ++i) {
                v.push_back(s2[i]);
            }
            if (!check(s1, v)) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        rotate(s2.begin(),s2.begin()+hi,s2.end());
    }
    if (check({s1.front()},{s2.back()})) {
        reverse(s1.begin(),s1.end());
    } else {
        int lo = 0, hi = s1.size();
        while (hi-lo>1) {
            int mid = (lo+hi)/2;
            vector<int> v;
            for (int i = mid; i < hi; ++i) {
                v.push_back(s1[i]);
            }
            if (!check(v, {s2.back()})) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        rotate(s1.begin(),s1.begin()+hi,s1.end());
    }
    // for (auto x : s1) cerr << x << " ";
    // cerr << "\n";
    // for (auto x : s2) cerr << x << " ";
    // cerr << "\n";
    while (!s2.empty()) {
        s1.push_back(s2.back());
        s2.pop_back();
    }
    return isline(s1);
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	208 KB	Output is correct
2	Correct	7 ms	208 KB	Output is correct
3	Correct	8 ms	208 KB	Output is correct
4	Correct	9 ms	208 KB	Output is correct
5	Correct	7 ms	292 KB	Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	208 KB	Output is correct
2	Correct	8 ms	208 KB	Output is correct
3	Correct	9 ms	208 KB	Output is correct
4	Correct	9 ms	208 KB	Output is correct
5	Correct	6 ms	208 KB	Output is correct
6	Correct	12 ms	208 KB	Output is correct
7	Correct	9 ms	208 KB	Output is correct
8	Correct	10 ms	208 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	10 ms	208 KB	Output is correct
11	Correct	9 ms	312 KB	Output is correct
12	Correct	10 ms	316 KB	Output is correct
13	Correct	7 ms	208 KB	Output is correct
14	Correct	13 ms	208 KB	Output is correct
15	Correct	14 ms	208 KB	Output is correct
16	Correct	13 ms	208 KB	Output is correct
17	Correct	11 ms	208 KB	Output is correct
18	Correct	10 ms	208 KB	Output is correct
19	Correct	8 ms	304 KB	Output is correct
20	Correct	14 ms	304 KB	Output is correct
21	Correct	12 ms	316 KB	Output is correct
22	Correct	10 ms	316 KB	Output is correct
23	Correct	7 ms	304 KB	Output is correct
24	Correct	12 ms	428 KB	Output is correct
25	Correct	9 ms	208 KB	Output is correct
26	Correct	7 ms	208 KB	Output is correct
27	Correct	10 ms	208 KB	Output is correct
28	Correct	7 ms	208 KB	Output is correct
29	Correct	11 ms	208 KB	Output is correct
30	Correct	14 ms	288 KB	Output is correct
31	Correct	13 ms	208 KB	Output is correct
32	Correct	12 ms	208 KB	Output is correct
33	Correct	9 ms	304 KB	Output is correct
34	Correct	4 ms	300 KB	Output is correct
35	Correct	8 ms	208 KB	Output is correct
36	Correct	7 ms	208 KB	Output is correct
37	Correct	9 ms	208 KB	Output is correct
38	Correct	9 ms	208 KB	Output is correct
39	Correct	14 ms	208 KB	Output is correct
40	Correct	9 ms	208 KB	Output is correct
41	Correct	7 ms	208 KB	Output is correct
42	Correct	11 ms	308 KB	Output is correct
43	Correct	10 ms	208 KB	Output is correct
44	Correct	9 ms	208 KB	Output is correct
45	Correct	18 ms	208 KB	Output is correct
46	Correct	14 ms	208 KB	Output is correct
47	Correct	13 ms	208 KB	Output is correct
48	Correct	9 ms	208 KB	Output is correct
49	Correct	10 ms	208 KB	Output is correct
50	Correct	7 ms	208 KB	Output is correct
51	Correct	13 ms	208 KB	Output is correct
52	Correct	13 ms	208 KB	Output is correct
53	Correct	10 ms	300 KB	Output is correct
54	Correct	9 ms	208 KB	Output is correct
55	Correct	9 ms	208 KB	Output is correct
56	Correct	8 ms	308 KB	Output is correct
57	Correct	6 ms	208 KB	Output is correct
58	Correct	13 ms	308 KB	Output is correct
59	Correct	8 ms	208 KB	Output is correct
60	Correct	9 ms	292 KB	Output is correct
61	Correct	12 ms	304 KB	Output is correct
62	Correct	11 ms	312 KB	Output is correct
63	Correct	11 ms	308 KB	Output is correct
64	Correct	12 ms	304 KB	Output is correct

Subtask #4
60.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	208 KB	Output is correct
2	Correct	7 ms	208 KB	Output is correct
3	Correct	9 ms	208 KB	Output is correct
4	Correct	7 ms	208 KB	Output is correct
5	Correct	8 ms	208 KB	Output is correct
6	Correct	13 ms	208 KB	Output is correct
7	Correct	9 ms	208 KB	Output is correct
8	Correct	7 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Correct	8 ms	304 KB	Output is correct
11	Correct	6 ms	336 KB	Output is correct
12	Correct	8 ms	288 KB	Output is correct
13	Correct	6 ms	276 KB	Output is correct
14	Correct	11 ms	208 KB	Output is correct
15	Correct	12 ms	208 KB	Output is correct
16	Correct	13 ms	208 KB	Output is correct
17	Correct	9 ms	208 KB	Output is correct
18	Correct	12 ms	304 KB	Output is correct
19	Correct	9 ms	208 KB	Output is correct
20	Correct	8 ms	304 KB	Output is correct
21	Correct	9 ms	208 KB	Output is correct
22	Correct	12 ms	208 KB	Output is correct
23	Correct	9 ms	208 KB	Output is correct
24	Correct	7 ms	208 KB	Output is correct
25	Correct	10 ms	208 KB	Output is correct
26	Correct	10 ms	208 KB	Output is correct
27	Correct	8 ms	208 KB	Output is correct
28	Correct	10 ms	208 KB	Output is correct
29	Correct	9 ms	208 KB	Output is correct
30	Correct	9 ms	304 KB	Output is correct
31	Correct	8 ms	208 KB	Output is correct
32	Correct	16 ms	208 KB	Output is correct
33	Correct	17 ms	208 KB	Output is correct
34	Correct	7 ms	208 KB	Output is correct
35	Correct	10 ms	208 KB	Output is correct
36	Correct	11 ms	208 KB	Output is correct
37	Correct	7 ms	208 KB	Output is correct
38	Correct	12 ms	208 KB	Output is correct
39	Correct	10 ms	208 KB	Output is correct
40	Correct	10 ms	304 KB	Output is correct
41	Correct	8 ms	208 KB	Output is correct
42	Correct	11 ms	208 KB	Output is correct
43	Correct	8 ms	304 KB	Output is correct
44	Correct	8 ms	208 KB	Output is correct
45	Correct	9 ms	300 KB	Output is correct
46	Correct	9 ms	208 KB	Output is correct
47	Correct	9 ms	208 KB	Output is correct
48	Correct	10 ms	208 KB	Output is correct
49	Correct	10 ms	208 KB	Output is correct
50	Correct	10 ms	208 KB	Output is correct
51	Correct	12 ms	304 KB	Output is correct
52	Correct	11 ms	304 KB	Output is correct
53	Correct	12 ms	296 KB	Output is correct
54	Correct	8 ms	208 KB	Output is correct
55	Correct	13 ms	304 KB	Output is correct
56	Correct	10 ms	208 KB	Output is correct
57	Correct	7 ms	208 KB	Output is correct
58	Correct	11 ms	308 KB	Output is correct
59	Correct	9 ms	208 KB	Output is correct
60	Correct	7 ms	208 KB	Output is correct
61	Correct	10 ms	304 KB	Output is correct
62	Correct	7 ms	208 KB	Output is correct
63	Correct	8 ms	308 KB	Output is correct
64	Correct	11 ms	208 KB	Output is correct
65	Correct	14 ms	208 KB	Output is correct
66	Correct	8 ms	208 KB	Output is correct
67	Correct	9 ms	208 KB	Output is correct
68	Correct	13 ms	208 KB	Output is correct
69	Correct	11 ms	208 KB	Output is correct
70	Correct	11 ms	208 KB	Output is correct
71	Correct	5 ms	308 KB	Output is correct
72	Correct	8 ms	208 KB	Output is correct
73	Correct	13 ms	288 KB	Output is correct
74	Correct	12 ms	208 KB	Output is correct
75	Correct	13 ms	304 KB	Output is correct
76	Correct	8 ms	308 KB	Output is correct
77	Correct	10 ms	308 KB	Output is correct
78	Correct	8 ms	208 KB	Output is correct
79	Correct	14 ms	208 KB	Output is correct
80	Correct	13 ms	208 KB	Output is correct
81	Correct	10 ms	208 KB	Output is correct
82	Correct	13 ms	312 KB	Output is correct

답안 #840761

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 60.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
60.0 / 60.0