結果

問題 No.5020 Averaging
ユーザー nephrologistnephrologist
提出日時 2024-02-25 17:12:51
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 7,187 bytes
コンパイル時間 1,190 ms
コンパイル使用メモリ 187,496 KB
実行使用メモリ 13,820 KB
スコア 12,882,588
最終ジャッジ日時 2024-02-25 17:13:01
合計ジャッジ時間 8,862 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge10
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 96 ms
13,696 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 108 ms
13,732 KB
testcase_04 AC 97 ms
13,804 KB
testcase_05 AC 106 ms
13,692 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 106 ms
13,716 KB
testcase_09 AC 110 ms
13,716 KB
testcase_10 AC 110 ms
13,684 KB
testcase_11 AC 109 ms
13,704 KB
testcase_12 AC 106 ms
13,724 KB
testcase_13 AC 109 ms
13,712 KB
testcase_14 AC 106 ms
13,712 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 108 ms
13,704 KB
testcase_22 AC 98 ms
13,788 KB
testcase_23 WA -
testcase_24 AC 110 ms
13,700 KB
testcase_25 AC 116 ms
13,704 KB
testcase_26 AC 104 ms
13,780 KB
testcase_27 AC 98 ms
13,720 KB
testcase_28 WA -
testcase_29 AC 106 ms
13,700 KB
testcase_30 AC 107 ms
13,704 KB
testcase_31 WA -
testcase_32 AC 113 ms
13,712 KB
testcase_33 AC 107 ms
13,760 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 100 ms
13,732 KB
testcase_38 AC 109 ms
13,728 KB
testcase_39 AC 106 ms
13,716 KB
testcase_40 WA -
testcase_41 AC 102 ms
13,712 KB
testcase_42 WA -
testcase_43 WA -
testcase_44 AC 103 ms
13,696 KB
testcase_45 WA -
testcase_46 AC 108 ms
13,704 KB
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_variables)]
#![allow(unused_mut)]
#![allow(non_upper_case_globals)]
//proconio
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

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

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

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

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

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

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

const mokuhyou: usize = 500000000000000000;
const n: usize = 45;
use std::cmp::Ordering;
use std::cmp::{Eq, Ord, PartialEq, PartialOrd};
use std::collections::BinaryHeap;
const WID: usize = 50;
const CHA: usize = 50;

pub fn get_time() -> f64 {
    static mut STIME: f64 = -1.0; // 初期値
    let t = std::time::SystemTime::now() // nowを取得
        .duration_since(std::time::UNIX_EPOCH)
        .unwrap();
    // a.duration_since(b)だとa>bが前提
    let ms = t.as_secs() as f64 + t.subsec_nanos() as f64 * 1e-9;
    // as_secsが秒, .subsec_nanos()が小数点以下の秒
    unsafe {
        if STIME < 0.0 {
            STIME = ms; // 経過時間の初期化
        }
        // ローカル環境とジャッジ環境の実行速度差はget_timeで吸収しておくと便利
        #[cfg(feature = "local")]
        {
            (ms - STIME) * 1.3
        }
        #[cfg(not(feature = "local"))]
        {
            ms - STIME
        }
    }
}
fn main() {
    get_time();
    input! {nn:usize, XY:[(usize,usize);n]}
    let inp = Input { XY };
    let mut rng = Xorshift::new(20250225);
    // eprintln!("XY {:?}", &inp.XY);
    let bestboard = beam_search(&inp, &mut rng, WID, CHA);
    bestboard.printstate();
    eprintln!(
        "{}",
        bestboard.nowval[0].0.abs_diff(mokuhyou) + bestboard.nowval[0].1.abs_diff(mokuhyou)
    );
    eprintln!("time {}", get_time());
    eprintln!("cost {}", bestboard.cost);
}

