結果

問題 No.5005 3-SAT
ユーザー rhoo
提出日時 2022-06-26 12:18:07
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1,984 ms / 2,000 ms
コード長 6,541 bytes
コンパイル時間 1,326 ms
実行使用メモリ 6,952 KB
スコア 107,770
最終ジャッジ日時 2022-06-26 12:21:37
合計ジャッジ時間 208,126 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 100
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `p`
   --> Main.rs:251:9
    |
251 |     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: 1 warning emitted

ソースコード

diff # 

#[allow(unused)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}


#[allow(unused)]
mod rnd {
    static mut S:usize=88172645463325252;
    #[inline]
    pub fn next()->usize{
        unsafe{
            S=S^S<<7;
            S=S^S>>9;
            S
        }
    }
}


#[allow(unused)]
#[inline]
fn get_time()->f64{
    static mut START:f64=-1.;
    let t=std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH).unwrap().as_secs_f64();
    unsafe{
        if START<0.{START=t;}
        t-START
    }
}

#[cfg(local)]
#[allow(unused)]
macro_rules! debug{
    ($x:expr)=>{
        eprintln!("{}: {:?}",stringify!($x),$x);
    };
    
    ($x:expr,$($l:expr),*)=>{
        eprint!("{}: {:?}, ",stringify!($x),$x);
        debug!($($l),*);
    }
}
#[cfg(not(local))]
#[allow(unused)]
macro_rules! debug{
    ($($_:expr),*)=>{}
}


const N:usize=256;
const M:usize=2048;


struct In{
    edge1:[[Vec<usize>;2];N]
}
impl In{
    fn input()->In{
        input!{
            q:[([usize;3],[usize;3]);M]
        }

        let mut edge1=[();N].map(|_|[vec![],vec![]]);
        for (i,v) in q.iter().enumerate(){
            for (id,f) in v.0.iter().zip(v.1.iter()){
                edge1[*id][*f as usize].push(i);
            }
        }

        In{edge1}
    }
}


struct Out{
    out:[bool;N],
    cnt:[usize;M],
    edge:[[Vec<usize>;2];N]
}
impl Out{
    #[inline]
    // cnt,edgeの計算はしない
    fn new()->Out{
        let mut out=[false;N];
        let mut r=!0;
        for i in 0..N{
            if i&63==0{
                r=rnd::next();
            }
            out[i]=r&1==0;
            r>>=1;
        }

        Out{out,cnt:[0;M],edge:[();N].map(|_|[vec![],vec![]])}
    }

    #[inline]
    fn re(&mut self,input:&In,r:usize){
        self.cnt.fill(0);
        for i in 0..N{
            for j in 0..2{
                self.edge[i][j].clear();
                
                for k in input.edge1[i][j].iter(){
                    if *k<r{
                        self.edge[i][j].push(*k);
                    }
                }
            }

            for j in self.edge[i][self.out[i] as usize].iter(){
                self.cnt[*j]+=1;
            }
        }
    }
    
    #[inline]
    fn score(&mut self)->i64{
        self.cnt.iter().map(|x|(*x!=0) as i64).sum()
    }
    
    #[inline]
    fn change(&mut self,add:i64,idx:usize,f:bool,score:&mut i64)->bool{
        let mut diff=0;
        if self.out[idx]!=f{
            for i in self.edge[idx][!f as usize].iter(){
                self.cnt[*i]-=1;
                if self.cnt[*i]==0{
                    diff-=1;
                }
            }
            for i in self.edge[idx][f as usize].iter(){
                self.cnt[*i]+=1;
                if self.cnt[*i]==1{
                    diff+=1;
                }
            }
        }

        if add<=diff{
            *score+=diff;
            self.out[idx]=f;

            true
        }
        else{
            if self.out[idx]!=f{
                for i in self.edge[idx][!f as usize].iter(){
                    self.cnt[*i]+=1;
                }
                for i in self.edge[idx][f as usize].iter(){
                    self.cnt[*i]-=1;
                }
            }
            false
        }
    }
}


const TL:f64=1.98;


fn sa(r:usize,cur:&mut Out)->bool{
    let mut score=cur.score();

    let mut iter=0;
    let mut up=0;
    let mut th=[0;256];

    loop{
        if iter&2047==0{
            if get_time()>=TL{break;}

            const LIM:f64=500000.;
            let p=iter as f64/LIM as f64;
            if p>=1.{break;}

            const T:f64=0.5;
            let heat=T*(1.-p);

            for i in 0..128{
                let id=i<<1;
                let r=rnd::next();
                th[id]=(heat*((r&4294967295) as f64/4294967296.).ln()) as i64;
                th[id+1]=(heat*((r>>32) as f64/4294967295.).ln()) as i64;
            }
        }
        iter+=1;

        let rnd=rnd::next();

        if cur.change(th[iter&255],rnd%N,rnd>>63==0,&mut score){
            if score==r as i64{break;}
            up+=1;
        }
    }

    let p=up as f64/iter as f64;
    debug!(r,iter,p);
    debug!(score);
    if cfg!(local){
        if score==r as i64{
            eprintln!("success");
        }
        else{
            eprintln!("failed");
        }
    }

    assert_eq!(score,cur.score());

    score==r as i64
}


fn solve(input:&In)->[bool;256]{
    let mut out=Out::new();
    let mut ans=out.out;
    let mut best=0;

    let mut pos=950;
    let mut range=16;

    while get_time()<=TL{
        out.re(input,pos);

        if sa(pos,&mut out){
            ans=out.out;
            best=pos;
            pos+=range;
        }
        else{
            out.out=ans;
            range=1.max(range>>1);
            pos-=range;
            pos=(pos-range).max(best+1);
        }
    }

    eprintln!("score: {}",best);
    if cfg!(local){
        println!("{best}");
    }

    ans
}


fn main(){
    let input=In::input();
    let ans=solve(&input);
    
    if !cfg!(local){
        for &i in ans.iter().rev(){
            print!("{}",i as usize);
        }
        println!();
    }
}
0