rustgym 0.2.0

rustgym solutions
Documentation 
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

struct Solution;

struct UnionFind {
    parent: Vec<usize>,
    n: usize,
}

impl UnionFind {
    fn new(n: usize) -> Self {
        let parent = (0..n).collect();
        UnionFind { parent, n }
    }

    fn find(&mut self, i: usize) -> usize {
        let j = self.parent[i];
        if i == j {
            i
        } else {
            self.parent[i] = self.find(j);
            self.parent[i]
        }
    }

    fn union(&mut self, mut i: usize, mut j: usize) {
        i = self.find(i);
        j = self.find(j);
        if i != j {
            self.parent[i] = j;
            self.n -= 1;
        }
    }
}

impl Solution {
    fn regions_by_slashes(grid: Vec<String>) -> i32 {
        let a: Vec<Vec<char>> = grid.iter().map(|s| s.chars().collect()).collect();
        let n = grid.len();
        let m = a[0].len();
        let mut uf = UnionFind::new(n * m * 4);
        for i in 0..n {
            for j in 0..m {
                let k0 = Self::id(0, i, j, n, m);
                let k1 = Self::id(1, i, j, n, m);
                let k2 = Self::id(2, i, j, n, m);
                let k3 = Self::id(3, i, j, n, m);
                match a[i][j] {
                    ' ' => {
                        uf.union(k0, k1);
                        uf.union(k1, k2);
                        uf.union(k2, k3);
                        uf.union(k3, k0);
                    }
                    '/' => {
                        uf.union(k0, k1);
                        uf.union(k2, k3);
                    }
                    '\\' => {
                        uf.union(k1, k2);
                        uf.union(k3, k0);
                    }
                    _ => {}
                }
                if i > 0 {
                    uf.union(k1, Self::id(3, i - 1, j, n, m));
                }
                if j > 0 {
                    uf.union(k0, Self::id(2, i, j - 1, n, m));
                }
            }
        }
        uf.n as i32
    }

    fn id(k: usize, i: usize, j: usize, n: usize, m: usize) -> usize {
        k * n * m + i * m + j
    }
}

#[test]
fn test() {
    let grid = vec_string![" /", "/ "];
    let res = 2;
    assert_eq!(Solution::regions_by_slashes(grid), res);
    let grid = vec_string![" /", "  "];
    let res = 1;
    assert_eq!(Solution::regions_by_slashes(grid), res);
    let grid = vec_string!["\\/", "/\\"];
    let res = 4;
    assert_eq!(Solution::regions_by_slashes(grid), res);
}