oj.uz

Submission #839718

# Submission time Handle Problem Language Result Execution time Memory
839718 2023-08-30T15:48:46 Z model_code Longest Trip (IOI23_longesttrip) C++17
100 / 100
 24 ms 336 KB 
// model_solution/solution.cpp

#include <ctime>
#include "longesttrip.h"
#include <algorithm>
#include <random>
#include <deque>

void conc(std::deque<int> &l1, std::deque<int> &l2)
{
    while (!l2.empty())
    {
        l1.push_back(l2.back());
        l2.pop_back();
    }
}

void combine(std::deque<int> &line1, std::deque<int> &line2)
{
    if (line2.empty())
        return;

    if (are_connected({line1.back()}, {line2.back()}))
    {
        while (!line2.empty())
        {
            line1.push_back(line2.back());
            line2.pop_back();
        }
        return;
    }
    if (are_connected({line1.back()}, {line2.front()}))
    {
        while (!line2.empty())
        {
            line1.push_back(line2.front());
            line2.pop_front();
        }
        return;
    }
    if (are_connected({line1.front()}, {line2.back()}))
    {
        while (!line2.empty())
        {
            line1.push_front(line2.back());
            line2.pop_back();
        }
        return;
    }
    if (are_connected({line1.front()}, {line2.front()}))
    {
        while (!line2.empty())
        {
            line1.push_front(line2.front());
            line2.pop_front();
        }
        return;
    }

    std::vector<int> l1;
    l1.clear();
    std::vector<int> l2;
    l2.clear();

    for (int i : line1)
        l1.push_back(i);
    for (int i : line2)
        l2.push_back(i);

    if (!are_connected(l1, l2))
        return;

    int a = 0, b = line2.size() - 1;
    while (a != b)
    {
        std::vector<int> vec(line2.begin() + a, line2.begin() + (a + b) / 2 + 1);
        if (are_connected(l1, vec))
        {
            b = (a + b) / 2;
        }
        else
        {
            a = (a + b) / 2 + 1;
        }
    }
    int pos = a;

    a = 0;
    b = line1.size() - 1;
    while (a != b)
    {
        std::vector<int> vec(line1.begin() + a, line1.begin() + (a + b) / 2 + 1);
        if (are_connected(vec, {l2[pos]}))
        {
            b = (a + b) / 2;
        }
        else
        {
            a = (a + b) / 2 + 1;
        }
    }
    int pos2 = a;

    if (pos2 != (int)line1.size() - 1)
        std::rotate(line1.begin(), line1.begin() + pos2 + 1, line1.end());
    if (pos != (int)line2.size() - 1)
        std::rotate(line2.begin(), line2.begin() + pos + 1, line2.end());

    while (!line2.empty())
    {
        line1.push_back(line2.back());
        line2.pop_back();
    }
}

std::vector<int> longest_trip(int N, int /*D*/)
{
    srand(time(0));
    std::vector<int> ids(N);
    for (int i = 0; i < N; i++)
        ids[i] = i;
    random_shuffle(ids.begin(), ids.end());

    std::deque<int> line1;
    line1.clear();
    std::deque<int> line2;
    line2.clear();

    line1.push_back(ids[0]);
    line2.push_back(ids[1]);

    bool separated = false;

    for (int i = 2; i < N; i++)
    {
        if (are_connected({line1.back()}, {ids[i]}))
        {
            line1.push_back(ids[i]);
            separated = false;
        }
        else if (separated)
        {
            line2.push_back(ids[i]);
        }
        else if (are_connected({line2.back()}, {ids[i]}))
        {
            line2.push_back(ids[i]);
            separated = true;
        }
        else
        {
            if (i < N - 2)
            {
                bool c1 = are_connected({ids[i]}, {ids[i + 1]});
                bool c2 = are_connected({ids[i]}, {ids[i + 2]});
                if (c1 && c2)
                {
                    conc(line1, line2);
                    line2.push_back(ids[i + 1]);
                    line2.push_back(ids[i]);
                    line2.push_back(ids[i + 2]);
                }
                else if (!c1 && !c2)
                {
                    line1.push_back(ids[i + 1]);
                    line1.push_back(ids[i + 2]);
                    conc(line1, line2);
                    line2.push_back(ids[i]);
                }
                else
                {
                    if (!c1)
                        line1.push_back(ids[i + 1]);
                    else
                        line1.push_back(ids[i + 2]);
                    conc(line1, line2);
                    if (!c1)
                        line2.push_back(ids[i + 2]);
                    else
                        line2.push_back(ids[i + 1]);
                    line2.push_back(ids[i]);
                }
                i += 2;
            }
            else
            {
                conc(line1, line2);
                line2.push_back(ids[i]);
            }
            separated = false;
        }
    }

    if (line1.size() < line2.size())
        swap(line1, line2);

    combine(line1, line2);

    std::vector<int> ans;
    ans.clear();
    for (int i : line1)
        ans.push_back(i);
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 3 ms 208 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 208 KB Output is correct
2 Correct 9 ms 208 KB Output is correct
3 Correct 11 ms 208 KB Output is correct
4 Correct 4 ms 284 KB Output is correct
5 Correct 9 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 208 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 6 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Correct 10 ms 208 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 10 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 8 ms 288 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 6 ms 208 KB Output is correct
12 Correct 10 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 7 ms 280 KB Output is correct
3 Correct 10 ms 208 KB Output is correct
4 Correct 10 ms 208 KB Output is correct
5 Correct 9 ms 208 KB Output is correct
6 Correct 13 ms 208 KB Output is correct
7 Correct 11 ms 208 KB Output is correct
8 Correct 7 ms 292 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 4 ms 276 KB Output is correct
12 Correct 10 ms 208 KB Output is correct
13 Correct 4 ms 336 KB Output is correct
14 Correct 24 ms 208 KB Output is correct
15 Correct 13 ms 208 KB Output is correct
16 Correct 8 ms 280 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 11 ms 228 KB Output is correct
19 Correct 10 ms 208 KB Output is correct
20 Correct 13 ms 208 KB Output is correct
21 Correct 10 ms 208 KB Output is correct
22 Correct 13 ms 208 KB Output is correct
23 Correct 10 ms 208 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 11 ms 208 KB Output is correct
26 Correct 14 ms 256 KB Output is correct
27 Correct 7 ms 208 KB Output is correct
28 Correct 12 ms 208 KB Output is correct
29 Correct 14 ms 208 KB Output is correct
30 Correct 10 ms 208 KB Output is correct
31 Correct 9 ms 208 KB Output is correct
32 Correct 10 ms 208 KB Output is correct
33 Correct 8 ms 208 KB Output is correct
34 Correct 11 ms 208 KB Output is correct
35 Correct 8 ms 208 KB Output is correct
36 Correct 6 ms 208 KB Output is correct
37 Correct 6 ms 208 KB Output is correct
38 Correct 10 ms 208 KB Output is correct
39 Correct 7 ms 208 KB Output is correct
40 Correct 10 ms 256 KB Output is correct
41 Correct 10 ms 256 KB Output is correct
42 Correct 14 ms 208 KB Output is correct
43 Correct 12 ms 208 KB Output is correct
44 Correct 10 ms 208 KB Output is correct
45 Correct 14 ms 208 KB Output is correct
46 Correct 14 ms 252 KB Output is correct
47 Correct 11 ms 208 KB Output is correct
48 Correct 12 ms 208 KB Output is correct
49 Correct 13 ms 208 KB Output is correct
50 Correct 10 ms 208 KB Output is correct
51 Correct 11 ms 208 KB Output is correct
52 Correct 14 ms 208 KB Output is correct
53 Correct 7 ms 208 KB Output is correct
54 Correct 6 ms 208 KB Output is correct
55 Correct 11 ms 208 KB Output is correct
56 Correct 7 ms 208 KB Output is correct
57 Correct 7 ms 208 KB Output is correct
58 Correct 11 ms 208 KB Output is correct
59 Correct 11 ms 208 KB Output is correct
60 Correct 11 ms 208 KB Output is correct
61 Correct 8 ms 208 KB Output is correct
62 Correct 15 ms 268 KB Output is correct
63 Correct 9 ms 208 KB Output is correct
64 Correct 12 ms 208 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 10 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 7 ms 208 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 7 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 10 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 7 ms 208 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 24 ms 208 KB Output is correct
15 Correct 17 ms 208 KB Output is correct
16 Correct 11 ms 208 KB Output is correct
17 Correct 12 ms 208 KB Output is correct
18 Correct 11 ms 208 KB Output is correct
19 Correct 7 ms 208 KB Output is correct
20 Correct 8 ms 208 KB Output is correct
21 Correct 16 ms 208 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 14 ms 208 KB Output is correct
25 Correct 15 ms 208 KB Output is correct
26 Correct 6 ms 208 KB Output is correct
27 Correct 9 ms 208 KB Output is correct
28 Correct 12 ms 208 KB Output is correct
29 Correct 9 ms 208 KB Output is correct
30 Correct 9 ms 208 KB Output is correct
31 Correct 10 ms 292 KB Output is correct
32 Correct 13 ms 208 KB Output is correct
33 Correct 13 ms 208 KB Output is correct
34 Correct 9 ms 208 KB Output is correct
35 Correct 8 ms 208 KB Output is correct
36 Correct 11 ms 208 KB Output is correct
37 Correct 8 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 8 ms 256 KB Output is correct
41 Correct 12 ms 208 KB Output is correct
42 Correct 8 ms 208 KB Output is correct
43 Correct 10 ms 208 KB Output is correct
44 Correct 9 ms 208 KB Output is correct
45 Correct 8 ms 208 KB Output is correct
46 Correct 6 ms 260 KB Output is correct
47 Correct 10 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 7 ms 208 KB Output is correct
51 Correct 11 ms 208 KB Output is correct
52 Correct 9 ms 208 KB Output is correct
53 Correct 12 ms 208 KB Output is correct
54 Correct 8 ms 208 KB Output is correct
55 Correct 12 ms 208 KB Output is correct
56 Correct 6 ms 208 KB Output is correct
57 Correct 6 ms 208 KB Output is correct
58 Correct 6 ms 208 KB Output is correct
59 Correct 8 ms 208 KB Output is correct
60 Correct 12 ms 208 KB Output is correct
61 Correct 6 ms 208 KB Output is correct
62 Correct 7 ms 208 KB Output is correct
63 Correct 8 ms 288 KB Output is correct
64 Correct 10 ms 208 KB Output is correct
65 Correct 13 ms 208 KB Output is correct
66 Correct 10 ms 208 KB Output is correct
67 Correct 11 ms 208 KB Output is correct
68 Correct 8 ms 208 KB Output is correct
69 Correct 13 ms 208 KB Output is correct
70 Correct 12 ms 208 KB Output is correct
71 Correct 11 ms 296 KB Output is correct
72 Correct 8 ms 228 KB Output is correct
73 Correct 10 ms 288 KB Output is correct
74 Correct 8 ms 208 KB Output is correct
75 Correct 15 ms 208 KB Output is correct
76 Correct 13 ms 256 KB Output is correct
77 Correct 8 ms 208 KB Output is correct
78 Correct 12 ms 284 KB Output is correct
79 Correct 13 ms 208 KB Output is correct
80 Correct 8 ms 208 KB Output is correct
81 Correct 11 ms 208 KB Output is correct
82 Correct 12 ms 208 KB Output is correct