oj.uz

Submission #839722

# Submission time Handle Problem Language Result Execution time Memory
839722 2023-08-30T15:48:55 Z model_code Longest Trip (IOI23_longesttrip) C++17
100 / 100
 17 ms 408 KB 
// correct/sol_hazem_D1.cpp

#include "longesttrip.h"

#include <random>
#include <algorithm>

using namespace 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());

    vector<int> t1 = {ids[0]}, t2;
    bool relation = false;
    for (int j = 1; j < N; ++j)
    {
        int i = ids[j];
        if (are_connected({t1.back()}, {i}))
        {
            t1.push_back(i);
            relation = false;
        }
        else
        {
            if (t2.empty())
            {
                t2 = {i};
                relation = true;
            }
            else if (relation)
            {
                t2.push_back(i);
            }
            else
            {
                if (are_connected({i}, {t2.back()}))
                {
                    t2.push_back(i);
                    relation = true;
                }
                else
                {
                    int x = i;
                    int y = -1, z = -1;
                    if (j + 1 < N)
                        y = ids[j + 1];
                    if (j + 2 < N)
                        z = ids[j + 2];
                    j += 2;
                    if (y != -1 && !are_connected({x}, {y}))
                    {
                        t1.push_back(y);
                        y = -1;
                    }
                    if (z != -1 && !are_connected({x}, {z}))
                    {
                        t1.push_back(z);
                        z = -1;
                    }
                    t1.insert(t1.end(), t2.rbegin(), t2.rend());
                    if (y == -1)
                        t2 = {x};
                    else
                        t2 = {y, x};
                    if (z != -1)
                        t2.push_back(z);
                    relation = false;
                }
            }
        }
    }

    if (t2.size() > t1.size())
        swap(t1, t2);
    if (t2.empty() || !are_connected(t1, t2))
    {
        return t1;
    }
    if (are_connected({t1.back()}, {t2[0]}))
    {
        t1.insert(t1.end(), t2.begin(), t2.end());
        return t1;
    }
    reverse(t2.begin(), t2.end());
    if (are_connected({t1.back()}, {t2[0]}))
    {
        t1.insert(t1.end(), t2.begin(), t2.end());
        return t1;
    }
    reverse(t1.begin(), t1.end());
    if (are_connected({t1.back()}, {t2[0]}))
    {
        t1.insert(t1.end(), t2.begin(), t2.end());
        return t1;
    }
    reverse(t2.begin(), t2.end());
    if (are_connected({t1.back()}, {t2[0]}))
    {
        t1.insert(t1.end(), t2.begin(), t2.end());
        return t1;
    }
    int lo = 0, hi = t2.size();
    while (lo + 1 < hi)
    {
        int mid = (lo + hi) / 2;
        if (are_connected(t1, vector<int>(t2.begin() + mid, t2.begin() + hi)))
        {
            lo = mid;
        }
        else
        {
            hi = mid;
        }
    }
    int x = lo;
    lo = 0, hi = t1.size();
    while (lo + 1 < hi)
    {
        int mid = (lo + hi) / 2;
        if (are_connected({t2[x]}, vector<int>(t1.begin() + mid, t1.begin() + hi)))
        {
            lo = mid;
        }
        else
        {
            hi = mid;
        }
    }
    int y = lo;
    vector<int> t(t1.begin() + y + 1, t1.end());
    t.insert(t.end(), t1.begin(), t1.begin() + y + 1);
    t.insert(t.end(), t2.begin() + x, t2.end());
    t.insert(t.end(), t2.begin(), t2.begin() + x);

    return t;
}

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 228 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 9 ms 208 KB Output is correct
4 Correct 9 ms 276 KB Output is correct
5 Correct 8 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 208 KB Output is correct
2 Correct 9 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 4 ms 224 KB Output is correct
5 Correct 9 ms 208 KB Output is correct
6 Correct 12 ms 208 KB Output is correct
7 Correct 5 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 8 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 12 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 8 ms 208 KB Output is correct
17 Correct 11 ms 208 KB Output is correct
18 Correct 9 ms 288 KB Output is correct
19 Correct 9 ms 208 KB Output is correct
20 Correct 10 ms 208 KB Output is correct
21 Correct 11 ms 208 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 8 ms 208 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 7 ms 208 KB Output is correct
26 Correct 9 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 276 KB Output is correct
30 Correct 11 ms 208 KB Output is correct
31 Correct 7 ms 208 KB Output is correct
32 Correct 17 ms 208 KB Output is correct
33 Correct 15 ms 208 KB Output is correct
34 Correct 10 ms 208 KB Output is correct
35 Correct 13 ms 208 KB Output is correct
36 Correct 11 ms 208 KB Output is correct
37 Correct 12 ms 208 KB Output is correct
38 Correct 12 ms 332 KB Output is correct
39 Correct 10 ms 208 KB Output is correct
40 Correct 8 ms 208 KB Output is correct
41 Correct 12 ms 288 KB Output is correct
42 Correct 8 ms 256 KB Output is correct
43 Correct 10 ms 288 KB Output is correct
44 Correct 10 ms 272 KB Output is correct
45 Correct 8 ms 288 KB Output is correct
46 Correct 9 ms 208 KB Output is correct
47 Correct 10 ms 208 KB Output is correct
48 Correct 7 ms 208 KB Output is correct
49 Correct 6 ms 208 KB Output is correct
50 Correct 12 ms 208 KB Output is correct
51 Correct 9 ms 244 KB Output is correct
52 Correct 8 ms 208 KB Output is correct
53 Correct 11 ms 208 KB Output is correct
54 Correct 8 ms 208 KB Output is correct
55 Correct 9 ms 208 KB Output is correct
56 Correct 6 ms 256 KB Output is correct
57 Correct 8 ms 208 KB Output is correct
58 Correct 11 ms 208 KB Output is correct
59 Correct 11 ms 332 KB Output is correct
60 Correct 6 ms 288 KB Output is correct
61 Correct 9 ms 208 KB Output is correct
62 Correct 11 ms 292 KB Output is correct
63 Correct 11 ms 208 KB Output is correct
64 Correct 9 ms 248 KB Output is correct
65 Correct 13 ms 292 KB Output is correct
66 Correct 9 ms 208 KB Output is correct
67 Correct 12 ms 208 KB Output is correct
68 Correct 11 ms 208 KB Output is correct
69 Correct 10 ms 288 KB Output is correct
70 Correct 9 ms 292 KB Output is correct
71 Correct 5 ms 292 KB Output is correct
72 Correct 7 ms 292 KB Output is correct
73 Correct 12 ms 292 KB Output is correct
74 Correct 12 ms 208 KB Output is correct
75 Correct 11 ms 296 KB Output is correct
76 Correct 9 ms 208 KB Output is correct
77 Correct 9 ms 408 KB Output is correct
78 Correct 12 ms 292 KB Output is correct
79 Correct 10 ms 312 KB Output is correct
80 Correct 10 ms 280 KB Output is correct
81 Correct 13 ms 208 KB Output is correct
82 Correct 12 ms 208 KB Output is correct