forked from EndlessCheng/codeforces-go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
118E.go
70 lines (66 loc) · 1.12 KB
/
118E.go
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
package main
import (
"bufio"
. "fmt"
"io"
)
// github.com/EndlessCheng/codeforces-go
func CF118E(_r io.Reader, _w io.Writer) {
in := bufio.NewReader(_r)
out := bufio.NewWriter(_w)
defer out.Flush()
min := func(a, b int) int {
if a < b {
return a
}
return b
}
var n, m, v, w int
Fscan(in, &n, &m)
type nb struct{ to, i int }
g := make([][]nb, n+1)
for i := 0; i < m; i++ {
Fscan(in, &v, &w)
g[v] = append(g[v], nb{w, i})
g[w] = append(g[w], nb{v, i})
}
dfn := make([]int, n+1)
ts := 0
var f func(int, int) int
f = func(v, fa int) int {
ts++
dfn[v] = ts
lowV := ts
for _, e := range g[v] {
if w := e.to; dfn[w] == 0 {
lowW := f(w, v)
if lowW > dfn[v] {
return 1e9
}
lowV = min(lowV, lowW)
} else if w != fa {
lowV = min(lowV, dfn[w])
}
}
return lowV
}
if f(1, 0) == 1e9 {
Fprint(out, 0)
return
}
vis := make([]bool, m)
var f2 func(int)
f2 = func(v int) {
for len(g[v]) > 0 {
e := g[v][0]
g[v] = g[v][1:]
if !vis[e.i] {
vis[e.i] = true
Fprintln(out, v, e.to)
f2(e.to)
}
}
}
f2(1)
}
//func main() { CF118E(os.Stdin, os.Stdout) }