Submission #853565

# Submission time Handle Problem Language Result Execution time Memory
853565 2023-09-24T16:11:29 Z Ludissey Longest Trip (IOI23_longesttrip) C++17
40 / 100
704 ms 600 KB
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;

std::vector<int> longest_trip(int n, int d)
{
    if(d==2){
        vector<pair<int,int>> disc;
        for (int i = 0; i < n-1; i++) {
            for (int j = i+1; j < n; j++)
            {
                if(!are_connected({i}, {j})){
                    disc.push_back({i,j});
                    break;
                }
            }
        }
        vector<bool> rem(n);
        vector<int> path(disc.size()*2);
        int mid=disc.size();
        for (int i = 0; i < (int)disc.size(); i++)
        {
            path[i]=disc[i].first;
            path[i+mid]=disc[i].second;
            rem[disc[i].first]=true;
            rem[disc[i].second]=true;
        }
        for (int i = 0; i < n; i++) {
            if(!rem[i]) path.push_back(i);
        }
        if(disc.size()==1) swap(path[1],path[2]);
        return path;
    }
    vector<int> A;
    vector<int> B;
    A.push_back(0);
    for (int i = 1; i < n; i++)
    {
        if(are_connected({i}, {A.back()})) A.push_back(i);
        else if(B.size()==0 || are_connected({i}, {B.back()})) B.push_back(i);
        else {
            for (int x = B.size()-1; x >= 0; x--) A.push_back(B[x]);
            B.clear();
        }
    }
    if(A.size()<B.size()) swap(A,B);
    return A;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 25 ms 344 KB Output is correct
3 Correct 107 ms 344 KB Output is correct
4 Correct 327 ms 344 KB Output is correct
5 Correct 704 ms 412 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 16 ms 344 KB Output is correct
8 Correct 75 ms 344 KB Output is correct
9 Correct 170 ms 432 KB Output is correct
10 Correct 522 ms 416 KB Output is correct
11 Correct 441 ms 592 KB Output is correct
12 Correct 451 ms 428 KB Output is correct
13 Correct 445 ms 416 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 5 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 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 4 ms 436 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 4 ms 600 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 6 ms 500 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 5 ms 420 KB Output is correct
30 Correct 5 ms 596 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 4 ms 344 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 5 ms 600 KB Output is correct
38 Correct 5 ms 344 KB Output is correct
39 Correct 5 ms 344 KB Output is correct
40 Correct 6 ms 600 KB Output is correct
41 Correct 7 ms 344 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 6 ms 600 KB Output is correct
45 Correct 6 ms 540 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 5 ms 344 KB Output is correct
48 Correct 6 ms 348 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 4 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 4 ms 344 KB Output is correct
54 Correct 4 ms 344 KB Output is correct
55 Correct 5 ms 344 KB Output is correct
56 Correct 4 ms 344 KB Output is correct
57 Correct 6 ms 600 KB Output is correct
58 Correct 6 ms 344 KB Output is correct
59 Correct 7 ms 600 KB Output is correct
60 Correct 6 ms 344 KB Output is correct
61 Correct 6 ms 344 KB Output is correct
62 Correct 8 ms 344 KB Output is correct
63 Correct 7 ms 600 KB Output is correct
64 Correct 7 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -