제출 #928388

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928388		n1k	가장 긴 여행 (IOI23_longesttrip)	C++17	30 / 100	761 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
    2 CC dann sind alle nodes in den CCs FC
    alle nodes die nicht mit node u verbunden sind sind FC CHECK


INSIGHTS
    seperate nodes in 2 things

    alle nodes die nicht mit node u verbunden sind sind FC CHECK

*/

std::vector<int> longest_trip(int N, int D){
    vector<int> ans;
    for(int start = 0; start<N/2; start++){
        vector<int> path = {start};

        for(int i=1; i<N;i++){
            int cur = (start + i) % N;
            if(are_connected({path[path.size()-1]}, {cur})){
                path.push_back(cur);
            }
        }
        if(ans.size() < path.size()){
            ans = path;
        }
    }
    //cout << "len: " << ans.size() << endl;
    return ans;
}

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