oj.uz

Submission #839727

# Submission time Handle Problem Language Result Execution time Memory
839727 2023-08-30T15:49:06 Z model_code Longest Trip (IOI23_longesttrip) C++17
25 / 100
 12 ms 288 KB 
// correct/solution-subtask3.cpp

#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();
    }
}

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);

    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 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

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

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Incorrect
2 Halted 0 ms 0 KB -