結果

問題 No.2158 X日後に全完するhibit君
ユーザー to-omerto-omer
提出日時 2022-12-09 23:09:42
言語 Rust
(1.77.0)
結果
AC  
実行時間 290 ms / 2,000 ms
コード長 32,038 bytes
コンパイル時間 3,311 ms
コンパイル使用メモリ 204,960 KB
実行使用メモリ 13,148 KB
最終ジャッジ日時 2024-04-22 22:58:59
合計ジャッジ時間 4,326 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 21 ms
9,292 KB
testcase_03 AC 59 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 72 ms
7,608 KB
testcase_06 AC 9 ms
6,940 KB
testcase_07 AC 19 ms
6,940 KB
testcase_08 AC 1 ms
6,944 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 11 ms
6,940 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 1 ms
6,944 KB
testcase_14 AC 1 ms
6,944 KB
testcase_15 AC 2 ms
6,940 KB
testcase_16 AC 1 ms
6,944 KB
testcase_17 AC 5 ms
6,940 KB
testcase_18 AC 0 ms
6,944 KB
testcase_19 AC 1 ms
6,944 KB
testcase_20 AC 1 ms
6,940 KB
testcase_21 AC 1 ms
6,940 KB
testcase_22 AC 1 ms
6,940 KB
testcase_23 AC 290 ms
13,148 KB
testcase_24 AC 10 ms
7,468 KB
testcase_25 AC 73 ms
7,476 KB
testcase_26 AC 13 ms
7,724 KB
testcase_27 AC 288 ms
13,020 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

