oj.uz

Submission #1030245

# Submission time Handle Problem Language Result Execution time Memory
1030245 2024-07-22T00:31:39 Z Agreb Longest Trip (IOI23_longesttrip) C++17
40 / 100
 28 ms 864 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;

vector <int> longest_trip(int N, int D){
    vector <int> path, clique, used(N);
    for (int i = 0; i <= 2; i++){
        for (int j = 0; j < i; j++){
            if (are_connected({i}, {j})){
                path = {i, j};
                used[i] = used[j] = 1;
                break;
            }
        }
        if (!path.empty()) break;
    }
    
    pair<int, int> non_edge{-1, -1};
    for (int v = 0; v < N; v++){
        if (used[v]) continue;
        int P = path.size();
        int st = path[0], fin = path[P-1];

        if (non_edge.second != -1 && are_connected({st}, {fin})){
            vector <int> check{non_edge.first, non_edge.second};
            for (int u : check){
                if (are_connected({u}, {v})){   
                    int i = -1;
                    for (int ii = 0; ii < P; ii++)
                        if (path[ii] == u) i = ii;
                             
                    vector <int> npath;
                    for (int j = 0; j < P; j++) 
                        npath.push_back(path[(j+i+1)%P]);
                    npath.push_back(v);
                    path = npath;
                    break;
                }
            }
            continue;
        }

        if (!are_connected(path, {v})){
            clique.push_back(v);
            continue;
        }

        if (are_connected({st}, {v})){
            reverse(path.begin(), path.end());
            path.push_back(v);
            continue;
        }
        else if (non_edge.second == -1) non_edge = {st, v};        

        if (are_connected({fin}, {v})){
            path.push_back(v);
            continue;
        }

        for (int i = 1; i < P-1; i++){
            if (are_connected({path[i]}, {v})){   
                vector <int> npath;
                for (int j = 0; j < P; j++) 
                    npath.push_back(path[(j+i+1)%P]);
                npath.push_back(v);
                path = npath;
                break;
            }
        }        
    }
    assert(path.size() + clique.size() == N);
    if (path.size() >= clique.size()) return path;
    else return clique;
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from longesttrip.cpp:1:
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:71:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   71 |     assert(path.size() + clique.size() == N);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 14 ms 344 KB Output is correct
4 Correct 16 ms 344 KB Output is correct
5 Correct 20 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 16 ms 344 KB Output is correct
4 Correct 11 ms 344 KB Output is correct
5 Correct 27 ms 344 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 11 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 11 ms 344 KB Output is correct
10 Correct 17 ms 440 KB Output is correct
11 Correct 14 ms 344 KB Output is correct
12 Correct 14 ms 468 KB Output is correct
13 Correct 12 ms 448 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 21 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 13 ms 344 KB Output is correct
8 Correct 11 ms 344 KB Output is correct
9 Correct 13 ms 344 KB Output is correct
10 Correct 19 ms 452 KB Output is correct
11 Correct 18 ms 864 KB Output is correct
12 Correct 14 ms 344 KB Output is correct
13 Correct 11 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 16 ms 344 KB Output is correct
17 Correct 16 ms 344 KB Output is correct
18 Correct 10 ms 416 KB Output is correct
19 Correct 14 ms 344 KB Output is correct
20 Correct 13 ms 444 KB Output is correct
21 Correct 18 ms 600 KB Output is correct
22 Correct 20 ms 600 KB Output is correct
23 Correct 17 ms 344 KB Output is correct
24 Correct 15 ms 708 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 13 ms 344 KB Output is correct
31 Correct 13 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 13 ms 344 KB Output is correct
34 Correct 12 ms 344 KB Output is correct
35 Correct 11 ms 344 KB Output is correct
36 Correct 17 ms 600 KB Output is correct
37 Correct 18 ms 344 KB Output is correct
38 Correct 14 ms 344 KB Output is correct
39 Correct 14 ms 344 KB Output is correct
40 Correct 11 ms 344 KB Output is correct
41 Correct 10 ms 344 KB Output is correct
42 Correct 17 ms 344 KB Output is correct
43 Correct 15 ms 444 KB Output is correct
44 Correct 14 ms 344 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 9 ms 344 KB Output is correct
47 Correct 13 ms 344 KB Output is correct
48 Correct 9 ms 344 KB Output is correct
49 Correct 10 ms 344 KB Output is correct
50 Correct 12 ms 344 KB Output is correct
51 Correct 14 ms 344 KB Output is correct
52 Correct 15 ms 344 KB Output is correct
53 Correct 14 ms 344 KB Output is correct
54 Correct 12 ms 344 KB Output is correct
55 Correct 13 ms 344 KB Output is correct
56 Correct 18 ms 444 KB Output is correct
57 Correct 26 ms 344 KB Output is correct
58 Correct 14 ms 436 KB Output is correct
59 Correct 14 ms 344 KB Output is correct
60 Correct 13 ms 600 KB Output is correct
61 Correct 16 ms 344 KB Output is correct
62 Correct 10 ms 344 KB Output is correct
63 Correct 11 ms 344 KB Output is correct
64 Correct 14 ms 596 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 14 ms 344 KB Output is correct
4 Correct 19 ms 344 KB Output is correct
5 Partially correct 28 ms 704 KB Output is partially correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 13 ms 344 KB Output is correct
9 Correct 11 ms 432 KB Output is correct
10 Partially correct 15 ms 344 KB Output is partially correct
11 Partially correct 19 ms 600 KB Output is partially correct
12 Partially correct 14 ms 444 KB Output is partially correct
13 Partially correct 15 ms 464 KB Output is partially correct
14 Correct 7 ms 344 KB Output is correct
15 Incorrect 1 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -