| Task: | Longest route |
| Sender: | aalto25h_005 |
| Submission time: | 2025-10-22 17:30:44 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | RUNTIME ERROR |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | RUNTIME ERROR | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | RUNTIME ERROR | 0.15 s | details |
| #7 | ACCEPTED | 0.16 s | details |
| #8 | ACCEPTED | 0.17 s | details |
| #9 | ACCEPTED | 0.17 s | details |
| #10 | ACCEPTED | 0.16 s | details |
| #11 | ACCEPTED | 0.15 s | details |
| #12 | RUNTIME ERROR | 0.55 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | ACCEPTED | 0.00 s | details |
| #15 | RUNTIME ERROR | 0.49 s | details |
| #16 | ACCEPTED | 0.00 s | details |
| #17 | RUNTIME ERROR | 0.49 s | details |
| #18 | TIME LIMIT EXCEEDED | -- | details |
| #19 | ACCEPTED | 0.00 s | details |
| #20 | ACCEPTED | 0.10 s | details |
| #21 | ACCEPTED | 0.00 s | details |
Code
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//
void dfs(vector<vector<long long>> &v, vector<bool> &visited, long long start, long long end, vector<pair<long long, vector<long long>>> &solutions, vector<long long> &path) {
visited[start] = true;
path.push_back(start);
if (start == end) {
solutions.push_back({path.size(), path});
}
for (auto neighbour : v[start]) {
if (not visited[neighbour])
dfs(v, visited, neighbour, end, solutions, path);
}
path.pop_back();
visited[start] = false;
}
int main() {
long long n, m;
cin >> n >> m;
vector<vector<long long>> adj(n);
for (long long i = 0; i < m; ++i) {
long long u, v;
cin >> u >> v;
adj[u-1].push_back(v-1);
}
// Prlong longing
/*
cout << "This are the connections:" << endl;
for (long long i = 0; i < n; ++i) {
cout << i << ": ";
for (auto neig : adj[i])
cout << neig << " ";
cout << endl;
}
*/
// DFSs
vector<pair<long long, vector<long long>>> solutions;
vector<long long> path;
vector<bool> visited(n, false);
dfs(adj, visited, 0, n - 1, solutions, path);
// Best solution
auto it = max_element(solutions.begin(), solutions.end());
// prlong long solution
cout << (*it).first << endl;
for (auto city : (*it).second)
cout << city + 1 << " ";
cout << endl;
// Prlong longing solutions
/*
for (auto sol : solutions) {
cout << "Solution size: " << sol.first << endl;
for (auto city : sol.second)
cout << city << " ";
cout << endl;
}
*/
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 2 6 1 2 4 6 5 6 ... |
| correct output |
|---|
| 5 1 2 5 6 10 |
| user output |
|---|
| 5 1 2 5 6 10 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 10 10 3 9 6 5 6 9 2 8 ... |
| correct output |
|---|
| 4 1 2 8 10 |
| user output |
|---|
| 4 1 2 8 10 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 10 10 5 10 4 10 8 7 7 10 ... |
| correct output |
|---|
| 3 1 4 10 |
| user output |
|---|
| 3 1 4 10 |
Test 4
Verdict: RUNTIME ERROR
| input |
|---|
| 10 10 8 10 2 6 2 10 7 10 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| (empty) |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 10 10 8 4 2 10 1 3 4 9 ... |
| correct output |
|---|
| 5 1 8 7 2 10 |
| user output |
|---|
| 5 1 8 7 2 10 |
Test 6
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 200000 86085 57043 45527 29537 41919 84699 95993 82082 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| (empty) |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 10961 53490 59843 36636 40674 66772 32618 41570 ... |
| correct output |
|---|
| 31 1 37239 44082 21537 90572 7332... |
| user output |
|---|
| 31 1 37239 44082 21537 90572 7332... |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 87375 76468 38855 27547 49415 83191 38572 1524 ... |
| correct output |
|---|
| 35 1 91343 59014 56722 34054 3875... |
| user output |
|---|
| 35 1 91343 59014 56722 34054 3875... |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 17973 70097 19982 80323 96486 2404 75650 63274 ... |
| correct output |
|---|
| 36 1 25685 90292 59380 91058 2663... |
| user output |
|---|
| 36 1 25685 90292 59380 91058 2663... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 74343 53088 97443 7885 64807 58252 9374 33312 ... |
| correct output |
|---|
| 28 1 26390 15278 11333 48479 6881... |
| user output |
|---|
| 28 1 26390 15278 11333 48479 6881... |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 100000 199998 1 100000 1 100000 2 100000 2 100000 ... |
| correct output |
|---|
| 2 1 100000 |
| user output |
|---|
| 2 1 100000 |
Test 12
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 199998 1 2 1 2 2 3 2 3 ... |
| correct output |
|---|
| 100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| (empty) |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 2 1 1 2 |
| correct output |
|---|
| 2 1 2 |
| user output |
|---|
| 2 1 2 |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 5 4 1 2 2 3 3 4 1 5 |
| correct output |
|---|
| 2 1 5 |
| user output |
|---|
| 2 1 5 |
Test 15
Verdict: RUNTIME ERROR
| input |
|---|
| 99999 149997 1 3 3 5 5 7 7 9 ... |
| correct output |
|---|
| 99999 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| (empty) |
Test 16
Verdict: ACCEPTED
| input |
|---|
| 3 2 1 3 3 2 |
| correct output |
|---|
| 2 1 3 |
| user output |
|---|
| 2 1 3 |
Test 17
Verdict: RUNTIME ERROR
| input |
|---|
| 99999 149997 1 2 2 4 4 6 6 8 ... |
| correct output |
|---|
| 99999 1 3 2 5 4 7 6 9 8 11 10 13 12 ... |
| user output |
|---|
| (empty) |
Test 18
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 1 2 1 3 1 4 1 5 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| (empty) |
Test 19
Verdict: ACCEPTED
| input |
|---|
| 5 4 2 1 3 1 1 4 1 5 |
| correct output |
|---|
| 2 1 5 |
| user output |
|---|
| 2 1 5 |
Test 20
Verdict: ACCEPTED
| input |
|---|
| 100000 99999 99999 100000 99998 99999 99997 99998 99996 99997 ... |
| correct output |
|---|
| 100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
Test 21
Verdict: ACCEPTED
| input |
|---|
| 4 4 3 1 3 4 1 2 2 4 |
| correct output |
|---|
| 3 1 2 4 |
| user output |
|---|
| 3 1 2 4 |
