oj.uz

Submission #840493

# Submission time Handle Problem Language Result Execution time Memory
840493 2023-08-31T12:29:12 Z ogkostya Longest Trip (IOI23_longesttrip) C++17
85 / 100
 21 ms 336 KB 
#include "longesttrip.h"

std::vector<int> longest_trip(int N, int D)
{

    std::vector<int> an1 = {};
    std::vector<int> an2 = {};

    an1.push_back(0);

    std::vector<int> temp1 = {};
    std::vector<int> temp2 = {};
    for (int i = 1; i < N; i++)
    {
        temp1.clear();
        temp1.push_back(i);
        temp2.clear();
        temp2.push_back(an1.back());

        if (are_connected(temp1, temp2))
        {
            an1.push_back(i);
        }
        else
        {
            if (an2.size() == 0)
            {
                an2.push_back(i);
            }
            else
            {
                temp2.clear();
                temp2.push_back(an2.back());
                if (are_connected(temp1, temp2))
                {
                    an2.push_back(i);
                }
                else
                {
                    while (an2.size() > 0)
                    {
                        an1.push_back(an2.back());
                        an2.pop_back();
                    }
                    an2.push_back(i);
                }
            }
        }
    }

    if (an2.size() > 0)
    {
        if (an2.size() > an1.size())
        {
            std::vector<int> an3 = an1;
            an1 = an2;
            an2 = an3;
        }

        temp1.clear();
        temp1.push_back(an1.back());
        temp2.clear();
        temp2.push_back(an2.back());
        if (are_connected(temp1, temp2))
        {
            while (an2.size() > 0)
            {
                an1.push_back(an2.back());
                an2.pop_back();
            }
        }
        else
        {
            temp2.clear();
            temp2.push_back(an2.front());
            if (are_connected(temp1, temp2))
            {
                int l = an2.size();
                for (int i = 0; i < l; i++)
                {
                    an1.push_back(an2[i]);
                }
            }
            else
            {
                temp1.clear();
                temp1.push_back(an1.front());
                temp2.clear();
                temp2.push_back(an2.back());
                if (are_connected(temp1, temp2))
                {
                    int l = an1.size();
                    for (int i = 0; i < l; i++)
                    {
                        an2.push_back(an1[i]);
                    }
                    an1 = an2;
                }
                else
                {
                    if (are_connected(an1, an2))
                    {
                        int l = 0, r = an1.size() - 1;
                        while (l < r)
                        {
                            int m = (l + r) / 2;
                            temp1.clear();
                            for (int i = l; i <= m; i++)
                            {
                                temp1.push_back(an1[i]);
                            }
                            if (are_connected(temp1, an2))
                            {
                                r = m;
                            }
                            else
                            {
                                l = m + 1;
                            }
                        }
                        int c1 = l;
                        temp1.clear();
                        temp1.push_back(an1[c1]);

                        l = 0, r = an2.size() - 1;
                        while (l < r)
                        {
                            int m = (l + r) / 2;
                            temp2.clear();
                            for (int i = l; i <= m; i++)
                            {
                                temp2.push_back(an2[i]);
                            }
                            if (are_connected(temp1, temp2))
                            {
                                r = m;
                            }
                            else
                            {
                                l = m + 1;
                            }
                        }
                        int c2 = l;

                        std::vector<int> an3 = {};
                        int l1 = an1.size();
                        int l2 = an2.size();

                        for (int i = c1+1; i < l1; i++)
                        {
                            an3.push_back(an1[i]);
                        }
                        for (int i = 0; i <= c1; i++)
                        {
                            an3.push_back(an1[i]);
                        }
                        for (int i = c2; i < l2; i++)
                        {
                            an3.push_back(an2[i]);
                        }
                        for (int i = 0; i < c2; i++)
                        {
                            an3.push_back(an2[i]);
                        }
                        an1 = an3;
                    }
                }
            }
        }
    }

    return an1;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 260 KB Output is correct
2 Correct 8 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 7 ms 208 KB Output is correct
5 Correct 8 ms 312 KB Output is correct
6 Correct 11 ms 208 KB Output is correct
7 Correct 8 ms 260 KB Output is correct
8 Correct 7 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 7 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct

Subtask #3
25.0 / 25.0

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

Subtask #4
45.0 / 60.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 10 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 7 ms 208 KB Output is correct
7 Correct 8 ms 208 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 10 ms 256 KB Output is correct
10 Correct 6 ms 208 KB Output is correct
11 Correct 5 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 6 ms 256 KB Output is correct
14 Correct 21 ms 208 KB Output is correct
15 Correct 17 ms 208 KB Output is correct
16 Correct 14 ms 208 KB Output is correct
17 Correct 10 ms 240 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 10 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 17 ms 208 KB Output is correct
23 Correct 10 ms 208 KB Output is correct
24 Correct 12 ms 208 KB Output is correct
25 Correct 6 ms 208 KB Output is correct
26 Correct 7 ms 208 KB Output is correct
27 Correct 7 ms 208 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 9 ms 208 KB Output is correct
30 Correct 7 ms 208 KB Output is correct
31 Correct 8 ms 208 KB Output is correct
32 Correct 12 ms 208 KB Output is correct
33 Correct 14 ms 256 KB Output is correct
34 Correct 13 ms 208 KB Output is correct
35 Correct 11 ms 208 KB Output is correct
36 Correct 13 ms 260 KB Output is correct
37 Correct 10 ms 208 KB Output is correct
38 Correct 15 ms 208 KB Output is correct
39 Correct 15 ms 208 KB Output is correct
40 Correct 13 ms 336 KB Output is correct
41 Correct 6 ms 208 KB Output is correct
42 Correct 10 ms 208 KB Output is correct
43 Correct 9 ms 208 KB Output is correct
44 Correct 8 ms 208 KB Output is correct
45 Correct 10 ms 208 KB Output is correct
46 Correct 7 ms 208 KB Output is correct
47 Correct 9 ms 260 KB Output is correct
48 Correct 7 ms 208 KB Output is correct
49 Correct 9 ms 208 KB Output is correct
50 Correct 9 ms 208 KB Output is correct
51 Partially correct 12 ms 208 KB Output is partially correct
52 Correct 12 ms 208 KB Output is correct
53 Correct 14 ms 296 KB Output is correct
54 Correct 10 ms 208 KB Output is correct
55 Correct 13 ms 208 KB Output is correct
56 Correct 6 ms 208 KB Output is correct
57 Partially correct 10 ms 208 KB Output is partially correct
58 Partially correct 13 ms 208 KB Output is partially correct
59 Partially correct 10 ms 208 KB Output is partially correct
60 Correct 11 ms 208 KB Output is correct
61 Correct 11 ms 256 KB Output is correct
62 Correct 7 ms 208 KB Output is correct
63 Partially correct 7 ms 208 KB Output is partially correct
64 Partially correct 7 ms 288 KB Output is partially correct
65 Partially correct 10 ms 208 KB Output is partially correct
66 Partially correct 11 ms 208 KB Output is partially correct
67 Correct 13 ms 208 KB Output is correct
68 Correct 12 ms 208 KB Output is correct
69 Partially correct 10 ms 292 KB Output is partially correct
70 Partially correct 10 ms 208 KB Output is partially correct
71 Correct 7 ms 208 KB Output is correct
72 Partially correct 10 ms 208 KB Output is partially correct
73 Partially correct 13 ms 288 KB Output is partially correct
74 Partially correct 10 ms 208 KB Output is partially correct
75 Correct 11 ms 208 KB Output is correct
76 Correct 11 ms 208 KB Output is correct
77 Correct 8 ms 208 KB Output is correct
78 Partially correct 9 ms 208 KB Output is partially correct
79 Correct 13 ms 208 KB Output is correct
80 Partially correct 7 ms 208 KB Output is partially correct
81 Correct 14 ms 208 KB Output is correct
82 Correct 14 ms 208 KB Output is correct