Submission #1063942

# Submission time Handle Problem Language Result Execution time Memory
1063942 2024-08-18T06:27:40 Z parsadox2 Longest Trip (IOI23_longesttrip) C++17
40 / 100
70 ms 708 KB
#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 256;
int n , d;
bool in_path[N];

vector <int> maximal()
{
    for(int i = 0 ; i < n ; i++)
        in_path[i] = false;
    vector <int> vec;
    vec.push_back(0);
    in_path[0] = true;
    while(vec.size() < n)
    {
        vector <int> A; A.push_back(vec.back());
        vector <int> B;
        for(int i = 0 ; i < n ; i++)  if(!in_path[i])
            B.push_back(i);
        if(!are_connected(A , B))
            break;
        int low = 0 , high = B.size();
        while(high - low > 1)
        {
            int mid = (low + high) >> 1;
            vector <int> tmp;
            for(int i = low ; i < mid ; i++)
                tmp.push_back(B[i]);
            if(are_connected(A , tmp))
                high = mid;
            else
                low = mid;
        }
        in_path[B[low]] = true;
        vec.push_back(B[low]);
    }
    reverse(vec.begin() , vec.end());
    while(vec.size() < n)
    {
        vector <int> A;  A.push_back(vec.back());
        vector <int> B;
        for(int i = 0 ; i < n ; i++)  if(!in_path[i])
            B.push_back(i);
        if(!are_connected(A , B))
            break;
        int low = 0 , high = B.size();
        while(high - low > 1)
        {
            int mid = (low + high) >> 1;
            vector <int> tmp;
            for(int i = low ; i < mid ; i++)
                tmp.push_back(B[i]);
            if(are_connected(A , tmp))
                high = mid;
            else
                low = mid;
        }
        in_path[B[low]] = true;
        vec.push_back(B[low]);
    }
    return vec;
}

vector<int> longest_trip(int nn, int dd)
{
    n = nn;
    d = dd;
    vector <int> vec = maximal();
    if(vec.size() > n / 2)
        return vec;
    vector <int> comp;
    for(int i = 0 ; i < n ; i++)  if(!in_path[i])
        comp.push_back(i);
    return comp;
    return vec;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> maximal()':
longesttrip.cpp:17:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   17 |     while(vec.size() < n)
      |           ~~~~~~~~~~~^~~
longesttrip.cpp:41:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |     while(vec.size() < n)
      |           ~~~~~~~~~~~^~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:72:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |     if(vec.size() > n / 2)
      |        ~~~~~~~~~~~^~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 13 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 24 ms 344 KB Output is correct
4 Correct 41 ms 344 KB Output is correct
5 Correct 60 ms 616 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 14 ms 344 KB Output is correct
3 Correct 24 ms 344 KB Output is correct
4 Correct 41 ms 344 KB Output is correct
5 Correct 58 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 13 ms 344 KB Output is correct
8 Correct 38 ms 344 KB Output is correct
9 Correct 37 ms 344 KB Output is correct
10 Correct 57 ms 344 KB Output is correct
11 Correct 51 ms 468 KB Output is correct
12 Correct 58 ms 344 KB Output is correct
13 Correct 59 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 18 ms 344 KB Output is correct
3 Correct 23 ms 344 KB Output is correct
4 Correct 42 ms 344 KB Output is correct
5 Correct 57 ms 344 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 13 ms 344 KB Output is correct
8 Correct 24 ms 344 KB Output is correct
9 Correct 35 ms 344 KB Output is correct
10 Correct 47 ms 596 KB Output is correct
11 Correct 69 ms 344 KB Output is correct
12 Correct 60 ms 344 KB Output is correct
13 Correct 56 ms 600 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 18 ms 344 KB Output is correct
17 Correct 29 ms 344 KB Output is correct
18 Correct 26 ms 344 KB Output is correct
19 Correct 40 ms 344 KB Output is correct
20 Correct 36 ms 344 KB Output is correct
21 Correct 59 ms 344 KB Output is correct
22 Correct 62 ms 600 KB Output is correct
23 Correct 59 ms 344 KB Output is correct
24 Correct 66 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 13 ms 344 KB Output is correct
28 Correct 16 ms 344 KB Output is correct
29 Correct 11 ms 344 KB Output is correct
30 Correct 45 ms 412 KB Output is correct
31 Correct 22 ms 344 KB Output is correct
32 Correct 17 ms 344 KB Output is correct
33 Correct 40 ms 600 KB Output is correct
34 Correct 39 ms 344 KB Output is correct
35 Correct 40 ms 344 KB Output is correct
36 Correct 59 ms 344 KB Output is correct
37 Correct 64 ms 344 KB Output is correct
38 Correct 66 ms 708 KB Output is correct
39 Correct 59 ms 344 KB Output is correct
40 Correct 48 ms 464 KB Output is correct
41 Correct 35 ms 344 KB Output is correct
42 Correct 33 ms 344 KB Output is correct
43 Correct 35 ms 344 KB Output is correct
44 Correct 31 ms 344 KB Output is correct
45 Correct 12 ms 344 KB Output is correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 14 ms 344 KB Output is correct
48 Correct 14 ms 344 KB Output is correct
49 Correct 14 ms 344 KB Output is correct
50 Correct 34 ms 344 KB Output is correct
51 Correct 28 ms 344 KB Output is correct
52 Correct 27 ms 344 KB Output is correct
53 Correct 52 ms 344 KB Output is correct
54 Correct 39 ms 344 KB Output is correct
55 Correct 46 ms 340 KB Output is correct
56 Correct 54 ms 344 KB Output is correct
57 Correct 61 ms 356 KB Output is correct
58 Correct 69 ms 344 KB Output is correct
59 Correct 49 ms 344 KB Output is correct
60 Correct 42 ms 344 KB Output is correct
61 Correct 40 ms 344 KB Output is correct
62 Correct 44 ms 344 KB Output is correct
63 Correct 55 ms 344 KB Output is correct
64 Correct 47 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 26 ms 344 KB Output is correct
4 Partially correct 40 ms 600 KB Output is partially correct
5 Partially correct 61 ms 344 KB Output is partially correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 14 ms 344 KB Output is correct
8 Correct 35 ms 344 KB Output is correct
9 Partially correct 39 ms 600 KB Output is partially correct
10 Partially correct 62 ms 344 KB Output is partially correct
11 Partially correct 70 ms 340 KB Output is partially correct
12 Partially correct 62 ms 344 KB Output is partially correct
13 Partially correct 61 ms 344 KB Output is partially correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Incorrect 1 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -