Submission #926150

#	Time	Username	Problem	Language	Result	Execution time	Memory
926150		n1k	Longest Trip (IOI23_longesttrip)	C++17	5 / 100	3 ms	600 KiB

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(N); 
    iota(ans.begin(), ans.end(), 0);

    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 25
• Subtask 4: 0 / 60