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

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 {
            let k = self.find(j);
            self.parent[i] = k;
            k
        }
    }

    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 min_malware_spread(graph: Vec<Vec<i32>>, initial: Vec<i32>) -> i32 {
        let n = graph.len();
        let mut uf = UnionFind::new(n);
        let mut initial: Vec<usize> = initial.into_iter().map(|i| i as usize).collect();
        for i in 0..n {
            for j in i + 1..n {
                if graph[i][j] == 1 {
                    uf.union(i, j);
                }
            }
        }
        let mut group_size: Vec<usize> = vec![0; n];
        for i in 0..n {
            group_size[uf.find(i)] += 1;
        }
        let mut initial_groups: Vec<usize> = vec![0; n];
        for &i in initial.iter() {
            let gid = uf.find(i as usize);
            initial_groups[gid] += 1;
        }
        initial.sort_unstable();
        let mut res = (0, initial[0]);
        for i in initial {
            let gid = uf.find(i as usize);
            if group_size[gid] > res.0 && initial_groups[gid] == 1 {
                res = (group_size[gid], i);
            }
        }
        res.1 as i32
    }
}

#[test]
fn test() {
    let graph = vec_vec_i32![[1, 1, 0], [1, 1, 0], [0, 0, 1]];
    let initial = vec![0, 1];
    let res = 0;
    assert_eq!(Solution::min_malware_spread(graph, initial), res);
    let graph = vec_vec_i32![[1, 0, 0], [0, 1, 0], [0, 0, 1]];
    let initial = vec![0, 2];
    let res = 0;
    assert_eq!(Solution::min_malware_spread(graph, initial), res);
    let graph = vec_vec_i32![[1, 1, 1], [1, 1, 1], [1, 1, 1]];
    let initial = vec![1, 2];
    let res = 1;
    assert_eq!(Solution::min_malware_spread(graph, initial), res);
}