답안 #941901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
941901	2024-03-09T16:24:22 Z	benjaminkleyn	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	12 ms	860 KB

longesttrip

#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;

vector<int> longest_trip(int N, int D)
{
    if (D == 3)
    {
        vector<int> res(N);
        iota(res.begin(), res.end(), 0);
        return res;
    }

    if (D == 2)
    {
        vector<int> res;
        int cur;
        if (are_connected({0}, {1}))
            res = {0, 1}, cur = 2;
        else
            res = {0, 2, 1}, cur = 3;

        for (int i = cur; i < N; i++)
        {
            if (!are_connected({res.back()}, {i}))
                reverse(res.begin(), res.end());
            res.push_back(i);
        }

        return res;
    }

    vector<int> A = {0}, B = {1};
    bool flagAB = false;
    for (int i = 2; i + 1 < N; i += 2)
    {
        if (are_connected({i}, {i + 1}))
        {
            // now we know i and i + 1 are connected.
            if (are_connected({i}, {A.back(), B.back()}))
            {
                if (are_connected({i}, {A.back()}))
                {
                    A.push_back(i);
                    A.push_back(i + 1);
                }
                else
                {
                    B.push_back(i);
                    B.push_back(i + 1);
                }
            }
            else
            {
                reverse(B.begin(), B.end());
                for (int x : B) A.push_back(x);
                B = {i, i + 1};
            }
        }
        else
        {
            if (are_connected({A.back()}, {i}))
            {
                A.push_back(i);
                if (are_connected({B.back()}, {i + 1}))
                    B.push_back(i + 1);
                else
                {
                    reverse(B.begin(), B.end());
                    for (int x : B)
                        A.push_back(x);
                    B = {i + 1};
                }
            }
            else
            {
                A.push_back(i + 1);
                if (are_connected({B.back()}, {i}))
                    B.push_back(i);
                else
                {
                    reverse(B.begin(), B.end());
                    for (int x : B)
                        A.push_back(x);
                    B = {i};
                }
            }
        }
    }
    if (N % 2)
    {
        if (are_connected({N - 1}, {A.back(), B.back()}))
        {
            if (are_connected({N - 1}, {A.back()}))
                A.push_back(N - 1);
            else
                B.push_back(N - 1);
        }
        else
        {
            reverse(B.begin(), B.end());
            for (int x : B)
                A.push_back(x);
            B = {N - 1};
        }
    }
    if (!are_connected(A, B))
    {
        if (A.size() > B.size())
            return A;
        return B;
    }
    if (A.size() > 1 && !are_connected({A[0]}, {A.back()}))
    {
        if ((!flagAB) && are_connected({A.back()}, {B.back()}))
            reverse(A.begin(), A.end());
        for (int x : A)
            B.push_back(x);
        return B;
    }
    if (B.size() > 1 && !are_connected({B[0]}, {B.back()}))
    {
        if ((!flagAB) && are_connected({A.back()}, {B.back()}))
            reverse(B.begin(), B.end());
        for (int x : B)
            A.push_back(x);
        return A;
    }
    int lo = 1, hi = A.size();
    while (lo < hi)
    {
        int mid = (lo + hi) / 2;
        if (are_connected(vector<int>(A.begin(), A.begin() + mid), B))
            hi = mid;
        else
            lo = mid + 1;
    }
    int idxA = lo - 1;
    lo = 1, hi = B.size();
    while (lo < hi)
    {
        int mid = (lo + hi) / 2;
        if (are_connected(vector<int>(B.begin(), B.begin() + mid), {A[idxA]}))
            hi = mid;
        else
            lo = mid + 1;
    }
    int idxB = lo - 1;
    vector<int> res;
    for (int i = idxA + 1; i < A.size(); i++)
        res.push_back(A[i]);
    for (int i = 0; i <= idxA; i++)
        res.push_back(A[i]);
    for (int i = idxB; i < B.size(); i++)
        res.push_back(B[i]);
    for (int i = 0; i < idxB; i++)
        res.push_back(B[i]);
    return res;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:150:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  150 |     for (int i = idxA + 1; i < A.size(); i++)
      |                            ~~^~~~~~~~~~
longesttrip.cpp:154:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |     for (int i = idxB; i < B.size(); i++)
      |                        ~~^~~~~~~~~~

Subtask #0

0.0 / 0.0

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

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	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	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	4 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	5 ms	608 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	4 ms	600 KB	Output is correct

Subtask #3

25.0 / 25.0

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

Subtask #4

60.0 / 60.0

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