Segtree: Monoid BitwiseOr/BitwiseAnd/BitwiseXor, get_slice #115
Conversation
|
The following code keeps the segtree implementation, but changes the input/output processing. |
|
For the |
src/segtree.rs
Outdated
| @@ -68,6 +68,48 @@ where | |||
| } | |||
| } | |||
|
|
|||
| pub struct BitOrOper<S>(Infallible, PhantomData<fn() -> S>); | |||
There was a problem hiding this comment.
This is just a matter of preference, but I prefer BitwiseOr. ("Operation" is obvious in the context, while "bit or" is kinda misleading (are we handling a single bit?))
src/segtree.rs
Outdated
| @@ -107,6 +149,10 @@ impl<M: Monoid> Segtree<M> { | |||
| self.d[p + self.size].clone() | |||
| } | |||
|
|
|||
| pub fn get_slice(&self) -> &[M::S] { | |||
| &self.d[self.size..(self.size + self.n)] | |||
There was a problem hiding this comment.
Just showing off a trick: did you know that you can write like this 😜? (I prefer this style becuase you need to specify the same variable twice.)
| &self.d[self.size..(self.size + self.n)] | |
| &self.d[self.size..][..self.n] |
src/segtree.rs
Outdated
| { | ||
| type S = S; | ||
| fn identity() -> Self::S { | ||
| S::default() |
There was a problem hiding this comment.
I'm still doubting if we should use "Default" in this case, considering the semantics. (See also my previous comment).
TonalidadeHidrica
changed the title
usage sample: ABC285F - Substring of Sorted String
https://atcoder.jp/contests/abc285/submissions/38317831