Submission #980594

# Submission time Handle Problem Language Result Execution time Memory
980594 2024-05-12T09:09:35 Z 12345678 Longest Trip (IOI23_longesttrip) C++17
100 / 100
12 ms 864 KB
#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=305;

std::vector<int> longest_trip(int N, int D)
{
    vector<int> d[2];
    d[0].push_back(0);
    d[1].push_back(1);
    bool not_connected=0;
    for (int i=2; i<N; i++)
    {
        if (are_connected(vector<int> {d[0].back()}, vector<int> {i}))
        {
            not_connected=0;
            d[0].push_back(i);
            continue;
        }
        if (not_connected||are_connected(vector<int> {d[1].back()}, vector<int> {i}))
        {
            not_connected=1;
            d[1].push_back(i);
            continue;
        }
        if (d[1].size()==1) not_connected=1;
        else not_connected=0;
        while (!d[1].empty()) d[0].push_back(d[1].back()), d[1].pop_back();
        d[1].push_back(i);
    }
    if (!are_connected(d[0], d[1])) return d[0].size()>d[1].size()?d[0]:d[1];
    if (are_connected(vector<int> {d[0].front()}, vector<int> {d[1].front()}))
    {
        reverse(d[0].begin(), d[0].end());
        for (auto x:d[1]) d[0].push_back(x);
        return d[0];
    }
    if (are_connected(vector<int> {d[0].front()}, vector<int> {d[1].back()}))
    {
        for (auto x:d[0]) d[1].push_back(x);
        return d[1];
    }
    if (are_connected(vector<int> {d[0].back()}, vector<int> {d[1].front()}))
    {
        for (auto x:d[1]) d[0].push_back(x);
        return d[0];
    }
    if (are_connected(vector<int> {d[0].back()}, vector<int> {d[1].back()}))
    {
        reverse(d[1].begin(), d[1].end());
        for (auto x:d[1]) d[0].push_back(x);
        return d[0];
    }
    int l=0, r=d[0].size()-1;
    while (l<r)
    {
        int md=(l+r)/2;
        vector<int> a;
        for (int i=0; i<=md; i++) a.push_back(d[0][i]);
        if (are_connected(a, d[1])) r=md;
        else l=md+1; 
    }
    int x=l;
    l=0, r=d[1].size()-1;
    while (l<r)
    {
        int md=(l+r)/2;
        vector<int> a;
        for (int i=0; i<=md; i++) a.push_back(d[1][i]);
        if (are_connected(a, vector<int> {d[0][x]})) r=md;
        else l=md+1;
    }
    vector<int> res;
    for (int i=x+1; i<d[0].size(); i++) res.push_back(d[0][i]);
    for (int i=0; i<=x; i++) res.push_back(d[0][i]);
    for (int i=l; i<d[1].size(); i++) res.push_back(d[1][i]);
    for (int i=0; i<l; i++) res.push_back(d[1][i]);
    return res;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:76:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for (int i=x+1; i<d[0].size(); i++) res.push_back(d[0][i]);
      |                     ~^~~~~~~~~~~~
longesttrip.cpp:78:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for (int i=l; i<d[1].size(); i++) res.push_back(d[1][i]);
      |                   ~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 608 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 12 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 6 ms 600 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 428 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 436 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 6 ms 340 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 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 8 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 7 ms 600 KB Output is correct
21 Correct 5 ms 436 KB Output is correct
22 Correct 5 ms 436 KB Output is correct
23 Correct 5 ms 440 KB Output is correct
24 Correct 5 ms 604 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 5 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 5 ms 432 KB Output is correct
37 Correct 5 ms 600 KB Output is correct
38 Correct 5 ms 600 KB Output is correct
39 Correct 6 ms 600 KB Output is correct
40 Correct 6 ms 600 KB Output is correct
41 Correct 5 ms 600 KB Output is correct
42 Correct 6 ms 600 KB Output is correct
43 Correct 5 ms 600 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 8 ms 344 KB Output is correct
50 Correct 5 ms 436 KB Output is correct
51 Correct 6 ms 436 KB Output is correct
52 Correct 7 ms 344 KB Output is correct
53 Correct 5 ms 344 KB Output is correct
54 Correct 6 ms 600 KB Output is correct
55 Correct 5 ms 344 KB Output is correct
56 Correct 6 ms 608 KB Output is correct
57 Correct 6 ms 600 KB Output is correct
58 Correct 7 ms 692 KB Output is correct
59 Correct 6 ms 604 KB Output is correct
60 Correct 6 ms 604 KB Output is correct
61 Correct 6 ms 600 KB Output is correct
62 Correct 8 ms 440 KB Output is correct
63 Correct 6 ms 444 KB Output is correct
64 Correct 7 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 440 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 688 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 5 ms 344 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 4 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 10 ms 344 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 6 ms 440 KB Output is correct
38 Correct 8 ms 436 KB Output is correct
39 Correct 8 ms 344 KB Output is correct
40 Correct 5 ms 596 KB Output is correct
41 Correct 5 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 5 ms 436 KB Output is correct
45 Correct 5 ms 604 KB Output is correct
46 Correct 7 ms 604 KB Output is correct
47 Correct 5 ms 608 KB Output is correct
48 Correct 5 ms 600 KB Output is correct
49 Correct 5 ms 344 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Correct 7 ms 344 KB Output is correct
52 Correct 6 ms 344 KB Output is correct
53 Correct 5 ms 344 KB Output is correct
54 Correct 6 ms 600 KB Output is correct
55 Correct 6 ms 344 KB Output is correct
56 Correct 5 ms 344 KB Output is correct
57 Correct 5 ms 344 KB Output is correct
58 Correct 6 ms 600 KB Output is correct
59 Correct 6 ms 344 KB Output is correct
60 Correct 5 ms 344 KB Output is correct
61 Correct 6 ms 344 KB Output is correct
62 Correct 5 ms 600 KB Output is correct
63 Correct 6 ms 600 KB Output is correct
64 Correct 7 ms 604 KB Output is correct
65 Correct 6 ms 440 KB Output is correct
66 Correct 7 ms 444 KB Output is correct
67 Correct 7 ms 596 KB Output is correct
68 Correct 6 ms 864 KB Output is correct
69 Correct 6 ms 696 KB Output is correct
70 Correct 6 ms 696 KB Output is correct
71 Correct 5 ms 856 KB Output is correct
72 Correct 7 ms 604 KB Output is correct
73 Correct 6 ms 440 KB Output is correct
74 Correct 6 ms 604 KB Output is correct
75 Correct 6 ms 440 KB Output is correct
76 Correct 6 ms 600 KB Output is correct
77 Correct 5 ms 856 KB Output is correct
78 Correct 6 ms 692 KB Output is correct
79 Correct 7 ms 608 KB Output is correct
80 Correct 6 ms 856 KB Output is correct
81 Correct 7 ms 444 KB Output is correct
82 Correct 6 ms 440 KB Output is correct