pub fn main() {
    crate::prepare!();
    sc!(n, m, p: [(usize, usize, usize); n]);
    let min = {
        let mut ans = !0usize;
        for bit in 0usize..1 << n {
            let mut t = 0usize;
            for i in 0..n {
                t += if bit & 1 << i == 0 { p[i].1 } else { p[i].2 };
            }
            if t <= 60 {
                if bit == 0 {
                    ans = ans.min(1);
                } else {
                    ans = ans.min(m + 2);
                }
            }
        }
        ans
    };
    let (max, ex) = {
        let mut g = vec![vec![]; n];
        for i in 0..n {
            let mut map = HashMap::<(usize, usize), usize>::new();
            let mut gg = HashMap::<usize, Vec<(usize, usize, f64)>>::new();
            let mut deq = VecDeque::new();
            deq.push_back((p[i].0, 0usize));
            mlambda!(
                fn get_id(j: usize, k: usize) -> usize {
                    let id = map.len();
                    if let Some(&id) = map.get(&(j, k)) {
                        id
                    } else {
                        map.insert((j, k), id);
                        id
                    }
                }
            );
            while let Some((j, k)) = deq.pop_front() {
                let id = get_id!(j, k);
                let l = p[i].0 - j - k;
                if j > 0 {
                    let nj = j - 1;
                    let nk = k + (l >= m) as usize;
                    let q = j as f64 / (j + k) as f64;
                    if !map.contains_key(&(nj, nk)) {
                        deq.push_back((nj, nk));
                    }
                    gg.entry(id).or_default().push((get_id!(nj, nk), p[i].1, q));
                }
                if k > 0 {
                    let nj = j;
                    let nk = k - 1 + (l >= m) as usize;
                    let q = k as f64 / (j + k) as f64;
                    if !map.contains_key(&(nj, nk)) {
                        deq.push_back((nj, nk));
                    }
                    gg.entry(id).or_default().push((get_id!(nj, nk), p[i].2, q));
                }
            }
            g[i] = vec![vec![]; map.len()];
            for (j, gg) in gg {
                g[i][j] = gg;
            }
        }
        let sz: usize = (0..n).map(|i| g[i].len()).product();
        let mut h = vec![vec![]; sz];
        crecurse!(
            unsafe fn dfs(i: usize, id: usize, nid: usize, t: usize, q: f64) {
                if i < n {
                    for (u, gg) in g[i].iter().enumerate() {
                        for &(v, tt, qq) in gg {
                            dfs!(
                                i + 1,
                                id * g[i].len() + u,
                                nid * g[i].len() + v,
                                t + tt,
                                q * qq
                            );
                        }
                    }
                } else if t > 60 {
                    h[id].push((nid, q));
                }
            }
        )(0, 0, 0, 0, 1.);

        let mut dp = vec![0f64; sz];
        let mut ep = vec![false; sz];
        dp[0] = 1f64;
        ep[0] = true;
        let mut ans = 1f64;
        let mut max = !0usize;
        for d in 1..=200 {
            let mut ndp = vec![0f64; sz];
            let mut nep = vec![false; sz];
            for u in 0..sz {
                for &(v, q) in &h[u] {
                    ndp[v] += dp[u] * q;
                    nep[v] |= ep[u];
                }
            }
            dp = ndp;
            ep = nep;
            if ep.iter().any(|&e| e) {
                ans += dp.iter().sum::<f64>();
            } else {
                max = d;
                break;
            }
        }
        (max, ans)
    };
    if max == !0 {
        pp!(-1);
    } else {
        pp!(min, max, ex);
    }
}
#[allow(unused_imports)]use std::{cmp::{Ordering,Reverse},collections::{BTreeMap,BTreeSet,BinaryHeap,HashMap,HashSet,VecDeque}};
mod main_macros{#[doc=" Prepare useful macros."]#[doc=" - `prepare!();`: default (all input scanner (`sc!`, `sv!`) + buf print (`pp!`, `dg!`))"]#[doc=" - `prepare!(?);`: interactive (line scanner (`scln!`) + buf print (`pp!`, `dg!`))"]#[macro_export]macro_rules!prepare{(@output($dol:tt))=>{#[allow(unused_imports)]use std::io::Write as _;let __out=std::io::stdout();#[allow(unused_mut,unused_variables)]let mut __out=std::io::BufWriter::new(__out.lock());#[allow(unused_macros)]#[doc=" [`iter_print!`] for buffered stdout."]macro_rules!pp{($dol($dol t:tt)*)=>{$dol crate::iter_print!(__out,$dol($dol t)*)}}#[cfg(debug_assertions)]#[allow(unused_macros)]#[doc=" [`iter_print!`] for buffered stderr. Do nothing in release mode."]macro_rules!dg{($dol($dol t:tt)*)=>{{#[allow(unused_imports)]use std::io::Write as _;let __err=std::io::stderr();#[allow(unused_mut,unused_variables)]let mut __err=std::io::BufWriter::new(__err.lock());$dol crate::iter_print!(__err,$dol($dol t)*);let _=__err.flush();}}}#[cfg(not(debug_assertions))]#[allow(unused_macros)]#[doc=" [`iter_print!`] for buffered stderr. Do nothing in release mode."]macro_rules!dg{($dol($dol t:tt)*)=>{}}};(@normal($dol:tt))=>{let __in_buf=read_stdin_all_unchecked();#[allow(unused_mut,unused_variables)]let mut __scanner=Scanner::new(&__in_buf);#[allow(unused_macros)]macro_rules!sc{($dol($dol t:tt)*)=>{$dol crate::scan!(__scanner,$dol($dol t)*)}}#[allow(unused_macros)]macro_rules!sv{($dol($dol t:tt)*)=>{$dol crate::scan_value!(__scanner,$dol($dol t)*)}}};(@interactive($dol:tt))=>{#[allow(unused_macros)]#[doc=" Scan a line, and previous line will be truncated in the next call."]macro_rules!scln{($dol($dol t:tt)*)=>{let __in_buf=read_stdin_line();#[allow(unused_mut,unused_variables)]let mut __scanner=Scanner::new(&__in_buf);$dol crate::scan!(__scanner,$dol($dol t)*)}}};()=>{$crate::prepare!(@output($));$crate::prepare!(@normal($))};(?)=>{$crate::prepare!(@output($));$crate::prepare!(@interactive($))};}}
pub use self::iter_print::IterPrint;
mod iter_print{use std::{fmt::Display,io::{Error,Write}};pub trait IterPrint{fn iter_print<W,S>(self,writer:&mut W,sep:S,is_head:bool)->Result<(),Error>where W:Write,S:Display;}macro_rules!iter_print_tuple_impl{(@impl$($A:ident$a:ident)?,$($B:ident$b:ident)*)=>{impl<$($A,)?$($B),*>IterPrint for($($A,)?$($B),*)where$($A:Display,)?$($B:Display),*{#[allow(unused_variables)]fn iter_print<W,S>(self,writer:&mut W,sep:S,is_head:bool)->Result<(),Error>where W:Write,S:Display{let($($a,)?$($b,)*)=self;$(if is_head{::std::write!(writer,"{}",$a)?;}else{::std::write!(writer,"{}{}",sep,$a)?;})?$(::std::write!(writer,"{}{}",sep,$b)?;)*Ok(())}}};(@inc,,$C:ident$c:ident$($D:ident$d:ident)*)=>{iter_print_tuple_impl!(@impl,);iter_print_tuple_impl!(@inc$C$c,,$($D$d)*);};(@inc$A:ident$a:ident,$($B:ident$b:ident)*,$C:ident$c:ident$($D:ident$d:ident)*)=>{iter_print_tuple_impl!(@impl$A$a,$($B$b)*);iter_print_tuple_impl!(@inc$A$a,$($B$b)*$C$c,$($D$d)*);};(@inc$A:ident$a:ident,$($B:ident$b:ident)*,)=>{iter_print_tuple_impl!(@impl$A$a,$($B$b)*);};($($t:tt)*)=>{iter_print_tuple_impl!(@inc,,$($t)*);};}iter_print_tuple_impl!(A a B b C c D d E e F f G g H h I i J j K k);#[doc=" Print expressions with a separator."]#[doc=" - `iter_print!(writer, args...)`"]#[doc=" - `@sep $expr`: set separator (default: `' '`)"]#[doc=" - `@ns`: alias for `@sep \"\"`"]#[doc=" - `@lf`: alias for `@sep '\\n'`"]#[doc=" - `@sp`: alias for `@sep ' '`"]#[doc=" - `@fmt $lit => {$($expr),*}`: print `format!($lit, $($expr),*)`"]#[doc=" - `@flush`: flush writer (auto insert `!`)"]#[doc=" - `@it $expr`: print iterator"]#[doc=" - `@it2d $expr`: print 2d-iterator"]#[doc=" - `@tup $expr`: print tuple (need to import [`IterPrint`])"]#[doc=" - `@ittup $expr`: print iterative tuple (need to import [`IterPrint`])"]#[doc=" - `$expr`: print expr"]#[doc=" - `{ args... }`: scoped"]#[doc=" - `;`: print `'\\n'`"]#[doc=" - `!`: not print `'\\n'` at the end"]#[macro_export]macro_rules!iter_print{(@@fmt$writer:expr,$sep:expr,$is_head:expr,$lit:literal,$($e:expr),*)=>{if!$is_head{::std::write!($writer,"{}",$sep).expect("io error");}::std::write!($writer,$lit,$($e),*).expect("io error");};(@@item$writer:expr,$sep:expr,$is_head:expr,$e:expr)=>{$crate::iter_print!(@@fmt$writer,$sep,$is_head,"{}",$e);};(@@line_feed$writer:expr$(,)?)=>{::std::writeln!($writer).expect("io error");};(@@it$writer:expr,$sep:expr,$is_head:expr,$iter:expr)=>{{let mut iter=$iter.into_iter();if let Some(item)=iter.next(){$crate::iter_print!(@@item$writer,$sep,$is_head,item);}for item in iter{$crate::iter_print!(@@item$writer,$sep,false,item);}}};(@@it2d$writer:expr,$sep:expr,$is_head:expr,$iter:expr)=>{let mut iter=$iter.into_iter();if let Some(item)=iter.next(){$crate::iter_print!(@@it$writer,$sep,$is_head,item);}for item in iter{$crate::iter_print!(@@line_feed$writer);$crate::iter_print!(@@it$writer,$sep,true,item);}};(@@tup$writer:expr,$sep:expr,$is_head:expr,$tuple:expr)=>{IterPrint::iter_print($tuple,&mut$writer,$sep,$is_head).expect("io error");};(@@ittup$writer:expr,$sep:expr,$is_head:expr,$iter:expr)=>{let mut iter=$iter.into_iter();if let Some(item)=iter.next(){$crate::iter_print!(@@tup$writer,$sep,$is_head,item);}for item in iter{$crate::iter_print!(@@line_feed$writer);$crate::iter_print!(@@tup$writer,$sep,true,item);}};(@@assert_tag item)=>{};(@@assert_tag it)=>{};(@@assert_tag it2d)=>{};(@@assert_tag tup)=>{};(@@assert_tag ittup)=>{};(@@assert_tag$tag:ident)=>{::std::compile_error!(::std::concat!("invalid tag in `iter_print!`: `",std::stringify!($tag),"`"));};(@@inner$writer:expr,$sep:expr,$is_head:expr,@sep$e:expr,$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$e,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@ns$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,"",$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@lf$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,'\n',$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@sp$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,' ',$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@flush$($t:tt)*)=>{$writer.flush().expect("io error");$crate::iter_print!(@@inner$writer,$sep,$is_head,!$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@fmt$lit:literal=>{$($e:expr),*$(,)?}$($t:tt)*)=>{$crate::iter_print!(@@fmt$writer,$sep,$is_head,$lit,$($e),*);$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$e:expr,$($t:tt)*)=>{$crate::iter_print!(@@assert_tag$tag);$crate::iter_print!(@@$tag$writer,$sep,$is_head,$e);$crate::iter_print!(@@inner$writer,$sep,false,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$e:expr;$($t:tt)*)=>{$crate::iter_print!(@@assert_tag$tag);$crate::iter_print!(@@$tag$writer,$sep,$is_head,$e);$crate::iter_print!(@@line_feed$writer);$crate::iter_print!(@@inner$writer,$sep,true,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$e:expr)=>{$crate::iter_print!(@@assert_tag$tag);$crate::iter_print!(@@$tag$writer,$sep,$is_head,$e);$crate::iter_print!(@@inner$writer,$sep,false,);};(@@inner$writer:expr,$sep:expr,$is_head:expr,@$tag:ident$($t:tt)*)=>{::std::compile_error!(::std::concat!("invalid expr in `iter_print!`: `",std::stringify!($($t)*),"`"));};(@@inner$writer:expr,$sep:expr,$is_head:expr,,$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,;$($t:tt)*)=>{$crate::iter_print!(@@line_feed$writer);$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,!$(,)?)=>{};(@@inner$writer:expr,$sep:expr,$is_head:expr,!$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,)=>{$crate::iter_print!(@@line_feed$writer);};(@@inner$writer:expr,$sep:expr,$is_head:expr,{$($t:tt)*}$($rest:tt)*)=>{$crate::iter_print!(@@inner$writer,$sep,$is_head,$($t)*,!);$crate::iter_print!(@@inner$writer,$sep,$is_head,$($rest)*);};(@@inner$writer:expr,$sep:expr,$is_head:expr,$($t:tt)*)=>{$crate::iter_print!(@@inner$writer,$sep,$is_head,@item$($t)*);};($writer:expr,$($t:tt)*)=>{{$crate::iter_print!(@@inner$writer,' ',true,$($t)*);}};}}
pub use self::scanner::*;
mod scanner{use std::{iter::{from_fn,repeat_with,FromIterator},marker::PhantomData};pub fn read_stdin_all()->String{use std::io::Read as _;let mut s=String::new();std::io::stdin().read_to_string(&mut s).expect("io error");s}pub fn read_stdin_all_unchecked()->String{use std::io::Read as _;let mut buf=Vec::new();std::io::stdin().read_to_end(&mut buf).expect("io error");unsafe{String::from_utf8_unchecked(buf)}}pub fn read_all(mut reader:impl std::io::Read)->String{let mut s=String::new();reader.read_to_string(&mut s).expect("io error");s}pub fn read_all_unchecked(mut reader:impl std::io::Read)->String{let mut buf=Vec::new();reader.read_to_end(&mut buf).expect("io error");unsafe{String::from_utf8_unchecked(buf)}}pub fn read_stdin_line()->String{let mut s=String::new();std::io::stdin().read_line(&mut s).expect("io error");s}pub trait IterScan:Sized{type Output;fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>;}pub trait MarkedIterScan:Sized{type Output;fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>;}#[derive(Clone,Debug)]pub struct Scanner<'a>{iter:std::str::SplitAsciiWhitespace<'a>}impl<'a>Scanner<'a>{#[inline]pub fn new(s:&'a str)->Self{let iter=s.split_ascii_whitespace();Self{iter}}#[inline]pub fn scan<T>(&mut self)-><T as IterScan>::Output where T:IterScan{<T as IterScan>::scan(&mut self.iter).expect("scan error")}#[inline]pub fn mscan<T>(&mut self,marker:T)-><T as MarkedIterScan>::Output where T:MarkedIterScan{marker.mscan(&mut self.iter).expect("scan error")}#[inline]pub fn scan_vec<T>(&mut self,size:usize)->Vec<<T as IterScan>::Output>where T:IterScan{(0..size).map(|_|<T as IterScan>::scan(&mut self.iter).expect("scan error")).collect()}#[inline]pub fn iter<'b,T>(&'b mut self)->ScannerIter<'a,'b,T>where T:IterScan{ScannerIter{inner:self,_marker:std::marker::PhantomData}}}macro_rules!iter_scan_impls{($($t:ty)*)=>{$(impl IterScan for$t{type Output=Self;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self>{iter.next()?.parse::<$t>().ok()}})*};}iter_scan_impls!(char u8 u16 u32 u64 usize i8 i16 i32 i64 isize f32 f64 u128 i128 String);macro_rules!iter_scan_tuple_impl{(@impl$($T:ident)*)=>{impl<$($T:IterScan),*>IterScan for($($T,)*){type Output=($(<$T as IterScan>::Output,)*);#[inline]fn scan<'a,It:Iterator<Item=&'a str>>(_iter:&mut It)->Option<Self::Output>{Some(($(<$T as IterScan>::scan(_iter)?,)*))}}};(@inner$($T:ident)*,)=>{iter_scan_tuple_impl!(@impl$($T)*);};(@inner$($T:ident)*,$U:ident$($Rest:ident)*)=>{iter_scan_tuple_impl!(@impl$($T)*);iter_scan_tuple_impl!(@inner$($T)*$U,$($Rest)*);};($($T:ident)*)=>{iter_scan_tuple_impl!(@inner,$($T)*);};}iter_scan_tuple_impl!(A B C D E F G H I J K);pub struct ScannerIter<'a,'b,T>{inner:&'b mut Scanner<'a>,_marker:std::marker::PhantomData<fn()->T>}impl<'a,'b,T>Iterator for ScannerIter<'a,'b,T>where T:IterScan{type Item=<T as IterScan>::Output;#[inline]fn next(&mut self)->Option<Self::Item>{<T as IterScan>::scan(&mut self.inner.iter)}}#[doc=" - `scan_value!(scanner, ELEMENT)`"]#[doc=""]#[doc=" ELEMENT :="]#[doc=" - `$ty`: IterScan"]#[doc=" - `@$expr`: MarkedIterScan"]#[doc=" - `[ELEMENT; $expr]`: vector"]#[doc=" - `[ELEMENT]`: iterator"]#[doc=" - `($(ELEMENT)*,)`: tuple"]#[macro_export]macro_rules!scan_value{(@repeat$scanner:expr,[$($t:tt)*]$($len:expr)?)=>{::std::iter::repeat_with(||$crate::scan_value!(@inner$scanner,[]$($t)*))$(.take($len).collect::<Vec<_>>())?};(@tuple$scanner:expr,[$([$($args:tt)*])*])=>{($($($args)*,)*)};(@$tag:ident$scanner:expr,[[$($args:tt)*]])=>{$($args)*};(@$tag:ident$scanner:expr,[$($args:tt)*]@$e:expr)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$scanner.mscan($e)]])};(@$tag:ident$scanner:expr,[$($args:tt)*]@$e:expr,$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$scanner.mscan($e)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*]($($tuple:tt)*)$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@tuple$scanner,[]$($tuple)*)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][@$e:expr;$len:expr]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[@$e]$len)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][[$($tt:tt)*];$len:expr]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[[$($tt)*]]$len)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][($($tt:tt)*);$len:expr]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[($($tt)*)]$len)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][$ty:ty;$len:expr]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[$ty]$len)]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*][$($tt:tt)*]$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$crate::scan_value!(@repeat$scanner,[$($tt)*])]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*]$ty:ty)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$scanner.scan::<$ty>()]])};(@$tag:ident$scanner:expr,[$($args:tt)*]$ty:ty,$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*[$scanner.scan::<$ty>()]]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*],$($t:tt)*)=>{$crate::scan_value!(@$tag$scanner,[$($args)*]$($t)*)};(@$tag:ident$scanner:expr,[$($args:tt)*])=>{::std::compile_error!(::std::stringify!($($args)*))};($scanner:expr,$($t:tt)*)=>{$crate::scan_value!(@inner$scanner,[]$($t)*)}}#[doc=" - `scan!(scanner, $($pat $(: ELEMENT)?),*)`"]#[macro_export]macro_rules!scan{(@assert$p:pat)=>{};(@assert$($p:tt)*)=>{::std::compile_error!(::std::concat!("expected pattern, found `",::std::stringify!($($p)*),"`"));};(@pat$scanner:expr,[][])=>{};(@pat$scanner:expr,[][],$($t:tt)*)=>{$crate::scan!(@pat$scanner,[][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]$x:ident$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*$x][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]::$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*::][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]&$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*&][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]($($x:tt)*)$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*($($x)*)][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][][$($x:tt)*]$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*[$($x)*]][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]{$($x:tt)*}$($t:tt)*)=>{$crate::scan!(@pat$scanner,[$($p)*{$($x)*}][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]:$($t:tt)*)=>{$crate::scan!(@ty$scanner,[$($p)*][]$($t)*)};(@pat$scanner:expr,[$($p:tt)*][]$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][usize]$($t)*)};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]@$e:expr)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*@$e])};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]@$e:expr,$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*@$e],$($t)*)};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]($($x:tt)*)$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*($($x)*)]$($t)*)};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*][$($x:tt)*]$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*[$($x)*]]$($t)*)};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]$ty:ty)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*$ty])};(@ty$scanner:expr,[$($p:tt)*][$($tt:tt)*]$ty:ty,$($t:tt)*)=>{$crate::scan!(@let$scanner,[$($p)*][$($tt)*$ty],$($t)*)};(@let$scanner:expr,[$($p:tt)*][$($tt:tt)*]$($t:tt)*)=>{$crate::scan!{@assert$($p)*}let$($p)* =$crate::scan_value!($scanner,$($tt)*);$crate::scan!(@pat$scanner,[][]$($t)*)};($scanner:expr,$($t:tt)*)=>{$crate::scan!(@pat$scanner,[][]$($t)*)}}#[derive(Debug,Copy,Clone)]pub enum Usize1{}impl IterScan for Usize1{type Output=usize;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{<usize as IterScan>::scan(iter)?.checked_sub(1)}}#[derive(Debug,Copy,Clone)]pub struct CharWithBase(pub char);impl MarkedIterScan for CharWithBase{type Output=usize;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some((<char as IterScan>::scan(iter)?as u8-self.0 as u8)as usize)}}#[derive(Debug,Copy,Clone)]pub enum Chars{}impl IterScan for Chars{type Output=Vec<char>;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{Some(iter.next()?.chars().collect())}}#[derive(Debug,Copy,Clone)]pub struct CharsWithBase(pub char);impl MarkedIterScan for CharsWithBase{type Output=Vec<usize>;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some(iter.next()?.chars().map(|c|(c as u8-self.0 as u8)as usize).collect())}}#[derive(Debug,Copy,Clone)]pub struct ByteWithBase(pub u8);impl MarkedIterScan for ByteWithBase{type Output=usize;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some((<char as IterScan>::scan(iter)?as u8-self.0)as usize)}}#[derive(Debug,Copy,Clone)]pub enum Bytes{}impl IterScan for Bytes{type Output=Vec<u8>;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{Some(iter.next()?.bytes().collect())}}#[derive(Debug,Copy,Clone)]pub struct BytesWithBase(pub u8);impl MarkedIterScan for BytesWithBase{type Output=Vec<usize>;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{Some(iter.next()?.bytes().map(|c|(c-self.0)as usize).collect())}}#[derive(Debug,Copy,Clone)]pub struct Collect<T,B=Vec<<T as IterScan>::Output>>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{size:usize,_marker:PhantomData<fn()->(T,B)>}impl<T,B>Collect<T,B>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{pub fn new(size:usize)->Self{Self{size,_marker:PhantomData}}}impl<T,B>MarkedIterScan for Collect<T,B>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{type Output=B;#[inline]fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{repeat_with(||<T as IterScan>::scan(iter)).take(self.size).collect()}}#[derive(Debug,Copy,Clone)]pub struct SizedCollect<T,B=Vec<<T as IterScan>::Output>>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{_marker:PhantomData<fn()->(T,B)>}impl<T,B>IterScan for SizedCollect<T,B>where T:IterScan,B:FromIterator<<T as IterScan>::Output>{type Output=B;#[inline]fn scan<'a,I:Iterator<Item=&'a str>>(iter:&mut I)->Option<Self::Output>{let size=usize::scan(iter)?;repeat_with(||<T as IterScan>::scan(iter)).take(size).collect()}}#[derive(Debug,Copy,Clone)]pub struct Splitted<T,P>where T:IterScan{pat:P,_marker:PhantomData<fn()->T>}impl<T,P>Splitted<T,P>where T:IterScan{pub fn new(pat:P)->Self{Self{pat,_marker:PhantomData}}}impl<T>MarkedIterScan for Splitted<T,char>where T:IterScan{type Output=Vec<<T as IterScan>::Output>;fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{let mut iter=iter.next()?.split(self.pat);Some(from_fn(||<T as IterScan>::scan(&mut iter)).collect())}}impl<T>MarkedIterScan for Splitted<T,&str>where T:IterScan{type Output=Vec<<T as IterScan>::Output>;fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{let mut iter=iter.next()?.split(self.pat);Some(from_fn(||<T as IterScan>::scan(&mut iter)).collect())}}impl<T,F>MarkedIterScan for F where F:Fn(&str)->Option<T>{type Output=T;fn mscan<'a,I:Iterator<Item=&'a str>>(self,iter:&mut I)->Option<Self::Output>{self(iter.next()?)}}}
mod mlambda{#[doc=" Macro that define closure like macro. Unlike closure, this macro localizes variable capture."]#[doc=""]#[doc=" # Example"]#[doc=" ```"]#[doc=" # use competitive::mlambda;"]#[doc=" let graph: Vec<Vec<usize>> = vec![vec![1, 2], vec![2], vec![]];"]#[doc=" let mut deq = std::collections::VecDeque::new();"]#[doc=" let mut dist: Vec<usize> = vec![!0; 3];"]#[doc=" mlambda!("]#[doc="     fn push(v: usize, cost: usize) {"]#[doc="         if dist[v] > cost {"]#[doc="             dist[v] = cost;"]#[doc="             deq.push_back(v);"]#[doc="         }"]#[doc="     }"]#[doc=" );"]#[doc=" push!(0, 0);"]#[doc=" while let Some(v) = deq.pop_front() {"]#[doc="     for &to in &graph[v] {"]#[doc="         push!(to, dist[v] + 1);"]#[doc="     }"]#[doc=" }"]#[doc=" assert_eq!(vec![0, 1, 1], dist);"]#[doc=" ```"]#[macro_export]macro_rules!mlambda{(@def($dol:tt)[$([$x:ident])*][$([$y:ident,$($z:tt)*])*]fn$name:ident($($args:tt)*)->$ret:ty$body:block)=>{macro_rules!$name{($($dol$x:expr),*$dol(,)?)=>{{$(let$y$($z)* =$dol$y;)*$body}}}};(@pre()[$($x:tt)*][$($y:tt)*]fn$name:ident($($args:tt)*)->$ret:ty$body:block)=>{$crate::mlambda!(@def($)[$($x)*][$($y)*]fn$name($($args)*)->$ret$body)};(@pre()[$($x:tt)*][$($y:tt)*]fn$name:ident($($args:tt)*)$body:block)=>{$crate::mlambda!(@pre()[$($x)*][$($y)*]fn$name($($args)*)->()$body)};(@pre($arg:ident$(:$ty:ty)?)[$($x:tt)*][$($y:tt)*]$($rest:tt)*)=>{$crate::mlambda!(@pre()[$($x)*[$arg]][$($y)*[$arg,$(:$ty)?]]$($rest)*)};(@pre($arg:ident$(:$ty:ty)?,$($args:tt)*)[$($x:tt)*][$($y:tt)*]$($rest:tt)*)=>{$crate::mlambda!(@pre($($args)*)[$($x)*[$arg]][$($y)*[$arg,$(:$ty)?]]$($rest)*)};(fn$name:ident($($args:tt)*)$($rest:tt)*)=>{$crate::mlambda!(@pre($($args)*)[][]fn$name($($args)*)$($rest)*)};}}
mod capture{#[doc=" Macro that returns a recursive function that (semi-)automatically captures."]#[doc=""]#[doc=" # Example"]#[doc=" default version"]#[doc=" ```"]#[doc=" # use competitive::crecurse;"]#[doc=" let mut res = 0usize;"]#[doc=" let coeff = 3usize;"]#[doc=" crecurse!("]#[doc="     // (1) semi-automatically capture mutable reference (res: &mut usize)"]#[doc="     [res: usize],"]#[doc="     fn mul(x: usize, y: usize) {"]#[doc="         if y > 0 {"]#[doc="             if y % 2 == 1 {"]#[doc="                 // (2) automatically capture reference (coeff: &usize)"]#[doc="                 *res += coeff * x;"]#[doc="             }"]#[doc="             // (3) call macro to recurse"]#[doc="             mul!(x + x, y / 2);"]#[doc="         }"]#[doc="     }"]#[doc=" )(10, 19); // (4) macro returns captured version of the recursive function"]#[doc=" assert_eq!(res, coeff * 10 * 19);"]#[doc=" ```"]#[doc=""]#[doc=" unsafe version (automatically capture everything)"]#[doc=" ```"]#[doc=" # use competitive::crecurse;"]#[doc=" let mut res = 0usize;"]#[doc=" let coeff = 3usize;"]#[doc=" crecurse!("]#[doc="     unsafe fn mul(x: usize, y: usize) {"]#[doc="         if y > 0 {"]#[doc="             if y % 2 == 1 {"]#[doc="                 res += coeff * x;"]#[doc="             }"]#[doc="             mul!(x + x, y / 2);"]#[doc="         }"]#[doc="     }"]#[doc=" )(10, 19);"]#[doc=" assert_eq!(res, coeff * 10 * 19);"]#[doc=" ```"]#[doc=""]#[doc=" no overhead version (semi-automatically capture everything)"]#[doc=" ```"]#[doc=" # use competitive::crecurse;"]#[doc=" let mut res = 0usize;"]#[doc=" let coeff = 3usize;"]#[doc=" crecurse!("]#[doc="     [res: &mut usize, coeff: &usize],"]#[doc="     static fn mul(x: usize, y: usize) {"]#[doc="         if y > 0 {"]#[doc="             if y % 2 == 1 {"]#[doc="                 *res += coeff * x;"]#[doc="             }"]#[doc="             mul!(x + x, y / 2);"]#[doc="         }"]#[doc="     }"]#[doc=" )(10, 19);"]#[doc=" assert_eq!(res, coeff * 10 * 19);"]#[doc=" ```"]#[doc=""]#[doc=" # Syntax"]#[doc=" ```txt"]#[doc=" crecurse!("]#[doc="     ([($ident: $type),*,?],)?"]#[doc="     (unsafe|static)? fn $ident\\(($ident: $type),*,?\\) (-> $type)? $block"]#[doc=" )"]#[doc=" ```"]#[macro_export]macro_rules!crecurse{(@macro_def($dol:tt)$name:ident$($cargs:ident)*)=>{#[allow(unused_macros)]macro_rules!$name{($dol($dol args:expr),*)=>{$name($dol($dol args,)*$($cargs,)*)}}};(@static[$(($cargs:ident,$cargsexpr:expr,$cargsty:ty))*][$(,)?],fn$func:ident($($args:ident:$argsty:ty),*$(,)?)->$ret:ty$body:block)=>{{fn$func($($args:$argsty,)*$($cargs:$cargsty,)*)->$ret{$crate::crecurse!(@macro_def($)$func$($cargs)*);$body}|$($args:$argsty,)*|->$ret{$func($($args,)*$($cargsexpr,)*)}}};(@static[$($pcaps:tt)*][$(,)?],fn$func:ident($($argstt:tt)*)$($rest:tt)*)=>{$crate::crecurse!(@static[$($pcaps)*][],fn$func($($argstt)*)->()$($rest)*)};(@static[$($pcaps:tt)*][$carg:ident:&mut$cargty:ty,$($caps:tt)*],$($rest:tt)*)=>{$crate::crecurse!(@static[$($pcaps)*($carg,&mut$carg,&mut$cargty)][$($caps)*],$($rest)*)};(@static[$($pcaps:tt)*][$carg:ident:&$cargty:ty,$($caps:tt)*],$($rest:tt)*)=>{$crate::crecurse!(@static[$($pcaps)*($carg,&$carg,&$cargty)][$($caps)*],$($rest)*)};(@static[$($pcaps:tt)*][$carg:ident:$cargty:ty,$($caps:tt)*],$($rest:tt)*)=>{$crate::crecurse!(@static[$($pcaps)*($carg,$carg,$cargty)][$($caps)*],$($rest)*)};($([$($caps:tt)*],)?static fn$func:ident($($args:ident:$argsty:ty),*$(,)?)$($rest:tt)*)=>{$crate::crecurse!(@static[][$($($caps)*)?,],fn$func($($args:$argsty),*)$($rest)*)};(@default[$($cargs:ident:$cargsty:ty),*$(,)?],fn$func:ident($($args:ident:$argsty:ty),*$(,)?)->$ret:ty$body:block)=>{{fn call<F>(f:&F,$($args:$argsty,)*$($cargs:&mut$cargsty,)*)->$ret where F:Fn(&dyn Fn($($argsty,)*$(&mut$cargsty,)*)->$ret,$($argsty,)*$(&mut$cargsty,)*)->$ret,{f(&|$($args:$argsty,)*$($cargs:&mut$cargsty,)*|->$ret{call(f,$($args,)*$($cargs,)*)},$($args,)*$($cargs,)*)}|$($args:$argsty,)*|->$ret{call(&|$func,$($args:$argsty,)*$($cargs:&mut$cargsty,)*|->$ret{$crate::crecurse!(@macro_def($)$func$($cargs)*);$body},$($args,)*$(&mut$cargs,)*)}}};(@default[$($caps:tt)*],fn$func:ident($($argstt:tt)*)$($rest:tt)*)=>{$crate::crecurse!(@default[$($caps)*],fn$func($($argstt)*)->()$($rest)*)};($([$($caps:tt)*],)?fn$func:ident($($args:ident:$argsty:ty),*$(,)?)$($rest:tt)*)=>{$crate::crecurse!(@default[$($($caps)*)?],fn$func($($args:$argsty),*)$($rest)*)};(@unsafe[$($cargs:ident:$cargsty:ty),*$(,)?],fn$func:ident($($args:ident:$argsty:ty),*$(,)?)->$ret:ty$body:block)=>{{fn call<F>(f:&mut F,$($args:$argsty,)*$($cargs:&mut$cargsty,)*)->$ret where F:FnMut(&mut dyn FnMut($($argsty,)*$(&mut$cargsty,)*)->$ret,$($argsty,)*$(&mut$cargsty,)*)->$ret,{let fp=f as*mut F;(unsafe{&mut*fp})(&mut|$($args:$argsty,)*$($cargs:&mut$cargsty,)*|->$ret{call(unsafe{&mut*fp},$($args,)*$($cargs,)*)},$($args,)*$($cargs,)*)}|$($args:$argsty,)*|->$ret{call(&mut|$func,$($args:$argsty,)*$($cargs:&mut$cargsty,)*|->$ret{$crate::crecurse!(@macro_def($)$func$($cargs)*);$body},$($args,)*$(&mut$cargs,)*)}}};(@unsafe[$($caps:tt)*],fn$func:ident($($argstt:tt)*)$($rest:tt)*)=>{$crate::crecurse!(@unsafe[$($caps)*],fn$func($($argstt)*)->()$($rest)*)};($([$($caps:tt)*],)?unsafe fn$func:ident($($args:ident:$argsty:ty),*$(,)?)$($rest:tt)*)=>{$crate::crecurse!(@unsafe[$($($caps)*)?],fn$func($($args:$argsty),*)$($rest)*)};($($t:tt)*)=>{::std::compile_error!(::std::concat!("invalid input: ",::std::stringify!($($t)*)))};}#[doc=" Automatic memorization for recursive functions."]#[doc=""]#[doc=" This macro binds memorized version of the recursive functions to a local variable."]#[doc=" The specification of the function declaration part is the same as [`crecurse`]."]#[doc=""]#[doc=" [`crecurse`]: crate::crecurse"]#[doc=""]#[doc=" # Example"]#[doc=" ```"]#[doc=" # use competitive::memorize;"]#[doc=" memorize!("]#[doc="     fn comb(n: usize, r: usize) -> usize {"]#[doc="         if r > n {"]#[doc="             0"]#[doc="         } else if r == 0 || r == n {"]#[doc="             1"]#[doc="         } else {"]#[doc="             comb!(n - 1, r) + comb!(n - 1, r - 1)"]#[doc="         }"]#[doc="     }"]#[doc=" );"]#[doc=" assert_eq!(comb(30, 12), 86493225);"]#[doc=" ```"]#[macro_export]macro_rules!memorize{(@inner[$map:ident,$Map:ty,$init:expr]fn$name:ident($($args:ident:$argsty:ty),*$(,)?)->$ret:ty$body:block)=>{let mut$map:$Map=$init;#[allow(unused_mut)]let mut$name=$crate::crecurse!([$map:$Map],fn$name($($args:$argsty),*)->$ret{if let Some(value)=$map.get(&($($args,)*)).cloned(){value}else{let value=(||$body)();$map.insert(($($args,)*),value.clone());value}});};(fn$name:ident($($args:ident:$argsty:ty),*$(,)?)->$ret:ty$body:block)=>{$crate::memorize!(@inner[__memorize_map,::std::collections::HashMap<($($argsty,)*),$ret>,::std::default::Default::default()]fn$name($($args:$argsty),*)->$ret$body);}}}
0