#826417 (Rust) No.5010 Better Mo's Algorithm is Needed!! (Unweighted)

提出ソース

結果

問題	No.5010 Better Mo's Algorithm is Needed!! (Unweighted)
ユーザー	rhoo
提出日時	2022-12-17 12:40:46
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	4,992 ms / 5,000 ms
コード長	7,439 bytes
コンパイル時間	1,677 ms
実行使用メモリ	14,168 KB
スコア	17,181,565,859
最終ジャッジ日時	2022-12-17 12:51:33
合計ジャッジ時間	643,435 ms
ジャッジサーバーID （参考情報）	judge13 / judge11
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	4,989 ms 13,896 KB
testcase_01	AC	4,990 ms 13,896 KB
testcase_02	AC	4,990 ms 13,924 KB
testcase_03	AC	4,989 ms 13,920 KB
testcase_04	AC	4,990 ms 13,936 KB
testcase_05	AC	4,990 ms 13,936 KB
testcase_06	AC	4,989 ms 13,920 KB
testcase_07	AC	4,990 ms 13,928 KB
testcase_08	AC	4,989 ms 13,976 KB
testcase_09	AC	4,990 ms 13,848 KB
testcase_10	AC	4,989 ms 13,936 KB
testcase_11	AC	4,990 ms 13,896 KB
testcase_12	AC	4,989 ms 14,144 KB
testcase_13	AC	4,989 ms 13,852 KB
testcase_14	AC	4,989 ms 13,944 KB
testcase_15	AC	4,990 ms 13,880 KB
testcase_16	AC	4,988 ms 13,828 KB
testcase_17	AC	4,990 ms 14,052 KB
testcase_18	AC	4,990 ms 13,980 KB
testcase_19	AC	4,990 ms 13,892 KB
testcase_20	AC	4,989 ms 13,872 KB
testcase_21	AC	4,990 ms 13,784 KB
testcase_22	AC	4,989 ms 14,032 KB
testcase_23	AC	4,989 ms 13,996 KB
testcase_24	AC	4,990 ms 13,976 KB
testcase_25	AC	4,989 ms 14,008 KB
testcase_26	AC	4,989 ms 13,872 KB
testcase_27	AC	4,989 ms 13,916 KB
testcase_28	AC	4,989 ms 14,168 KB
testcase_29	AC	4,989 ms 14,048 KB
testcase_30	AC	4,989 ms 13,788 KB
testcase_31	AC	4,990 ms 13,944 KB
testcase_32	AC	4,990 ms 13,932 KB
testcase_33	AC	4,989 ms 13,808 KB
testcase_34	AC	4,990 ms 13,784 KB
testcase_35	AC	4,989 ms 13,884 KB
testcase_36	AC	4,990 ms 13,876 KB
testcase_37	AC	4,988 ms 13,904 KB
testcase_38	AC	4,990 ms 13,812 KB
testcase_39	AC	4,990 ms 13,924 KB
testcase_40	AC	4,990 ms 13,820 KB
testcase_41	AC	4,989 ms 13,892 KB
testcase_42	AC	4,990 ms 13,948 KB
testcase_43	AC	4,989 ms 13,780 KB
testcase_44	AC	4,989 ms 13,876 KB
testcase_45	AC	4,989 ms 13,868 KB
testcase_46	AC	4,990 ms 13,988 KB
testcase_47	AC	4,988 ms 13,968 KB
testcase_48	AC	4,990 ms 13,852 KB
testcase_49	AC	4,989 ms 13,936 KB
testcase_50	AC	4,990 ms 14,016 KB
testcase_51	AC	4,989 ms 13,968 KB
testcase_52	AC	4,990 ms 13,964 KB
testcase_53	AC	4,990 ms 13,908 KB
testcase_54	AC	4,990 ms 13,824 KB
testcase_55	AC	4,992 ms 13,888 KB
testcase_56	AC	4,990 ms 13,900 KB
testcase_57	AC	4,989 ms 13,880 KB
testcase_58	AC	4,991 ms 13,884 KB
testcase_59	AC	4,989 ms 13,852 KB
testcase_60	AC	4,990 ms 13,872 KB
testcase_61	AC	4,989 ms 13,876 KB
testcase_62	AC	4,989 ms 13,816 KB
testcase_63	AC	4,989 ms 13,876 KB
testcase_64	AC	4,989 ms 13,876 KB
testcase_65	AC	4,990 ms 13,840 KB
testcase_66	AC	4,990 ms 13,940 KB
testcase_67	AC	4,990 ms 13,836 KB
testcase_68	AC	4,988 ms 13,996 KB
testcase_69	AC	4,990 ms 13,948 KB
testcase_70	AC	4,989 ms 13,868 KB
testcase_71	AC	4,990 ms 13,816 KB
testcase_72	AC	4,989 ms 13,964 KB
testcase_73	AC	4,990 ms 13,792 KB
testcase_74	AC	4,988 ms 13,992 KB
testcase_75	AC	4,990 ms 13,748 KB
testcase_76	AC	4,988 ms 13,940 KB
testcase_77	AC	4,990 ms 13,868 KB
testcase_78	AC	4,989 ms 13,784 KB
testcase_79	AC	4,990 ms 13,900 KB
testcase_80	AC	4,989 ms 13,952 KB
testcase_81	AC	4,990 ms 13,928 KB
testcase_82	AC	4,989 ms 13,944 KB
testcase_83	AC	4,990 ms 13,796 KB
testcase_84	AC	4,989 ms 13,896 KB
testcase_85	AC	4,990 ms 13,952 KB
testcase_86	AC	4,989 ms 13,832 KB
testcase_87	AC	4,990 ms 13,740 KB
testcase_88	AC	4,988 ms 13,952 KB
testcase_89	AC	4,990 ms 13,888 KB
testcase_90	AC	4,989 ms 13,792 KB
testcase_91	AC	4,989 ms 13,876 KB
testcase_92	AC	4,989 ms 13,884 KB
testcase_93	AC	4,990 ms 13,748 KB
testcase_94	AC	4,989 ms 13,864 KB
testcase_95	AC	4,990 ms 14,004 KB
testcase_96	AC	4,990 ms 13,736 KB
testcase_97	AC	4,989 ms 13,868 KB
testcase_98	AC	4,989 ms 13,868 KB
testcase_99	AC	4,988 ms 13,864 KB
testcase_100	AC	4,989 ms 13,784 KB
testcase_101	AC	4,989 ms 13,900 KB
testcase_102	AC	4,990 ms 13,796 KB
testcase_103	AC	4,989 ms 13,884 KB
testcase_104	AC	4,989 ms 13,864 KB
testcase_105	AC	4,988 ms 13,808 KB
testcase_106	AC	4,990 ms 13,792 KB
testcase_107	AC	4,989 ms 13,748 KB
testcase_108	AC	4,990 ms 13,932 KB
testcase_109	AC	4,989 ms 13,792 KB
testcase_110	AC	4,990 ms 13,832 KB
testcase_111	AC	4,989 ms 13,848 KB
testcase_112	AC	4,990 ms 13,740 KB
testcase_113	AC	4,988 ms 13,944 KB
testcase_114	AC	4,990 ms 13,924 KB
testcase_115	AC	4,988 ms 13,856 KB
testcase_116	AC	4,990 ms 13,808 KB
testcase_117	AC	4,989 ms 13,856 KB
testcase_118	AC	4,989 ms 13,880 KB
testcase_119	AC	4,989 ms 13,828 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

warning: unused macro definition: `debug`
  --> Main.rs:88:14
   |
88 | macro_rules! debug{
   |              ^^^^^
   |
   = note: `#[warn(unused_macros)]` on by default

warning: unused macro definition: `param`
   --> Main.rs:152:14
    |
152 | macro_rules! param{
    |              ^^^^^

warning: unused import: `std::mem`
   --> Main.rs:203:5
    |
203 | use std::mem;
    |     ^^^^^^^^
    |
    = note: `#[warn(unused_imports)]` on by default

warning: unused variable: `p`
   --> Main.rs:345:9
    |
345 |     let p=up as f64/iter as f64;
    |         ^ help: if this is intentional, prefix it with an underscore: `_p`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: field is never read: `st`
   --> Main.rs:218:5
    |
218 |     st:usize,
    |     ^^^^^^^^
    |
    = note: `#[warn(dead_code)]` on by default

warning: associated function is never used: `score`
   --> Main.rs:265:8
    |
265 |     fn score(&self)->i64{
    |        ^^^^^

warning: 6 warnings emitted

ソースコード

raw source code

#![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<T>(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<T:std::str::FromStr>(&mut self)->T{
        loop{
            if let Some(v)=self.stack.next(){
                return v.parse::<T>().unwrap_or_else(|_|panic!("{}: parse error",std::any::type_name::<T>()));
            }

            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 abs_diff(a:usize,b:usize)->usize{
    (a as i64-b as i64).abs() as usize
}


struct Out{
    st:usize,
    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,wt),(N,Q,1));
        for _ in 0..n{
            scan.read::<usize>();
        }

        let mut route=Vec::with_capacity(Q);
        let mut max_score=(0,0,Reverse(!0));
        let mut arg_max=!0;
        for i in 0..Q{
            let l:usize=scan.read();
            let r:usize=scan.read();
            route.push((l,r,i));
            
            let score=(l>>9,r>>9,Reverse(r-l));
            if max_score<score{
                max_score=score;
                arg_max=i;
            }
        }
        route.swap(0,arg_max);

        route[1..].sort_unstable_by_key(|&(l,r,_)|{
            Reverse(
                if l>>9&1==0{
                    (l>>9,(r>>9) as i64,l.pow(3)+r.pow(3))
                }
                else{
                    (l>>9,-((r>>9) as i64),l.pow(3)+r.pow(3))
                }
            )
        });

        Out{st,route}
    }

    #[inline]
    fn score(&self)->i64{
        let mut ret=self.route[0].1-self.route[0].0;

        for i in 1..self.route.len(){
            ret+=self.dist(i-1,i);
        }

        ret as i64
    }

    #[inline]
    fn dist(&self,a:usize,b:usize)->usize{
        let (l0,r0,_)=self.route[a];
        let (l1,r1,_)=self.route[b];

        abs_diff(l0,l1)+abs_diff(r0,r1)
    }

    #[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;256];
    let mut a=0;

    const D:usize=500;

    loop{
        if iter&1023==0{
            const TL:f64=4.98;
            let p=time.get_time()/TL;
            if p>=1.{break;}

            const T0:f64=100.;
            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<th.len()
            }{}
        }
        iter+=1;

        a+=1;
        if Q-D-1<=a{
            a=1;
        }
        let b=a+rnd::next()%D+1;

        let diff=out.try_2opt(a,b);

        if diff<=th[iter&255]{
            out.apply_2opt(a,b);
            score+=diff;
            up+=1;
            best=best.min(score);
        }
    }

    let p=up as f64/iter as f64;
    log!(score,best,iter,iter as f64/1e7,p);

    log!(scoref,out.score() as f64/1e6);
}


fn main(){
    let time=Timer::new();
    let mut out=Out::input();
    log!(init_score,out.score());

    sa(&mut out,&time);

    let stdout=stdout();
    let stdout=&mut BufWriter::new(stdout.lock());
    for (_,_,id) in &out.route{
        writeln!(stdout,"{}",id+1).unwrap();
    }
    stdout.flush().unwrap();
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード