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
#include
using
#define
#define
#define
#define
typedef
typedef
const
//head
const
vector
// m is behind of the n
int
int
return
}
void
int
int
if
}
int
char
int
// flag means the 矛盾
bool
int
void
if
dp[x] = max(dp[x],dep);
for
if
flag = true
return
}
if
vis[to] = 1
dfs(to,dep+1
vis[to] = 0
}
}
}
int
#ifdef
freopen("1.in"
#endif
scanf
rep(i,0
scanf
}
rep(i,0
rep(i,0
rep(j,0
if
Union(i,n+j);
rep(i,0
int
if
e[x].push_back(y);
ind[y] ++;
use[x] = 1
}else
e[y].push_back(x);
ind[x] ++;
use[y] = 1
}else
use[x] = 1
}
}
bool
rep(i,0
if
fflag = true
vis[i] = 1
dfs(i,1
vis[i] = 0
}
}
if
puts
}else
puts
rep(i,0
puts
rep(i,n,m+n) printf
}
return
}