Code/10000.cpp at master · sushiljacksparrow/Code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <ext/numeric>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/algorithm>

using namespace std;
using namespace __gnu_cxx;

#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define ii pair<int,int>
#define vs vector<string>
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

	int n, p, q, s;
	map<int, int>m;
	int test=1;
	while(cin>>n && n!=0)
	{
		vector< vector<int> > vvi(n+1);
		cin>>s;
		while(cin>>p>>q && p!=0 && q!=0)
		{
			vvi[p].push_back(q);
		}

		queue<int>Q;
		Q.push(s);
		m[s]=0;
		int ret=-1, node = -1;
		while(!Q.empty())
		{
			int r = Q.front();
			int d = m[r];

			//cout<<r<<"--- "<<d<<endl;
			Q.pop();
			if(ret<d)
			{
				ret = d;
				node = r;
			}
			//ret=max(ret, d);

			int len = vvi[r].size();
			for(int i=0;i<len;i++)
			{
				Q.push(vvi[r][i]);
				m[vvi[r][i]]=d+1;
			}
		}

		cout<<"Case "<<test<<": The longest path from "<<s<<" has length "<<ret<<", finishing at "<<node<<"."<<endl;
		test++;
	}


    system("pause");
}