struct Xorshift {
    val: usize,
}
impl Xorshift {
    fn new(seed: usize) -> Self {
        let mut hoge = seed;
        hoge ^= seed << 17;
        hoge ^= seed >> 13;
        hoge ^= seed << 5;
        Xorshift { val: hoge }
    }
    fn next(&mut self) {
        let hoge = self.val;
        self.val ^= hoge << 17;
        self.val ^= hoge >> 13;
        self.val ^= hoge << 5;
    }
    fn rand(&mut self) -> f64 {
        self.next();
        (self.val / std::usize::MAX) as f64
    }
    fn randint(&mut self, a: usize, b: usize) -> usize {
        self.next();
        self.val % (b - a)
    }
}
struct Input {
    XY: Vec<(usize, usize)>,
}
#[derive(Clone)]
// #[derive(Debug, PartialEq, PartialOrd, Eq)]
struct Board {
    orders: Vec<(usize, usize)>,
    nowval: Vec<(usize, usize)>,
    goukei: usize,
    nijou: usize,
    cost: f64,
}

impl Board {
    fn new(inp: &Input) -> Self {
        let mut goukei = 0;
        let mut nijou = 0;
        for &(a, b) in inp.XY.iter() {
            goukei += a + b;
            nijou += a * a + b * b;
        }

        Self {
            orders: vec![],
            nowval: inp.XY.clone(),
            goukei,
            nijou,
            cost: std::f64::MAX,
        }
    }
    fn action(&mut self, a: usize, b: usize, rng: &mut Xorshift) {
        let n1 = self.nowval[a].0;
        let n2 = self.nowval[a].1;
        let n3 = self.nowval[b].0;
        let n4 = self.nowval[b].1;
        let v1 = (n1 + n3) / 2;
        let v2 = (n2 + n4) / 2;
        self.nowval[a] = (v1, v2);
        self.nowval[b] = (v1, v2);
        self.orders.push((a + 1, b + 1));
        self.nijou += 2 * (v1 * v1 + v2 * v2) - (n1 * n1 + n2 * n2 + n3 * n3 + n4 * n4);
        self.calccost(rng);
    }
    fn calccost(&mut self, rng: &mut Xorshift) {
        let std = (self.nijou / (n * n)) as f64
            - (self.goukei as f64 / n as f64) * (self.goukei as f64 / n as f64);
        // self.cost = (mokuhyou.abs_diff(self.nowval[0].0) + mokuhyou.abs_diff(self.nowval[0].1))
        //     as f64
        //     - std;
        self.cost = (mokuhyou.abs_diff(self.nowval[0].0) + mokuhyou.abs_diff(self.nowval[0].1))
            as f64
            + rng.rand();
    }
    fn printstate(&self) {
        println!("{}", self.orders.len());
        for &(a, b) in self.orders.iter() {
            println!("{} {}", a, b);
        }
    }
}
// 順序関係を作る。

impl Ord for Board {
    fn cmp(&self, other: &Self) -> Ordering {
        other.partial_cmp(self).unwrap_or(Ordering::Equal)
    }
}

impl PartialEq for Board {
    fn eq(&self, other: &Self) -> bool {
        self.cost == other.cost
    }
}
impl Eq for Board {} // ここは空でOK
impl PartialOrd for Board {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        other.cost.partial_cmp(&self.cost)
    }
}

fn beam_search(inp: &Input, rng: &mut Xorshift, beam_width: usize, challenge_time: usize) -> Board {
    let mut board = Board::new(inp);
    let mut preheap = BinaryHeap::new();
    let mut nexheap = BinaryHeap::new();
    board.calccost(rng);
    let mut bestboard = board.clone();
    preheap.push(board);
    for turn in 0..50 {
        eprintln!("turn {}", turn);
        eprintln!("size {}", preheap.len());
        for __ in 0..beam_width {
            if preheap.is_empty() {
                break;
            }
            // eprintln!("pre");
            let mut preboard = preheap.pop().unwrap();
            for ___ in 0..challenge_time {
                let mut nexboard = preboard.clone();
                let idx1 = rng.randint(0, n - 1);
                let idx2 = rng.randint(idx1, n);
                nexboard.action(idx1, idx2, rng);
                nexheap.push(nexboard);
                let mut nexboard = preboard.clone();
                let idx1 = rng.randint(0, n);
                nexboard.action(0, idx1, rng);
                nexheap.push(nexboard);
            }
        }
        preheap.clear();
        for _ in 0..beam_width {
            if nexheap.is_empty() {
                break;
            }
            // eprintln!("nex");
            let mut board = nexheap.pop().unwrap();
            if board.cost < bestboard.cost {
                eprintln!("best");
                bestboard = board.clone();
            }
            preheap.push(board);
        }
        nexheap.clear()
    }

    bestboard
}
0