Submission #926167

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
926167	2024-02-12T16:14:05 Z	n1k	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	10 ms	608 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

/*

D=3 N
all nodes have indegree N-1

D=2
OBSERVE:
Graph is connected
if 2 nodes are not connected all other nodes are connected to them
degree in N-1 or N-2
man kann immer zwischen 2er paaren huepfen

D=1
OBSERVE
    if 2 nodes are not connected all other nodes are connected to either node

find longest path ?

consider a connected component what can we say about it
    can we always find a path of length == SZ(component)

connected component
    add a node
    if there are 2 nodes not conneced then new node also has to be connected there

GUESS
    CC is fully connected besides 1 or 2 nodes


*/

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

    int start = 0;

    if(are_connected({0}, {1})){
        start = 2;
    }else{
        start = 3;
    }

    ans.push_back(start%N);

    for(int i=0; i<N-1; i++){
        int cur = (start + i) % N, next = (start + i + 1) % N;
        if(are_connected({cur}, {next})){
            ans.push_back(next);
        }else{
            rest.push_back(next);
            ans.push_back((next+1) % N);
            i++;
        }
    }
    ans.insert(ans.end(), rest.begin(), rest.end());
    return ans;
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 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	344 KB	Output is correct
5	Correct	5 ms	600 KB	Output is correct
6	Correct	6 ms	344 KB	Output is correct
7	Correct	5 ms	344 KB	Output is correct
8	Correct	4 ms	344 KB	Output is correct
9	Correct	4 ms	600 KB	Output is correct
10	Correct	4 ms	344 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	6 ms	600 KB	Output is correct
13	Correct	4 ms	344 KB	Output is correct

Subtask #3

0.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	340 KB	Output is correct
2	Correct	5 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	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	7 ms	344 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	4 ms	340 KB	Output is correct
11	Correct	5 ms	600 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	4 ms	600 KB	Output is correct
14	Incorrect	0 ms	344 KB	Incorrect
15	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	344 KB	Output is correct
2	Correct	5 ms	344 KB	Output is correct
3	Correct	7 ms	344 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	6 ms	344 KB	Output is correct
7	Correct	5 ms	344 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	4 ms	440 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	4 ms	608 KB	Output is correct
14	Incorrect	0 ms	340 KB	Incorrect
15	Halted	0 ms	0 KB	-