| Task: | Longest route |
| Sender: | aalto25h_004 |
| Submission time: | 2025-10-22 17:09:32 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.01 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | WRONG ANSWER | 0.16 s | details |
| #7 | WRONG ANSWER | 0.16 s | details |
| #8 | WRONG ANSWER | 0.16 s | details |
| #9 | WRONG ANSWER | 0.16 s | details |
| #10 | WRONG ANSWER | 0.16 s | details |
| #11 | ACCEPTED | 0.15 s | details |
| #12 | ACCEPTED | 0.16 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | WRONG ANSWER | 0.01 s | details |
| #15 | WRONG ANSWER | 0.14 s | details |
| #16 | WRONG ANSWER | 0.00 s | details |
| #17 | ACCEPTED | 0.15 s | details |
| #18 | WRONG ANSWER | 0.10 s | details |
| #19 | WRONG ANSWER | 0.00 s | details |
| #20 | ACCEPTED | 0.10 s | details |
| #21 | ACCEPTED | 0.00 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
ll a,b;
vector<ll> adj[n+1];
for(ll i = 0; i<m; i++) {
cin >> a >> b;
adj[a].push_back(b);
}
if(adj[1].size() == 0) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
ll distance[n+1];
for (ll i = 1; i <= n; i++) distance[i] = -1;
distance[1] = 0;
priority_queue<pair<ll,ll>> q;
bool processed[n+1] = {false};
ll parents[n+1] = {0};
ll max_dist = 0;
ll max = 0;
q.push({0,1});
while (!q.empty()) {
ll a = q.top().second; q.pop();
if (processed[a]) continue;
processed[a] = true;
for (auto u : adj[a]) {
ll b = u;
if (distance[a]+1 > distance[b]) {
distance[b] = distance[a]+1;
parents[u] = a;
if(max_dist< distance[b]) {
max_dist = distance[b];
max = b;
}
q.push({distance[b],b});
}
}
}
cout << max_dist+1 << endl;
a = max;
ll outputs[n];
ll id = 0;
while(a != 1) {
outputs[id] = a;
a = parents[a];
id++;
}
outputs[id] = 1;
for(ll i = id; i>=0; i--) {
cout << outputs[i] << " ";
}
cout << "\n";
// for(ll i = 1; i<= n; i++) {
// cout << distance[i]+1 << " ";
// }
}Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 2 6 1 2 4 6 5 6 ... |
| correct output |
|---|
| 5 1 2 5 6 10 |
| user output |
|---|
| 4 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: ACCEPTED
| input |
|---|
| 10 10 8 10 2 6 2 10 7 10 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
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: WRONG ANSWER
| input |
|---|
| 100000 200000 86085 57043 45527 29537 41919 84699 95993 82082 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| 2 1 6498 |
Test 7
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 10961 53490 59843 36636 40674 66772 32618 41570 ... |
| correct output |
|---|
| 31 1 37239 44082 21537 90572 7332... |
| user output |
|---|
| 21 1 37239 44082 21537 90572 7332... |
Test 8
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 87375 76468 38855 27547 49415 83191 38572 1524 ... |
| correct output |
|---|
| 35 1 91343 59014 56722 34054 3875... |
| user output |
|---|
| 21 1 91343 59014 56722 34054 3875... |
Test 9
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 17973 70097 19982 80323 96486 2404 75650 63274 ... |
| correct output |
|---|
| 36 1 25685 90292 59380 91058 2663... |
| user output |
|---|
| 23 1 25685 90292 59380 91058 8872... |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 74343 53088 97443 7885 64807 58252 9374 33312 ... |
| correct output |
|---|
| 28 1 26390 15278 11333 48479 6881... |
| user output |
|---|
| 21 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: ACCEPTED
| 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 |
|---|
| 100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 2 1 1 2 |
| correct output |
|---|
| 2 1 2 |
| user output |
|---|
| 2 1 2 |
Test 14
Verdict: WRONG ANSWER
| input |
|---|
| 5 4 1 2 2 3 3 4 1 5 |
| correct output |
|---|
| 2 1 5 |
| user output |
|---|
| 4 1 2 3 4 |
Test 15
Verdict: WRONG ANSWER
| 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 |
|---|
| 50001 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
Test 16
Verdict: WRONG ANSWER
| input |
|---|
| 3 2 1 3 3 2 |
| correct output |
|---|
| 2 1 3 |
| user output |
|---|
| 3 1 3 2 |
Test 17
Verdict: ACCEPTED
| 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 |
|---|
| 99999 1 3 2 5 4 7 6 9 8 11 10 13 12 ... |
Test 18
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 1 2 1 3 1 4 1 5 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| 4 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
Test 19
Verdict: WRONG ANSWER
| input |
|---|
| 5 4 2 1 3 1 1 4 1 5 |
| correct output |
|---|
| 2 1 5 |
| user output |
|---|
| 2 1 4 |
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 |
