Ultraviolet A Problem Solution: 10044-Erdos number

The unclear specifications on the input format and size lead to the undeserving
Difficulties to solve this problem. after Numerous frustrating res and was, I was forced to switch to C ++. i'm still not sure about the judge's data format, but I believe its size is smaller 5000.

The follow code uses a simple BFS on the coauthor graph. the parsing of paper database is relatively simple but tricky. it cocould be surely much simpler if the judge's data format strictly conforming to the specification.

Code:

1. /*************************************** **********************************
2. * Copyright (c) 2008 by liukaipeng *
3. * Liukaipeng at gmail dot com *
4. **************************************** *********************************/
6. /* @ Judge_id 00000 10044 C ++ "Erdos number "*/
8. # Include <iostream>
9. # Include <fstream>
10. # Include <string>
11. # Include <vector>
12. # Include <map>
13. # Include <queue>
14. # Include <limits>
16. Using namespace STD;
18. Void get_authors (vector <string> const & papers,
19. Vector <vector <size_t> & authors,
20. Map <string, size_t> & namelist)
21. {
22. For (INT I = 0; I <papers. Size (); ++ I ){
23. String const & P = papers [I];
24. For (int fb, Fe = 0, LB, Le = 0; P [Fe]! = ':' & P [le]! = ':';){
25. Fb = P. find_first_not_of (",", le );
26. Fe = P. find_first_of (",:", FB );
27. Lb = P. find_first_not_of (",", Fe );
28. Le = P. find_first_of (",:", LB );
29. If (Fb = string: NPOs | Fe = string: NPOs |
30. Lb = string: NPOs | Le = string: NPOs ){
31. Break;
32. }
33. String name = P. substr (FB, Fe-FB) + "," + P. substr (LB, le-lb );
34. Map <string, size_t>: iterator it = namelist. Find (name );
35. If (IT = namelist. End ()){
36. It = namelist. insert (it, make_pair (name, namelist. Size ()));
37. }
38. Authors [I]. push_back (IT-> second );
39. }
40. }
41. }
43. Void get_coauthors (vector <size_t> const & authors,
44. Vector <vector <size_t> & coauthors)
45. {
46. For (INT I = 0; I <authors. Size (); ++ I ){
47. Vector <size_t> const & A = authors [I];
48. If (A. Empty ()){
49. Continue;
50. }
51. For (INT a1 = 0; A1 <A. Size ()-1; ++ A1 ){
52. For (INT a2 = A1 + 1; a2 <A. Size (); ++ A2 ){
53. Coauthors [A [a1]. push_back (A [a2]);
54. Coauthors [A [a2]. push_back (A [a1]);
55. }
56. }
57. }
58. }
60. Void get_erdos_numbers (vector <size_t> const & coauthors,
61. Vector <int> & erdos_numbers, size_t S)
62. {
63. Vector <bool> visited (coauthors. Size ());
64. Queue <pair <size_t, int> q;
65. Size_t v = s;
66. Int D = 0;
67. Q. Push (make_pair (v, d ));
68. Visited [v] = true;
69. While (! Q. Empty ()){
70. S = Q. Front (). First;
71. D = Q. Front (). Second;
72. Q. Pop ();
73. Erdos_numbers [s] = D;
74. For (INT I = 0; I <coauthors [s]. Size (); ++ I ){
75. V = coauthors [s] [I];
76. If (! Visited [v]) {
77. Q. Push (make_pair (v, D + 1 ));
78. Visited [v] = true;
79. }
80. }
81. }
82. }
84. Void put_erdos_numbers (vector <string> const & names,
85. Map <string, size_t> const & namelist,
86. Vector <int> const & erdos_numbers)
87. {
88. For (INT I = 0; I <names. Size (); ++ I ){
89. If (! Names [I]. Empty ()){
90. Map <string, size_t>: const_iterator it = namelist. Find (Names [I]);
91. If (it! = Namelist. End () & erdos_numbers [it-> second]! =-1 ){
92. Cout <Names [I] <"" <erdos_numbers [it-> second] <"/N ";
93. } Else {
94. Cout <Names [I] <"infinity/N ";
95. }
96. } Else {
97. Cout <"/N ";
98. }
99. }
100. }
102. Int main (INT argc, char * argv [])
103. {
104. # Ifndef online_judge
105. String name = argv [0];
106. Filebuf infb, outfb;
107. Cin. rdbuf (infb. Open (name + ". In"). c_str (), ios_base: In ));
108. Cout. rdbuf (outfb. Open (name + ". Out"). c_str (), ios_base: Out ));
109. # Endif
111. Int scenarios;
112. Cin> scenarios;
113. For (int s = 1; S <= scenarios; ++ s ){
114. Int P, N;
115. Cin> P> N;
116. Cin. Ignore (numeric_limits <streamsize>: max (), '/N ');
118. Vector <string> papers (P );
119. For (INT I = 0; I <p; ++ I ){
120. Getline (CIN, papers [I]);
121. }
123. Map <string, size_t> namelist;/* map author name to Author ID */
124. Vector <vector <size_t> authors (P );
125. Get_authors (papers, authors, namelist );
127. Vector <vector <size_t> coauthors (namelist. Size ());
128. Get_coauthors (authors, coauthors );
130. Vector <int> erdos_numbers (namelist. Size (),-1 );
131. Map <string, size_t>: const_iterator it = namelist. Find ("Erdos, P .");
132. Get_erdos_numbers (coauthors, erdos_numbers, IT-> second );
134. Vector <string> names (N );
135. For (INT I = 0; I <n; ++ I ){
136. Getline (CIN, Names [I]);
137. }
138. Cout <"scenario" <S <"/N ";
139. Put_erdos_numbers (names, namelist, erdos_numbers );
140. }
141. Return 0;
142. }