# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1007015 | 3as8 | Longest Trip (IOI23_longesttrip) | C++17 | 990 ms | 2097152 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "longesttrip.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
bool con[300][300];
bool vis[300];
ll n;
void dfs(ll startIndex, vector<int>& curr) {
vis[startIndex] = true;
curr.push_back(startIndex);
for(int i = 0; i < n; i++) {
if(con[startIndex][i] && !vis[i]) {
dfs(startIndex, curr);
}
}
}
std::vector<int> longest_trip(int N, int D) {
n = N;
for(int i = 0; i < n; i++) {
for(int j = i + 1; j < n; j++) {
con[i][j] = con[j][i] = are_connected({i}, {j});
}
}
vector<ll> ans;
ll mx = LLONG_MIN;
for(int j = 0; j < n; j++) vis[j] = false;
vector<int> curr;
dfs(0, curr);
return curr;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |