-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy path10596.go
65 lines (58 loc) · 987 Bytes
/
10596.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
// UVa 10596 - Morning Walk
package main
import (
"fmt"
"os"
)
var (
n int
visited []bool
matrix [][]bool
)
func dfs(curr int) {
for i, v := range visited {
if matrix[curr][i] && !v {
visited[i] = true
dfs(i)
}
}
}
func solve(roads []int) bool {
for _, road := range roads {
if road%2 == 1 {
return false
}
}
visited = make([]bool, n)
visited[0] = true
dfs(0)
return len(visited) == n
}
func main() {
in, _ := os.Open("10596.in")
defer in.Close()
out, _ := os.Create("10596.out")
defer out.Close()
var r, c1, c2 int
for {
if _, err := fmt.Fscanf(in, "%d%d", &n, &r); err != nil {
break
}
matrix = make([][]bool, n)
for i := range matrix {
matrix[i] = make([]bool, n)
}
roads := make([]int, n)
for ; r > 0; r-- {
fmt.Fscanf(in, "%d%d", &c1, &c2)
matrix[c1][c2] = true
roads[c1]++
roads[c2]++
}
if solve(roads) {
fmt.Fprintln(out, "Possible")
} else {
fmt.Fprintln(out, "Not Possible")
}
}
}