Submission details
Task:Longest route
Sender:aalto25h_002
Submission time:2025-10-22 17:44:46 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#10.01 sdetails
#20.01 sdetails
#30.01 sdetails
#4ACCEPTED0.01 sdetails
#50.01 sdetails
#6ACCEPTED0.19 sdetails
#70.18 sdetails
#80.18 sdetails
#90.18 sdetails
#100.18 sdetails
#110.15 sdetails
#12ACCEPTED0.20 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.01 sdetails
#15ACCEPTED0.17 sdetails
#16ACCEPTED0.01 sdetails
#170.16 sdetails
#18ACCEPTED0.10 sdetails
#190.01 sdetails
#20ACCEPTED0.14 sdetails
#210.01 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:39:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for (int i=0; i<outl.size(); i++) {
      |                       ~^~~~~~~~~~~~
input/code.cpp:44:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for (int i=1; i<=outr.size(); i++) {
      |                       ~^~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

constexpr int NMX = (int)1e5;
vector<int> adj[NMX];
vector<int> into[NMX];
vector<int> vis(NMX);
vector<int> outl;
vector<int> outr;
map<int,int> par;


int main() {
	int n, m;
	cin >> n >> m;
	for (int i=0; i<m; i++) {
		int a, b;
		cin >> a >> b;
		adj[a].push_back(b);
		into[b].push_back(a);
	}
	stack<int> q;
	q.push(1);
	while (!q.empty()) {
		int a = q.top(); q.pop();
		if (vis[a] == 2) continue;
		if (vis[a] == 1) {
			vis[a] = 2;
			outl.push_back(a);
			continue;
		}
		vis[a] = 1;
		q.push(a);
		for (int nb : adj[a]) {
			q.push(nb);
		}
	}
	for (int i=0; i<outl.size(); i++) {
		outr.push_back(outl[outl.size()-1-i]);
	}

	vector<int> mem(outl.size()+2);
	for (int i=1; i<=outr.size(); i++) {
		int maxn = 0;
		int maxb = 0;
		for (int nb : into[i]) {
			if (mem[nb] > maxn) {
				maxn = mem[nb];
				maxb = nb;
			}
		}
		par[i] = maxb;
		mem[i] = maxn+1;
	}

	int cur = n;
	vector<int> out;
	while (cur != 1) {
		out.push_back(cur);
		cur = par[cur];
		if (cur == 0) {
			cout << "IMPOSSIBLE";
			return 0;
		}
	}
	out.push_back(1);
	cout << out.size() << "\n";
	for (int i=out.size()-1; i>=0; i--) {
		cout << out[i] << " ";
	}
}

Test details

Test 1

Verdict:

input
10 10
2 6
1 2
4 6
5 6
...

correct output
5
1 2 5 6 10 

user output
IMPOSSIBLE

Test 2

Verdict:

input
10 10
3 9
6 5
6 9
2 8
...

correct output
4
1 2 8 10 

user output
IMPOSSIBLE

Test 3

Verdict:

input
10 10
5 10
4 10
8 7
7 10
...

correct output
3
1 4 10 

user output
IMPOSSIBLE

Test 4

Verdict: ACCEPTED

input
10 10
8 10
2 6
2 10
7 10
...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 5

Verdict:

input
10 10
8 4
2 10
1 3
4 9
...

correct output
5
1 8 7 2 10 

user output
IMPOSSIBLE

Test 6

Verdict: ACCEPTED

input
100000 200000
86085 57043
45527 29537
41919 84699
95993 82082
...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 7

Verdict:

input
100000 200000
10961 53490
59843 36636
40674 66772
32618 41570
...

correct output
31
1 37239 44082 21537 90572 7332...

user output
(empty)

Test 8

Verdict:

input
100000 200000
87375 76468
38855 27547
49415 83191
38572 1524
...

correct output
35
1 91343 59014 56722 34054 3875...

user output
(empty)

Test 9

Verdict:

input
100000 200000
17973 70097
19982 80323
96486 2404
75650 63274
...

correct output
36
1 25685 90292 59380 91058 2663...

user output
(empty)

Test 10

Verdict:

input
100000 200000
74343 53088
97443 7885
64807 58252
9374 33312
...

correct output
28
1 26390 15278 11333 48479 6881...

user output
(empty)

Test 11

Verdict:

input
100000 199998
1 100000
1 100000
2 100000
2 100000
...

correct output
2
1 100000 

user output
IMPOSSIBLE

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: 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: ACCEPTED

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
99999
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 16

Verdict: ACCEPTED

input
3 2
1 3
3 2

correct output
2
1 3 

user output
2
1 3 

Test 17

Verdict:

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
50001
1 2 4 6 8 10 12 14 16 18 20 22...

Test 18

Verdict: ACCEPTED

input
100000 200000
1 2
1 3
1 4
1 5
...

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 19

Verdict:

input
5 4
2 1
3 1
1 4
1 5

correct output
2
1 5 

user output
IMPOSSIBLE

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:

input
4 4
3 1
3 4
1 2
2 4

correct output
3
1 2 4 

user output
IMPOSSIBLE