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

struct Solution;

use std::cmp::Reverse;
use std::collections::BinaryHeap;

impl Solution {
    fn trap_rain_water(height_map: Vec<Vec<i32>>) -> i32 {
        let n = height_map.len();
        let m = height_map[0].len();
        let mut queue: BinaryHeap<(Reverse<i32>, usize, usize)> = BinaryHeap::new();
        let mut visited = vec![vec![false; m]; n];
        for i in 0..n {
            for j in 0..m {
                if i == 0 || j == 0 || i == n - 1 || j == m - 1 {
                    visited[i][j] = true;
                    queue.push((Reverse(height_map[i][j]), i, j));
                }
            }
        }
        let mut res = 0;
        while let Some((Reverse(h), i, j)) = queue.pop() {
            if i > 0 && !visited[i - 1][j] {
                let ii = i - 1;
                visited[ii][j] = true;
                if h > height_map[ii][j] {
                    res += h - height_map[ii][j];
                    queue.push((Reverse(h), ii, j));
                } else {
                    queue.push((Reverse(height_map[ii][j]), ii, j));
                }
            }
            if j > 0 && !visited[i][j - 1] {
                let jj = j - 1;
                visited[i][jj] = true;
                if h > height_map[i][jj] {
                    res += h - height_map[i][jj];
                    queue.push((Reverse(h), i, jj));
                } else {
                    queue.push((Reverse(height_map[i][jj]), i, jj));
                }
            }
            if i + 1 < n && !visited[i + 1][j] {
                let ii = i + 1;
                visited[ii][j] = true;
                if h > height_map[ii][j] {
                    res += h - height_map[ii][j];
                    queue.push((Reverse(h), ii, j));
                } else {
                    queue.push((Reverse(height_map[ii][j]), ii, j));
                }
            }
            if j + 1 < m && !visited[i][j + 1] {
                let jj = j + 1;
                visited[i][jj] = true;
                if h > height_map[i][jj] {
                    res += h - height_map[i][jj];
                    queue.push((Reverse(h), i, jj));
                } else {
                    queue.push((Reverse(height_map[i][jj]), i, jj));
                }
            }
        }
        res
    }
}

#[test]
fn test() {
    let height_map = vec_vec_i32![[1, 4, 3, 1, 3, 2], [3, 2, 1, 3, 2, 4], [2, 3, 3, 2, 3, 1]];
    let res = 4;
    assert_eq!(Solution::trap_rain_water(height_map), res);
}