#![allow(non_snake_case)] #[allow(unused)] mod rnd { static mut S:usize=88172645463325252; #[inline] pub fn next()->usize{ unsafe{ S^=S<<7; S^=S>>9; S } } #[inline] pub fn nextf()->f64{ unsafe{ std::mem::transmute::<_,f64>(0x3ff0000000000000|next()&0xfffffffffffff)-1. } } #[inline] pub fn range(a:usize,b:usize)->usize{ next()%(b-a)+a } #[inline] pub fn exu(a:usize,b:usize,skip:usize)->usize{ let ret=range(a,b-1); if ret==skip{b-1} else{ret} } #[inline] pub fn shuffle(list:&mut [T]){ for i in (0..list.len()).rev(){ list.swap(i,next()%(i+1)); } } } #[inline] fn get_time_secs()->f64{ std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH).unwrap().as_secs_f64() } struct Timer(f64); impl Timer{ #[inline] fn new()->Timer{ Timer(get_time_secs()) } #[inline] fn get_time(&self)->f64{ get_time_secs()-self.0 } } #[cfg(local)] #[allow(unused)] macro_rules! debug{ ()=>{ eprintln!(); }; ($x:literal)=>{ eprintln!("{:?}",$x); }; ($x:expr)=>{ eprintln!("{}: {:?}",stringify!($x),$x); }; ($x:literal,$($l:expr),*)=>{ eprint!("{:?}, ",$x); debug!($($l),*); }; ($x:expr,$($l:expr),*)=>{ eprint!("{}: {:?}, ",stringify!($x),$x); debug!($($l),*); } } #[cfg(not(local))] macro_rules! debug{ ($($_:tt)*)=>{} } #[cfg(local)] macro_rules! log{ ()=>{}; ($x:literal)=>{ eprintln!("{}",$x); }; ($x:ident $(,)?)=>{ log!(@out $x,$x); }; ($x:ident,$t:ident $(,)?)=>{ log!(@out $x,$x); log!($t); }; ($x:ident,$($_:ident).* $(,)?)=>{ compile_error!(); }; ($x:ident,$t:expr $(,)?)=>{ log!(@out $x,$t); }; ($($x:ident).* $(,)?)=>{ log!(@last $($x).*;$($x).*); }; ($x:ident,$t:ident,$($rest:tt)*)=>{ log!(@out $x,$x); log!($t,$($rest)*); }; ($x:ident,$($_:ident).*,$($rest:tt)*)=>{ compile_error!(); }; ($x:ident,$t:expr,$($rest:tt)*)=>{ log!(@out $x,$t); log!($($rest)*); }; ($($x:ident).*,$($rest:tt)*)=>{ log!(@last $($x).*;$($x).*); log!($($rest)*); }; (@out $x:ident,$t:expr)=>{ eprintln!("{} = {:?}",stringify!($x),$t); }; (@last $x:ident;$full:expr)=>{ log!(@out $x,$full); }; (@last $_:ident. $($rest:ident).*;$full:expr)=>{ log!(@last $($rest).*;$full) } } #[cfg(not(local))] macro_rules! log{ ($($_:tt)*)=>{} } macro_rules! param{ ($($x:ident:$t:ty=$v:literal),* $(,)?)=>{ #[allow(non_snake_case)] struct Param{ $($x:$t),* } impl Param{ #[inline] fn new()->Self{ Self{ $( $x:match std::env::var(stringify!($x)){ Ok(s)=>s.parse().expect("parse error"), Err(_)=>$v } ),* } } } }; } #[allow(unused)] struct Scanner{ stack:std::str::SplitAsciiWhitespace<'static> } #[allow(unused)] impl Scanner{ #[inline] fn new()->Self{ Self{stack:"".split_ascii_whitespace()} } #[inline] fn read(&mut self)->T{ loop{ if let Some(v)=self.stack.next(){ return v.parse::().unwrap_or_else(|_|panic!("{}: parse error",std::any::type_name::())); } let mut tmp=String::new(); std::io::stdin().read_line(&mut tmp).unwrap(); assert!(!tmp.is_empty()); self.stack=Box::leak(tmp.into_boxed_str()).split_ascii_whitespace(); } } } use std::io::*; use std::mem; use std::cmp::Reverse; const N:usize=200000; const Q:usize=200000; #[inline] fn min_max(a:usize,b:usize)->(usize,usize){ if a>b{ (b,a) } else{ (a,b) } } #[inline] fn abs_diff(a:usize,b:usize)->usize{ (a as i64-b as i64).abs() as usize } struct Out{ wt:usize, st:usize, sum:Vec, route:Vec<(usize,usize,usize)> } impl Out{ #[inline] fn input()->Out{ let mut scan=Scanner::new(); let n:usize=scan.read(); let q:usize=scan.read(); let wt:usize=scan.read(); let st:usize=scan.read(); assert_eq!((n,q),(N,Q)); let mut sum=Vec::with_capacity(N); sum.push(0); for _ in 0..n{ let v:usize=scan.read(); sum.push(sum.last().unwrap().clone()+v); } let mut route=Vec::with_capacity(Q); for i in 0..Q{ let l:usize=scan.read(); let r=scan.read::()-1; route.push((l,r,i)); } Out{wt,sum,st,route} } #[inline] fn greedy(&mut self){ const D:usize=10; self.route[1..].sort_unstable(); let mut block0=vec![Vec::with_capacity(Q/D);D]; let w=Q/D; for i in 0..Q{ block0[(i/w).min(D-1)].push(self.route[i]); } let mut block1=vec![vec![Vec::with_capacity(Q/(D*D));D];D]; for i in 0..D{ block0[i].sort_unstable_by_key(|(_,r,_)|*r); let w=block0[i].len()/D; for j in 0..block0[i].len(){ block1[i][(j/w).min(D-1)].push(block0[i][j]); } } let mut blocks=Vec::with_capacity(D*D); for (i,b0) in block1.into_iter().enumerate(){ for (j,b1) in b0.into_iter().enumerate(){ blocks.push((i,j,b1)); } } blocks.sort_unstable_by_key(|&(y,x,_)|{ if D&1!=y&1{ Reverse((y,!x)) } else{ Reverse((y,x)) } }); self.route.clear(); for (_,_,mut block) in blocks{ while !block.is_empty(){ let arg_max=if self.route.is_empty(){ (0..block.len()).min_by_key(|&i|self.get_first(block[i])).unwrap() } else{ let last=self.route.last().unwrap().clone(); (0..block.len()).min_by_key(|&i|self.get(last,block[i])).unwrap() }; self.route.push(block.swap_remove(arg_max)); } } assert_eq!(self.route.len(),Q); } #[inline] fn score(&self)->i64{ let mut ret=self.get_first(self.route[0]); for i in 1..self.route.len(){ ret+=self.dist(i-1,i); } ret as i64 } #[inline] fn get_first(&self,(l,r,_):(usize,usize,usize))->usize{ self.sum[l]-self.sum[r] } #[inline] fn get(&self,(l0,r0,_):(usize,usize,usize),(l1,r1,_):(usize,usize,usize))->usize{ let (l0,l1)=min_max(l0,l1); let (r0,r1)=min_max(r0,r1); self.sum[l1]-self.sum[l0]+self.sum[r1]-self.sum[r0] } #[inline] fn dist(&self,a:usize,b:usize)->usize{ self.get(self.route[a],self.route[b]) } #[inline] fn try_2opt(&self,a:usize,b:usize)->i64{ let old=self.dist(a-1,a)+self.dist(b-1,b); let new=self.dist(a-1,b-1)+self.dist(a,b); (new-old) as i64 } #[inline] fn apply_2opt(&mut self,a:usize,b:usize){ self.route[a..b].reverse() } } fn sa(out:&mut Out,time:&Timer){ let mut score=0; let mut best=score; let mut iter=0; let mut up=0; let mut th=[0;64]; let mut a=0; const D:usize=800; loop{ if iter&255==0{ const TL:f64=4.95; let p=time.get_time()/TL; if p>=1.{break;} const T0:f64=2500.; const T1:f64=0.; let heat=T0+(T1-T0)*p; let mut id=0; while{ th[id]=(-heat*rnd::nextf().ln()) as i64; th[id+1]=(-heat*rnd::nextf().ln()) as i64; id+=2; id