dsalgo 0.3.10

A package for Datastructures and Algorithms.
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122

use crate::dynamic_sqrt_bucket::SqrtBucket;

pub struct Multiset<T>(SqrtBucket<T>);

impl<T: Ord> Multiset<T> {
    pub fn new() -> Self {
        Self(SqrtBucket::new())
    }

    pub fn size(&self) -> usize {
        self.0.size()
    }

    pub fn lower_bound(
        &self,
        x: &T,
    ) -> usize {
        self.0.binary_search(|v| v >= x)
    }

    pub fn upper_bound(
        &self,
        x: &T,
    ) -> usize {
        self.0.binary_search(|v| v > x)
    }

    pub fn count(
        &self,
        x: &T,
    ) -> usize {
        self.upper_bound(x) - self.lower_bound(x)
    }

    pub fn insert(
        &mut self,
        x: T,
    ) {
        let i = self.lower_bound(&x);

        self.0.insert(i, x);
    }

    pub fn remove(
        &mut self,
        x: &T,
    ) {
        assert!(self.count(x) > 0);

        let i = self.lower_bound(&x);

        self.0.remove(i);
    }
}

use std::ops::*;

impl<T> Index<usize> for Multiset<T> {
    type Output = T;

    fn index(
        &self,
        i: usize,
    ) -> &Self::Output {
        &self.0[i]
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {}

    #[test]

    fn test_arc033_3() {
        let cases = vec![
            vec![
                ((1, 11), 0),
                ((1, 29), 0),
                ((1, 89), 0),
                ((2, 2), 29),
                ((2, 2), 89),
            ],
            vec![
                ((1, 8932), 0),
                ((1, 183450), 0),
                ((1, 34323), 0),
                ((1, 81486), 0),
                ((1, 127874), 0),
                ((1, 114850), 0),
                ((1, 55277), 0),
                ((1, 112706), 0),
                ((2, 3), 55277),
                ((1, 39456), 0),
                ((1, 52403), 0),
                ((2, 4), 52403),
            ],
        ];

        for q in cases {
            let mut s = Multiset::new();

            for ((t, x), ans) in q {
                if t == 1 {
                    s.insert(x);
                } else {
                    let v = s[x - 1];

                    assert_eq!(v, ans);

                    s.remove(&v);
                }
            }
        }
    }
}