제출 #1309604

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309604		erering	Longest Trip (IOI23_longesttrip)	C++20	40 / 100	411 ms	508 KiB

longesttrip

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#include "longesttrip.h"
vector<int> longest_trip(int N, int D)
{
    bool connected[N][N];
    for(int i=0;i<N;i++){
        for(int j=i+1;j<N;j++){
            if(are_connected({i},{j}))connected[i][j]=connected[j][i]=1;
            else connected[i][j]=connected[j][i]=0;
        }
    }
    srand(532083257);
    vector<int> ans;
    for(int i=0;i<300;i++) {
        vector<int> a;
        for(int j=0;j<N;j++)a.pb(j);
        vector<int> vec;
        int y=rand()%N;
        vec.pb(a[y]);
        a.erase(a.begin()+y);
        for(int j=1;j<N;j++){
            vector<int> rem=a,put;
            while(rem.size()>0){
                int x=rand()%rem.size();
                if(connected[rem[x]][vec[j-1]]){
                    vec.pb(rem[x]);
                    int idx;
                    for(int k=0;k<a.size();k++){
                        if(a[k]==rem[x])idx=k;
                    }
                    a.erase(a.begin()+idx);
                    break;
                }
                put.pb(rem[x]);
                rem.erase(rem.begin()+x);
            }
            for(auto k:put)rem.pb(k);
            if(vec.size()==j)break;
        }
        if(vec.size()>ans.size())ans=vec;
    }
    return ans;
}

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