結果
| 問題 | No.848 なかよし旅行 |
| ユーザー |
 へのく
|
| 提出日時 | 2020-06-29 19:01:08 |
| 言語 | Rust (1.77.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 69 ms / 2,000 ms |
| コード長 | 31,659 bytes |
| コンパイル時間 | 15,030 ms |
| コンパイル使用メモリ | 378,832 KB |
| 実行使用メモリ | 7,424 KB |
| 最終ジャッジ日時 | 2024-11-08 01:17:24 |
| 合計ジャッジ時間 | 17,063 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 69 ms
7,424 KB |
| testcase_01 | AC | 2 ms
5,248 KB |
| testcase_02 | AC | 1 ms
5,248 KB |
| testcase_03 | AC | 2 ms
5,248 KB |
| testcase_04 | AC | 1 ms
5,248 KB |
| testcase_05 | AC | 1 ms
5,248 KB |
| testcase_06 | AC | 1 ms
5,248 KB |
| testcase_07 | AC | 1 ms
5,248 KB |
| testcase_08 | AC | 2 ms
5,248 KB |
| testcase_09 | AC | 2 ms
5,248 KB |
| testcase_10 | AC | 2 ms
5,248 KB |
| testcase_11 | AC | 16 ms
5,248 KB |
| testcase_12 | AC | 20 ms
5,248 KB |
| testcase_13 | AC | 26 ms
5,248 KB |
| testcase_14 | AC | 11 ms
5,248 KB |
| testcase_15 | AC | 24 ms
5,248 KB |
| testcase_16 | AC | 40 ms
6,784 KB |
| testcase_17 | AC | 29 ms
5,760 KB |
| testcase_18 | AC | 16 ms
5,248 KB |
| testcase_19 | AC | 14 ms
5,248 KB |
| testcase_20 | AC | 2 ms
5,248 KB |
| testcase_21 | AC | 34 ms
5,888 KB |
| testcase_22 | AC | 32 ms
6,016 KB |
| testcase_23 | AC | 18 ms
5,248 KB |
| testcase_24 | AC | 1 ms
5,248 KB |
| testcase_25 | AC | 44 ms
6,656 KB |
| testcase_26 | AC | 1 ms
5,248 KB |
| testcase_27 | AC | 1 ms
5,248 KB |
| testcase_28 | AC | 1 ms
5,248 KB |
| testcase_29 | AC | 1 ms
5,248 KB |
ソースコード
#![allow(unused_imports, non_snake_case)]
#![allow(dead_code)]
use crate::{arraylist::List, graph::dijkstra::dijkstra, scanner::Scanner};
fn main() {
let mut scan = Scanner::new();
let n = scan.read::<i32>();
let m = scan.read::<i32>();
let p = scan.read::<i32>() - 1;
let q = scan.read::<i32>() - 1;
let t = scan.read::<i64>();
let mut g = list ! ( list ! ( ) ; n );
for _ in 0..m {
let a = scan.read::<i32>() - 1;
let b = scan.read::<i32>() - 1;
let c = scan.read::<i64>();
g[a].push((c, b));
g[b].push((c, a));
}
let ds = dijkstra(&g, 0);
let dp = dijkstra(&g, p);
let dq = dijkstra(&g, q);
if ds[p] + dp[q] + ds[q] <= t {
println!("{}", t);
} else if max!(2 * ds[p], 2 * ds[q]) > t {
println!("{}", -1);
} else {
let mut ret = 0;
for x in 0..n {
for y in 0..n {
if ds[x] + max!(dp[x] + dp[y], dq[x] + dq[y]) + ds[y] <= t {
chmax!(ret, t - max!(dp[x] + dp[y], dq[x] + dq[y]));
}
}
}
println!("{}", ret);
}
}
pub mod ext {
pub mod range {
use crate::independent::integer::Int;
use std::cmp::{max, min};
use std::ops::{Bound, Range, RangeBounds};
pub trait IntRangeBounds<U: Int>: RangeBounds<U> {
fn lbopt(&self) -> Option<U> {
match self.start_bound() {
Bound::Included(x) => Some(*x),
Bound::Excluded(x) => Some(*x + U::one()),
Bound::Unbounded => None,
}
}
fn ubopt(&self) -> Option<U> {
match self.end_bound() {
Bound::Included(x) => Some(*x + U::one()),
Bound::Excluded(x) => Some(*x),
Bound::Unbounded => None,
}
}
#[doc = " inclusive"]
fn lower_bound(&self, limit: U) -> U {
self.lbopt().map_or(limit, |x| max(limit, x))
}
#[doc = " exclusive"]
fn upper_bound(&self, limit: U) -> U {
self.ubopt().map_or(limit, |x| min(limit, x))
}
fn to_harfopen(&self, lb: U, ub: U) -> Range<U> {
self.lower_bound(lb)..self.upper_bound(ub)
}
fn width(&self) -> U {
if self.empty() {
U::zero()
} else {
self.ubopt().unwrap() - self.lbopt().unwrap()
}
}
fn empty(&self) -> bool {
self.lbopt().is_none()
|| self.ubopt().is_none()
|| !(self.lbopt().unwrap() < self.ubopt().unwrap())
}
fn contain_range(&self, inner: &Self) -> bool {
(match (self.lbopt(), inner.lbopt()) {
(Some(a), Some(b)) => a <= b,
(None, _) => true,
(Some(_), None) => false,
}) && (match (inner.ubopt(), self.ubopt()) {
(Some(a), Some(b)) => a <= b,
(_, None) => true,
(None, Some(_)) => false,
})
}
fn separate_range(&self, other: &Self) -> bool {
if let (Some(a), Some(b)) = (self.ubopt(), other.lbopt()) {
if a <= b {
return true;
}
}
if let (Some(a), Some(b)) = (other.ubopt(), self.lbopt()) {
if a <= b {
return true;
}
}
false
}
fn overlap(&self, other: &Self) -> Range<U> {
let left = if let (Some(a), Some(b)) = (self.lbopt(), other.lbopt()) {
max(a, b)
} else {
self.lbopt().or(other.lbopt()).unwrap()
};
let right = if let (Some(a), Some(b)) = (self.ubopt(), other.ubopt()) {
min(a, b)
} else {
self.ubopt().or(other.ubopt()).unwrap()
};
left..right
}
}
impl<T: ?Sized, U: Int> IntRangeBounds<U> for T where T: RangeBounds<U> {}
}
}
pub mod graph {
pub mod dijkstra {
use crate::{
arraylist::List,
independent::ordered::ToOrdered,
modulo::{ConstValue, ModInt},
};
use std::{cmp::Reverse, collections::BinaryHeap};
pub fn dijkstra(graph: &List<List<(i64, i32)>>, s: i32) -> List<i64> {
let n = graph.ilen();
let mut d = List::init(1i64 << 60, n);
d[s] = 0;
let mut heap = BinaryHeap::new();
heap.push(Reverse((0, s)));
while let Some(Reverse((p_cost, p))) = heap.pop() {
if d[p] < p_cost {
continue;
}
for &(v_cost, v) in &graph[p] {
if d[v] > d[p] + v_cost {
d[v] = d[p] + v_cost;
heap.push(Reverse((d[v], v)));
}
}
}
d
}
pub fn dijkstra_f64(graph: &List<List<(f64, i32)>>, s: i32) -> List<f64> {
let n = graph.ilen();
let mut d = List::init((1i64 << 60) as f64, n);
d[s] = 0.;
let mut heap = BinaryHeap::new();
heap.push(Reverse((0.0.to_ord(), s)));
while let Some(Reverse((p_cost, p))) = heap.pop() {
if d[p] < p_cost.0 {
continue;
}
for &(v_cost, v) in &graph[p] {
if d[v] > d[p] + v_cost {
d[v] = d[p] + v_cost;
heap.push(Reverse((d[v].to_ord(), v)));
}
}
}
d
}
pub fn cnt_min_path<T: ConstValue>(
graph: &List<List<(i64, i32)>>,
dist: &List<i64>,
s: i32,
) -> List<ModInt<T>> {
let n = graph.ilen();
let mut heap = BinaryHeap::new();
let mut dp = List::init(ModInt::<T>::new(0), n);
dp[0] = ModInt::<T>::new(1);
heap.push(Reverse((0, s)));
let mut used = List::init(false, n);
while let Some(Reverse((current, p))) = heap.pop() {
if used[p] {
continue;
}
used[p] = true;
if current > dist[p] {
continue;
}
for &(cost, v) in &graph[p] {
if current + cost == dist[v] {
let tmp = dp[p];
dp[v] += tmp;
heap.push(Reverse((dist[v], v)));
}
}
}
dp
}
}
}
pub mod modulo {
use crate::independent::integer::Int;
use std::marker::PhantomData;
use std::ops::*;
#[derive(Debug, PartialEq, Eq, Copy, Clone, Hash, PartialOrd, Ord)]
pub struct ModInt<T>(pub i64, PhantomData<*const T>);
impl<T: ConstValue> ModInt<T> {
pub fn new<U: Int>(a: U) -> ModInt<T> {
let x = a.to_i64();
if x < 0 {
ModInt::raw(x % T::M + T::M)
} else if x < T::M {
ModInt::raw(x)
} else {
ModInt::raw(x % T::M)
}
}
pub fn pow<U: Int>(self, x: U) -> Self {
let mut n = x.to_i64();
let mut a = self;
let mut res = Self::raw(1);
while n > 0 {
if n & 1 == 1 {
res *= a;
}
a = a * a;
n >>= 1;
}
res
}
pub fn inv(self) -> Self {
self.pow(T::M - 2)
}
#[inline]
fn raw(x: i64) -> ModInt<T> {
ModInt(x, PhantomData)
}
}
pub trait ConstValue: PartialEq + Eq + Copy + Clone + std::hash::Hash + Ord {
const M: i64;
}
impl<T> std::fmt::Display for ModInt<T> {
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
write!(f, "{}", self.0)
}
}
macro_rules ! impl_from_for_modint { ( $ ( $ tpe : ident ) ,* ) => { $ ( impl < T : ConstValue > From <$ tpe > for ModInt < T > { fn from ( n : $ tpe ) -> Self { Self :: new ( n ) } } ) * } ; }
impl_from_for_modint!(u8, u16, u32, u64, u128, i8, i16, i32, i64, i128, usize, isize);
impl<T: ConstValue> Add for ModInt<T> {
type Output = ModInt<T>;
fn add(self, other: ModInt<T>) -> ModInt<T> {
let mut ret = self.0 + other.0;
if ret >= T::M {
ret -= T::M;
}
Self::raw(ret)
}
}
impl<T: ConstValue> Sub for ModInt<T> {
type Output = ModInt<T>;
fn sub(self, other: ModInt<T>) -> ModInt<T> {
let mut ret = self.0 + T::M - other.0;
if ret >= T::M {
ret -= T::M
}
Self::raw(ret)
}
}
impl<T: ConstValue> Mul for ModInt<T> {
type Output = ModInt<T>;
fn mul(self, other: ModInt<T>) -> ModInt<T> {
Self::raw(self.0 * other.0 % T::M)
}
}
impl<T: ConstValue> Div for ModInt<T> {
type Output = ModInt<T>;
fn div(self, other: ModInt<T>) -> ModInt<T> {
self * other.inv()
}
}
impl<T: ConstValue> Rem for ModInt<T> {
type Output = ModInt<T>;
fn rem(self, other: ModInt<T>) -> ModInt<T> {
Self::raw(self.0 % other.0)
}
}
macro_rules! impl_assign {
( $ t : ty , $ f : ident , $ f2 : ident ) => {
impl<T: ConstValue> $t for ModInt<T> {
fn $f(&mut self, other: Self) {
*self = self.$f2(other);
}
}
};
}
impl_assign!(AddAssign, add_assign, add);
impl_assign!(SubAssign, sub_assign, sub);
impl_assign!(MulAssign, mul_assign, mul);
impl_assign!(DivAssign, div_assign, div);
impl_assign!(RemAssign, rem_assign, rem);
#[macro_export]
macro_rules! modint {
( ) => {
modint!(1000000007);
};
( $ m : expr ) => {
#[derive(Debug, PartialEq, Eq, Copy, Clone, Hash, PartialOrd, Ord)]
pub enum __M {}
impl $crate::modulo::ConstValue for __M {
const M: i64 = $m;
}
#[allow(dead_code)]
type Z = $crate::modulo::ModInt<__M>;
};
}
macro_rules ! impl_integer_functions { ( $ ( $ tofn : ident , $ fromfn : ident , $ tpe : ident ) ,* ) => { $ ( fn $ tofn ( & self ) -> $ tpe { self . 0 as $ tpe } fn $ fromfn ( x : $ tpe ) -> Self { Self :: new ( x ) } ) * } ; }
impl<T: ConstValue> Int for ModInt<T> {
impl_integer_functions!(
to_u8, from_u8, u8, to_u16, from_u16, u16, to_u32, from_u32, u32, to_u64, from_u64,
u64, to_u128, from_u128, u128, to_i8, from_i8, i8, to_i16, from_i16, i16, to_i32,
from_i32, i32, to_i64, from_i64, i64, to_i128, from_i128, i128, to_usize, from_usize,
usize, to_isize, from_isize, isize
);
fn zero() -> Self {
Self::new(0)
}
fn one() -> Self {
Self::new(1)
}
}
}
pub mod independent {
pub mod integer {
pub trait Int:
std::ops::Add<Output = Self>
+ std::ops::Sub<Output = Self>
+ std::ops::Mul<Output = Self>
+ std::ops::Div<Output = Self>
+ std::ops::Rem<Output = Self>
+ std::ops::AddAssign
+ std::ops::SubAssign
+ std::ops::MulAssign
+ std::ops::DivAssign
+ std::hash::Hash
+ PartialEq
+ Eq
+ PartialOrd
+ Ord
+ Copy
{
fn to_u8(&self) -> u8;
fn to_u16(&self) -> u16;
fn to_u32(&self) -> u32;
fn to_u64(&self) -> u64;
fn to_u128(&self) -> u128;
fn to_i8(&self) -> i8;
fn to_i16(&self) -> i16;
fn to_i32(&self) -> i32;
fn to_i64(&self) -> i64;
fn to_i128(&self) -> i128;
fn to_usize(&self) -> usize;
fn to_isize(&self) -> isize;
fn from_u8(x: u8) -> Self;
fn from_u16(x: u16) -> Self;
fn from_u32(x: u32) -> Self;
fn from_u64(x: u64) -> Self;
fn from_u128(x: u128) -> Self;
fn from_i8(x: i8) -> Self;
fn from_i16(x: i16) -> Self;
fn from_i32(x: i32) -> Self;
fn from_i64(x: i64) -> Self;
fn from_i128(x: i128) -> Self;
fn from_usize(x: usize) -> Self;
fn from_isize(x: isize) -> Self;
fn zero() -> Self;
fn one() -> Self;
fn next(&self) -> Self {
*self + Self::one()
}
}
macro_rules ! impl_integer_functions { ( $ selftpe : ident , $ ( $ tofn : ident , $ fromfn : ident , $ tpe : ident ) ,* ) => { $ ( fn $ tofn ( & self ) -> $ tpe { * self as $ tpe } fn $ fromfn ( x : $ tpe ) -> Self { x as $ selftpe } ) * } ; }
macro_rules ! impl_integer { ( $ ( $ tpe : ident ) ,* ) => { $ ( impl Int for $ tpe { impl_integer_functions ! ( $ tpe , to_u8 , from_u8 , u8 , to_u16 , from_u16 , u16 , to_u32 , from_u32 , u32 , to_u64 , from_u64 , u64 , to_u128 , from_u128 , u128 , to_i8 , from_i8 , i8 , to_i16 , from_i16 , i16 , to_i32 , from_i32 , i32 , to_i64 , from_i64 , i64 , to_i128 , from_i128 , i128 , to_usize , from_usize , usize , to_isize , from_isize , isize ) ; fn zero ( ) -> Self { 0 } fn one ( ) -> Self { 1 } } ) * } ; }
impl_integer!(u8, u16, u32, u64, u128, i8, i16, i32, i64, i128, usize, isize);
}
pub mod ordered {
use std::cmp::Ordering;
use std::ops::Deref;
#[derive(PartialEq, PartialOrd, Debug)]
pub struct Ordered<T>(pub T);
impl<T: PartialEq> Eq for Ordered<T> {}
impl<T: PartialOrd> Ord for Ordered<T> {
fn cmp(&self, other: &Ordered<T>) -> Ordering {
self.0.partial_cmp(&other.0).unwrap()
}
}
impl<T: PartialOrd + PartialEq> From<T> for Ordered<T> {
fn from(value: T) -> Self {
Ordered(value)
}
}
pub trait ToOrdered<T> {
fn to_ord(self) -> Ordered<T>;
}
impl<T: PartialOrd + PartialEq> ToOrdered<T> for T {
fn to_ord(self) -> Ordered<T> {
Ordered(self)
}
}
impl<T> Deref for Ordered<T> {
type Target = T;
#[inline(always)]
fn deref(&self) -> &T {
&self.0
}
}
}
}
pub mod macros {
#[macro_export]
macro_rules ! for_ { ( $ init : stmt ; $ cond : expr ; $ incr : expr , $ body : block ) => { $ init while $ cond { $ body $ incr ; } } ; }
#[macro_export]
macro_rules! chrange {
( $ x : expr , $ r : expr ) => {{
let r = $r;
match std::ops::RangeBounds::start_bound(&r) {
std::ops::Bound::Included(x) => {
$crate::chmax!($x, *x);
}
std::ops::Bound::Excluded(x) => {
$crate::chmax!($x, *x + 1);
}
_ => (),
}
match std::ops::RangeBounds::end_bound(&r) {
std::ops::Bound::Included(x) => {
$crate::chmin!($x, *x);
}
std::ops::Bound::Excluded(x) => {
$crate::chmin!($x, *x - 1);
}
_ => (),
}
}};
}
#[macro_export]
macro_rules! chmax {
( $ x : expr , $ y : expr ) => {
if $x < $y {
$x = $y;
true
} else {
false
}
};
}
#[macro_export]
macro_rules! chmin {
( $ x : expr , $ y : expr ) => {
if $x > $y {
$x = $y;
true
} else {
false
}
};
}
#[macro_export]
macro_rules ! min { ( $ a : expr $ ( , ) * ) => { { $ a } } ; ( $ a : expr , $ b : expr $ ( , ) * ) => { { std :: cmp :: min ( $ a , $ b ) } } ; ( $ a : expr , $ ( $ rest : expr ) ,+ $ ( , ) * ) => { { std :: cmp :: min ( $ a , min ! ( $ ( $ rest ) ,+ ) ) } } ; }
#[macro_export]
macro_rules ! max { ( $ a : expr $ ( , ) * ) => { { $ a } } ; ( $ a : expr , $ b : expr $ ( , ) * ) => { { std :: cmp :: max ( $ a , $ b ) } } ; ( $ a : expr , $ ( $ rest : expr ) ,+ $ ( , ) * ) => { { std :: cmp :: max ( $ a , max ! ( $ ( $ rest ) ,+ ) ) } } ; }
#[macro_export]
macro_rules ! assign { ( $ arr : ident $ ( [ $ a : expr ] ) + = $ right : expr ) => { assign ! ( $ arr , $ ( [ $ a ] ) + , = , $ right , default ) ; } ; ( $ arr : ident $ ( [ $ a : expr ] ) + += $ right : expr ) => { assign ! ( $ arr , $ ( [ $ a ] ) + , += , $ right , default ) ; } ; ( $ arr : ident $ ( [ $ a : expr ] ) + -= $ right : expr ) => { assign ! ( $ arr , $ ( [ $ a ] ) + , -= , $ right , default ) ; } ; ( $ arr : ident $ ( [ $ a : expr ] ) + |= $ right : expr ) => { assign ! ( $ arr , $ ( [ $ a ] ) + , |= , $ right , default ) ; } ; ( $ arr : ident $ ( [ $ a : expr ] ) + &= $ right : expr ) => { assign ! ( $ arr , $ ( [ $ a ] ) + , &= , $ right , default ) ; } ; ( $ arr : ident $ ( [ $ a : expr ] ) + ^= $ right : expr ) => { assign ! ( $ arr , $ ( [ $ a ] ) + , ^= , $ right , default ) ; } ; ( $ arr : ident $ ( [ $ a : expr ] ) + min $ right : expr ) => { assign ! ( $ arr , $ ( [ $ a ] ) + , ^= , $ right , min ) ; } ; ( $ arr : ident $ ( [ $ a : expr ] ) + max $ right : expr ) => { assign ! ( $ arr , $ ( [ $ a ] ) + , ^= , $ right , max ) ; } ; ( $ arr : expr , [ $ head : expr ] , $ op : tt , $ right : expr , default ) => { let head = $ head ; if ( 0 ..$ arr . ilen ( ) ) . contains ( &$ head ) { let tmp = $ right ; $ arr [ head ] $ op tmp ; } } ; ( $ arr : expr , [ $ head : expr ] , $ op : tt , $ right : expr , min ) => { let head = $ head ; if ( 0 ..$ arr . ilen ( ) ) . contains ( &$ head ) { let tmp = $ right ; $ arr [ head ] = std :: cmp :: min ( $ arr [ head ] , tmp ) ; } } ; ( $ arr : expr , [ $ head : expr ] , $ op : tt , $ right : expr , max ) => { let head = $ head ; if ( 0 ..$ arr . ilen ( ) ) . contains ( &$ head ) { let tmp = $ right ; $ arr [ head ] = std :: cmp :: max ( $ arr [ head ] , tmp ) ; } } ; ( $ arr : expr , [ $ head : expr ] $ ( [ $ a : expr ] ) +, $ op : tt , $ right : expr , $ kind : ident ) => { let head = $ head ; if ( 0 ..$ arr . ilen ( ) ) . contains ( &$ head ) { assign ! ( $ arr [ head ] , $ ( [ $ a ] ) +, $ op , $ right , $ kind ) ; } } ; }
#[macro_export]
macro_rules! unwrap {
( $ arg : expr ) => {{
let tmp = $arg;
if tmp.is_none() {
return;
}
tmp.unwrap()
}};
}
#[macro_export]
macro_rules! swap {
( $ a : expr , $ b : expr ) => {
let tmp = $a;
$a = $b;
$b = tmp;
};
}
}
pub mod arraylist {
use crate::{ext::range::IntRangeBounds, independent::integer::Int};
use std::fmt::Formatter;
use std::iter::FromIterator;
use std::ops::{Index, IndexMut, RangeBounds};
use std::slice::Iter;
#[derive(Clone, PartialEq, Eq)]
pub struct List<T> {
pub vec: Vec<T>,
}
impl<T> List<T> {
#[inline]
pub fn new() -> List<T> {
List { vec: vec![] }
}
#[inline]
pub fn init(init: T, n: i32) -> List<T>
where
T: Clone,
{
List {
vec: vec![init; n as usize],
}
}
#[inline]
pub fn from_vec(vec: Vec<T>) -> List<T> {
List { vec }
}
#[inline]
pub fn acc<'a, S>(n: i32, mut f: S) -> List<T>
where
S: FnMut(i32) -> T + 'a,
{
(0..n).map(|i| f(i)).collect()
}
#[inline]
pub fn ilen(&self) -> i32 {
self.vec.len() as i32
}
#[inline]
pub fn iter(&self) -> Iter<'_, T> {
self.vec.iter()
}
#[inline]
pub fn push(&mut self, item: T) {
self.vec.push(item);
}
#[inline]
pub fn sort(&mut self)
where
T: Ord,
{
self.vec.sort();
}
#[inline]
pub fn reverse(&mut self) {
self.vec.reverse();
}
#[inline]
pub fn sort_by<F>(&mut self, compare: F)
where
F: FnMut(&T, &T) -> std::cmp::Ordering,
{
self.vec.sort_by(compare)
}
#[inline]
pub fn sort_by_key<K, F>(&mut self, compare: F)
where
F: FnMut(&T) -> K,
K: Ord,
{
self.vec.sort_by_key(compare)
}
#[inline]
pub fn first(&self) -> Option<&T> {
self.vec.first()
}
#[inline]
pub fn last(&self) -> Option<&T> {
self.vec.last()
}
#[inline]
pub fn pop(&mut self) -> Option<T> {
self.vec.pop()
}
#[inline]
pub fn swap(&mut self, i: i32, j: i32) {
self.vec.swap(i as usize, j as usize);
}
#[inline]
pub fn append(&mut self, mut other: Self) {
self.vec.append(&mut other.vec);
}
#[inline]
pub fn extend(&mut self, other: impl Iterator<Item = T>) {
self.vec.extend(other);
}
#[inline]
pub fn mrr(&self) -> std::iter::Cloned<Iter<T>>
where
T: Clone,
{
self.iter().cloned()
}
#[inline]
pub fn join(&self, sep: &str) -> String
where
T: std::fmt::Display,
{
self.iter()
.map(|x| format!("{}", x))
.collect::<Vec<_>>()
.join(sep)
}
#[inline]
pub fn map<B, F>(&self, f: F) -> List<B>
where
T: Clone,
F: FnMut(T) -> B,
{
self.mrr().map(f).collect()
}
#[inline]
pub fn filter<P>(&self, predicate: P) -> List<T>
where
T: Clone,
P: FnMut(&T) -> bool,
{
self.mrr().filter(predicate).collect()
}
#[inline]
pub fn filter_map<B, F>(&self, f: F) -> List<B>
where
T: Clone,
F: FnMut(T) -> Option<B>,
{
self.mrr().filter_map(f).collect()
}
#[doc = " |acc, x| -> acc"]
#[inline]
pub fn fold<B, F>(&self, init: B, f: F) -> B
where
T: Clone,
F: FnMut(B, T) -> B,
{
self.mrr().fold(init, f)
}
#[inline]
pub fn any<P>(&self, predicate: P) -> bool
where
P: FnMut(&T) -> bool,
{
self.iter().any(predicate)
}
#[inline]
pub fn all<P>(&self, predicate: P) -> bool
where
P: FnMut(&T) -> bool,
{
self.iter().all(predicate)
}
#[inline]
pub fn sum(&self) -> T
where
T: Int,
{
self.iter().cloned().fold(T::zero(), |acc, x| acc + x)
}
#[inline]
pub fn enumerate(&self) -> List<(i32, T)>
where
T: Clone,
{
self.mrr().enumerate().map(|p| (p.0 as i32, p.1)).collect()
}
#[inline]
pub fn find<P>(&self, mut predicate: P) -> Option<&T>
where
P: FnMut(&T) -> bool,
{
self.iter().find(|x| predicate(*x))
}
#[inline]
pub fn index_of<P>(&self, mut predicate: P) -> Option<i32>
where
P: FnMut(&T) -> bool,
{
self.iter()
.enumerate()
.find(|&(_i, x)| predicate(x))
.map(|p| p.0 as i32)
}
#[inline]
pub fn to<B: FromIterator<T>>(&self) -> B
where
T: Clone,
{
self.mrr().collect()
}
#[inline]
pub fn min(&self) -> Option<&T>
where
T: Ord,
{
self.iter().min()
}
#[inline]
pub fn max(&self) -> Option<&T>
where
T: Ord,
{
self.iter().max()
}
#[inline]
pub fn argmin(&self) -> Option<i32>
where
T: Ord,
{
let item = self.iter().min()?;
self.iter()
.enumerate()
.find(|p| p.1 == item)
.map(|p| p.0 as i32)
}
#[inline]
pub fn argmax(&self) -> Option<i32>
where
T: Ord,
{
let item = self.iter().max()?;
self.iter()
.enumerate()
.find(|p| p.1 == item)
.map(|p| p.0 as i32)
}
#[inline]
pub fn part<U>(&self, range: U) -> List<T>
where
T: Clone,
U: RangeBounds<i32>,
{
List::from_vec(
self.vec[range.lower_bound(0) as usize..range.upper_bound(self.ilen()) as usize]
.to_vec(),
)
}
#[inline]
pub fn first_exn(&self) -> &T {
self.first().unwrap()
}
#[inline]
pub fn last_exn(&self) -> &T {
self.last().unwrap()
}
#[inline]
pub fn pop_exn(&mut self) -> T {
self.pop().unwrap()
}
#[inline]
pub fn min_exn(&self) -> &T
where
T: Ord,
{
self.min().unwrap()
}
#[inline]
pub fn max_exn(&self) -> &T
where
T: Ord,
{
self.max().unwrap()
}
#[inline]
pub fn argmin_exn(&self) -> i32
where
T: Ord,
{
self.argmin().unwrap()
}
#[inline]
pub fn argmax_exn(&self) -> i32
where
T: Ord,
{
self.argmax().unwrap()
}
#[inline]
pub fn find_exn<P>(&self, predicate: P) -> &T
where
P: FnMut(&T) -> bool,
{
self.find(predicate).unwrap()
}
#[inline]
pub fn index_of_exn<P>(&self, predicate: P) -> i32
where
P: FnMut(&T) -> bool,
{
self.index_of(predicate).unwrap()
}
}
impl<T> std::ops::BitXorAssign<T> for List<T> {
#[inline]
fn bitxor_assign(&mut self, rhs: T) {
self.push(rhs);
}
}
impl<T> Index<i32> for List<T> {
type Output = T;
#[inline]
fn index(&self, index: i32) -> &Self::Output {
if cfg!(debug_assertions) {
self.vec.index(index as usize)
} else {
unsafe { self.vec.get_unchecked(index as usize) }
}
}
}
impl<T> IndexMut<i32> for List<T> {
#[inline]
fn index_mut(&mut self, index: i32) -> &mut Self::Output {
if cfg!(debug_assertions) {
self.vec.index_mut(index as usize)
} else {
unsafe { self.vec.get_unchecked_mut(index as usize) }
}
}
}
impl<T> FromIterator<T> for List<T> {
fn from_iter<U: IntoIterator<Item = T>>(iter: U) -> Self {
List {
vec: iter.into_iter().collect(),
}
}
}
impl<T> IntoIterator for List<T> {
type Item = T;
type IntoIter = std::vec::IntoIter<T>;
fn into_iter(self) -> std::vec::IntoIter<T> {
self.vec.into_iter()
}
}
impl<'a, T> IntoIterator for &'a List<T> {
type Item = &'a T;
type IntoIter = Iter<'a, T>;
fn into_iter(self) -> Iter<'a, T> {
self.vec.iter()
}
}
impl<T: std::fmt::Display> std::fmt::Display for List<T> {
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
write!(
f,
"{}",
self.iter()
.map(|x| format!("{}", x))
.collect::<Vec<_>>()
.join(" ")
)
}
}
impl<T: std::fmt::Debug> std::fmt::Debug for List<T> {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
write!(
f,
"[{}]",
self.iter()
.map(|x| format!("{:?}", x))
.collect::<Vec<_>>()
.join(", ")
)
}
}
impl<T> From<Vec<T>> for List<T> {
fn from(vec: Vec<T>) -> Self {
Self::from_vec(vec)
}
}
impl<T: Clone> From<&[T]> for List<T> {
fn from(slice: &[T]) -> Self {
slice.iter().cloned().collect()
}
}
#[macro_export]
macro_rules ! list { ( ) => { $ crate :: arraylist :: List :: new ( ) } ; ( $ ( $ v : expr ) ,+ $ ( , ) ? ) => { $ crate :: arraylist :: List :: from_vec ( [ $ ( $ v ) ,+ ] . to_vec ( ) ) } ; ( $ v : expr ; $ a : expr ) => { $ crate :: arraylist :: List :: init ( $ v , $ a ) } ; ( $ v : expr ; $ a : expr ; $ ( $ rest : expr ) ;+ ) => { $ crate :: arraylist :: List :: init ( list ! ( $ v ; $ ( $ rest ) ;+ ) , $ a ) } ; }
}
pub mod scanner {
use crate::arraylist::List;
use std::io::{stdin, BufReader, Bytes, Read, Stdin};
use std::str::FromStr;
macro_rules ! impl_readxn { ( $ name : ident , $ ( $ tpe : ident ) ,+ ) => { pub fn $ name <$ ( $ tpe : FromStr ) ,+> ( & mut self , n : i32 ) -> List < ( $ ( $ tpe ) ,+ ) > { ( 0 .. n ) . map ( | _ | ( $ ( self . read ::<$ tpe > ( ) ) ,+ ) ) . collect ( ) } } ; }
pub struct Scanner {
buf: Bytes<BufReader<Stdin>>,
}
impl Scanner {
pub fn new() -> Scanner {
Scanner {
buf: BufReader::new(stdin()).bytes(),
}
}
pub fn read_next<T: FromStr>(&mut self) -> Option<T> {
let token = self
.buf
.by_ref()
.map(|c| c.unwrap() as char)
.skip_while(|c| c.is_whitespace())
.take_while(|c| !c.is_whitespace())
.collect::<String>();
token.parse::<T>().ok()
}
pub fn read<T: FromStr>(&mut self) -> T {
self.read_next().unwrap()
}
pub fn readn<T: FromStr>(&mut self, n: i32) -> List<T> {
(0..n).map(|_| self.read::<T>()).collect()
}
pub fn chars(&mut self) -> List<char> {
self.read::<String>().chars().collect()
}
impl_readxn!(read2n, P, Q);
impl_readxn!(read3n, P, Q, R);
impl_readxn!(read4n, P, Q, R, S);
impl_readxn!(read5n, P, Q, R, S, T);
}
}