結果

問題 No.5019 Hakai Project
ユーザー tipstar0125tipstar0125
提出日時 2023-11-18 18:11:56
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 2,619 ms / 3,000 ms
コード長 14,978 bytes
コンパイル時間 3,533 ms
コンパイル使用メモリ 216,852 KB
実行使用メモリ 6,676 KB
スコア 624,328,621
最終ジャッジ日時 2023-11-18 18:14:09
合計ジャッジ時間 13,782 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,546 ms
6,676 KB
testcase_01 AC 2,524 ms
6,676 KB
testcase_02 AC 2,619 ms
6,676 KB
testcase_03 AC 2,229 ms
6,676 KB
testcase_04 AC 2,487 ms
6,676 KB
testcase_05 AC 2,398 ms
6,676 KB
testcase_06 AC 2,280 ms
6,676 KB
testcase_07 AC 2,539 ms
6,676 KB
testcase_08 AC 2,384 ms
6,676 KB
testcase_09 AC 2,499 ms
6,676 KB
testcase_10 AC 2,244 ms
6,676 KB
testcase_11 AC 2,447 ms
6,676 KB
testcase_12 AC 2,442 ms
6,676 KB
testcase_13 AC 2,433 ms
6,676 KB
testcase_14 AC 2,421 ms
6,676 KB
testcase_15 AC 2,294 ms
6,676 KB
testcase_16 AC 2,442 ms
6,676 KB
testcase_17 AC 2,429 ms
6,676 KB
testcase_18 AC 2,430 ms
6,676 KB
testcase_19 AC 2,446 ms
6,676 KB
testcase_20 AC 2,482 ms
6,676 KB
testcase_21 AC 2,435 ms
6,676 KB
testcase_22 AC 2,322 ms
6,676 KB
testcase_23 AC 2,428 ms
6,676 KB
testcase_24 AC 2,573 ms
6,676 KB
testcase_25 AC 2,397 ms
6,676 KB
testcase_26 AC 2,509 ms
6,676 KB
testcase_27 AC 2,507 ms
6,676 KB
testcase_28 AC 2,284 ms
6,676 KB
testcase_29 AC 2,277 ms
6,676 KB
testcase_30 AC 2,414 ms
6,676 KB
testcase_31 AC 2,279 ms
6,676 KB
testcase_32 AC 2,343 ms
6,676 KB
testcase_33 AC 2,520 ms
6,676 KB
testcase_34 AC 2,462 ms
6,676 KB
testcase_35 AC 2,351 ms
6,676 KB
testcase_36 AC 2,345 ms
6,676 KB
testcase_37 AC 2,274 ms
6,676 KB
testcase_38 AC 2,200 ms
6,676 KB
testcase_39 AC 2,548 ms
6,676 KB
testcase_40 AC 2,535 ms
6,676 KB
testcase_41 AC 2,535 ms
6,676 KB
testcase_42 AC 2,316 ms
6,676 KB
testcase_43 AC 2,574 ms
6,676 KB
testcase_44 AC 2,336 ms
6,676 KB
testcase_45 AC 2,291 ms
6,676 KB
testcase_46 AC 2,414 ms
6,676 KB
testcase_47 AC 2,482 ms
6,676 KB
testcase_48 AC 2,384 ms
6,676 KB
testcase_49 AC 2,449 ms
6,676 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(non_snake_case)]
#![allow(unused_imports)]
#![allow(unused_macros)]
#![allow(clippy::comparison_chain)]
#![allow(clippy::nonminimal_bool)]
#![allow(clippy::neg_multiply)]
#![allow(clippy::type_complexity)]
#![allow(clippy::needless_range_loop)]
#![allow(dead_code)]

use std::{
    cmp::Reverse,
    collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, VecDeque},
};

mod rnd {
    static mut S: usize = 0;
    static MAX: usize = 1e9 as usize;

    #[inline]
    pub fn init(seed: usize) {
        unsafe {
            if seed == 0 {
                let t = std::time::SystemTime::now()
                    .duration_since(std::time::UNIX_EPOCH)
                    .unwrap()
                    .as_secs() as usize;
                S = t
            } else {
                S = seed;
            }
        }
    }
    #[inline]
    pub fn gen() -> usize {
        unsafe {
            if S == 0 {
                init(0);
            }
            S ^= S << 7;
            S ^= S >> 9;
            S
        }
    }
    #[inline]
    pub fn gen_range(a: usize, b: usize) -> usize {
        gen() % (b - a) + a
    }
    #[inline]
    pub fn gen_bool() -> bool {
        gen() & 1 == 1
    }
    #[inline]
    pub fn gen_range_isize(a: usize) -> isize {
        let mut x = (gen() % a) as isize;
        if gen_bool() {
            x *= -1;
        }
        x
    }
    #[inline]
    pub fn gen_range_neg_wrapping(a: usize) -> usize {
        let mut x = gen() % a;
        if gen_bool() {
            x = x.wrapping_neg();
        }
        x
    }
    #[inline]
    pub fn gen_float() -> f64 {
        ((gen() % MAX) as f64) / MAX as f64
    }
}

#[derive(Debug, Clone)]
struct TimeKeeper {
    start_time: std::time::Instant,
    time_threshold: f64,
}

impl TimeKeeper {
    fn new(time_threshold: f64) -> Self {
        TimeKeeper {
            start_time: std::time::Instant::now(),
            time_threshold,
        }
    }
    #[inline]
    fn isTimeOver(&self) -> bool {
        let elapsed_time = self.start_time.elapsed().as_nanos() as f64 * 1e-9;
        #[cfg(feature = "local")]
        {
            elapsed_time * 1.5 >= self.time_threshold
        }
        #[cfg(not(feature = "local"))]
        {
            elapsed_time >= self.time_threshold
        }
    }
    #[inline]
    fn get_time(&self) -> f64 {
        let elapsed_time = self.start_time.elapsed().as_nanos() as f64 * 1e-9;
        #[cfg(feature = "local")]
        {
            elapsed_time * 1.5
        }
        #[cfg(not(feature = "local"))]
        {
            elapsed_time
        }
    }
}

const DIJ4: [(usize, usize); 4] = [(!0, 0), (0, !0), (1, 0), (0, 1)];

#[derive(Debug, Clone)]
struct State {
    N: usize,
    A: Vec<Vec<char>>,
    B: Vec<Vec<char>>,
    b: usize,
    cost: usize,
    building_num: usize,
    bomb_store_num: usize,
    bomb_idx: usize,
    building_destruct_cnt: usize,
    bomb_store_destruct_cnt: usize,
    explosion_positions: Vec<(usize, usize)>,
    actions: Vec<(usize, usize)>,
}

impl State {
    fn new(N: usize) -> Self {
        input! {
            A: [chars; N]
        }
        let mut building_num = 0;
        let mut bomb_store_num = 0;
        for i in 0..N {
            for j in 0..N {
                if A[i][j] == '#' {
                    building_num += 1;
                } else if A[i][j] == '@' {
                    bomb_store_num += 1;
                }
            }
        }
        State {
            N,
            A: A.clone(),
            B: A,
            b: 0,
            cost: 0,
            building_num,
            bomb_store_num,
            bomb_idx: 0,
            building_destruct_cnt: 0,
            bomb_store_destruct_cnt: 0,
            explosion_positions: vec![],
            actions: vec![],
        }
    }
    fn destruct_A(&mut self, y: usize, x: usize, bomb: &Bomb) {
        for (a, b) in bomb.AB.iter() {
            let ny = y as isize + a;
            let nx = x as isize + b;
            if ny < 0 || self.N as isize <= ny || nx < 0 || self.N as isize <= nx {
                continue;
            }
            let ny = ny as usize;
            let nx = nx as usize;
            self.A[ny][nx] = '.';
        }
    }
    fn destruct_B(&mut self, y: usize, x: usize, bomb: &Bomb) {
        for (a, b) in bomb.AB.iter() {
            let ny = y as isize + a;
            let nx = x as isize + b;
            if ny < 0 || self.N as isize <= ny || nx < 0 || self.N as isize <= nx {
                continue;
            }
            let ny = ny as usize;
            let nx = nx as usize;
            if self.B[ny][nx] == '#' {
                self.B[ny][nx] = '.';
                self.building_destruct_cnt += 1;
            } else if self.B[ny][nx] == '@' {
                self.B[ny][nx] = '.';
                self.bomb_store_destruct_cnt += 1;
            }
        }
    }
    fn is_destructed(&self) -> bool {
        self.building_destruct_cnt == self.building_num
            && self.bomb_store_destruct_cnt == self.bomb_store_num
    }
    fn get_explosion_positions(&mut self, bomb_idx: usize, bomb: &Bomb) {
        self.bomb_idx = bomb_idx + 1;
        while !self.is_destructed() {
            let mut candidate = vec![];
            for y in 0..self.N {
                for x in 0..self.N {
                    let mut destruct_cnt = 0;
                    for (a, b) in bomb.AB.iter() {
                        let ny = y as isize + a;
                        let nx = x as isize + b;
                        if ny < 0 || self.N as isize <= ny || nx < 0 || self.N as isize <= nx {
                            continue;
                        }
                        let ny = ny as usize;
                        let nx = nx as usize;
                        if self.B[ny][nx] != '.' {
                            destruct_cnt += 1;
                        }
                    }
                    candidate.push((destruct_cnt, y, x));
                }
            }
            candidate.sort_by_key(|x| Reverse(x.0));
            let (_, y, x) = candidate[0];
            self.explosion_positions.push((y, x));
            self.destruct_B(y, x, bomb);
        }
    }
    fn action(&mut self, bomb: &Bomb) {
        let mut store_positions = vec![];
        for y in 0..self.N {
            for x in 0..self.N {
                if self.A[y][x] == '@' {
                    store_positions.push((y, x));
                }
            }
        }
        let idx = self.bfs(0, 0, &store_positions);
        let (mut py, mut px) = store_positions[idx];
        // eprintln!("{}", self.cost);

        // buy
        for _ in 0..self.explosion_positions.len() {
            self.actions.push((2, self.bomb_idx));
            self.b += 1;
            self.cost += bomb.C;
        }
        // eprintln!("{}", self.cost);

        while !self.explosion_positions.is_empty() {
            let goal = self.explosion_positions.clone();
            let idx = self.bfs(py, px, &goal);
            // eprintln!("{}", self.cost);
            let pos = goal[idx];
            py = pos.0;
            px = pos.1;
            self.explosion_positions.remove(idx);
            // explosion
            self.actions.push((3, self.bomb_idx));
            self.destruct_A(py, px, bomb);
            self.b -= 1;
        }
    }
    fn bfs(&mut self, sy: usize, sx: usize, goal: &[(usize, usize)]) -> usize {
        let INF = 1_usize << 60;
        let mut dist = vec![vec![INF; self.N]; self.N];
        let mut Q = BinaryHeap::new();
        dist[sy][sx] = 0;
        Q.push((Reverse(dist[sy][sx]), sy, sx));
        while let Some((Reverse(d), py, px)) = Q.pop() {
            if dist[py][px] != d {
                continue;
            }
            for &(dy, dx) in &DIJ4 {
                let ny = py.wrapping_add(dy);
                let nx = px.wrapping_add(dx);
                if ny >= self.N || nx >= self.N {
                    continue;
                }
                let mut c = (self.b + 1) * (self.b + 1);
                if self.A[ny][nx] != '.' {
                    c *= 2;
                }
                if dist[py][px] + c < dist[ny][nx] {
                    dist[ny][nx] = dist[py][px] + c;
                    Q.push((Reverse(dist[ny][nx]), ny, nx))
                }
            }
        }
        let mut candidate = vec![];
        for &(gy, gx) in goal.iter() {
            candidate.push((dist[gy][gx], gy, gx));
        }
        candidate.sort();

        let mut mp: HashMap<(usize, usize), char> = HashMap::new();
        mp.insert((1, 0), 'U');
        mp.insert((!0, 0), 'D');
        mp.insert((0, 1), 'L');
        mp.insert((0, !0), 'R');

        let (_, mut gy, mut gx) = candidate[0];
        let mut goal_idx = 0;
        for (i, &(y, x)) in goal.iter().enumerate() {
            if gy == y && gx == x {
                goal_idx = i;
                break;
            }
        }
        let mut a = vec![];
        while sy != gy || sx != gx {
            for &(dy, dx) in &DIJ4 {
                let ny = gy.wrapping_add(dy);
                let nx = gx.wrapping_add(dx);
                if ny >= self.N || nx >= self.N {
                    continue;
                }
                let mut c = (self.b + 1) * (self.b + 1);
                if self.A[gy][gx] != '.' {
                    c *= 2;
                }
                if dist[ny][nx] + c == dist[gy][gx] {
                    self.cost += c;
                    a.push((1, mp[&(dy, dx)] as usize));
                    gy = ny;
                    gx = nx;
                    break;
                }
            }
        }
        a.reverse();
        self.actions.extend(a);
        goal_idx
    }
    fn score(&self) -> usize {
        max!(10, (1e12 as usize) / (1e4 as usize + self.cost))
    }
    fn output(&self) {
        eprintln!("{}", self.cost);
        eprintln!("{}", self.score());
        println!("{}", self.actions.len());
        for (t, x) in self.actions.iter() {
            if *t == 1 {
                let dir = (*x as u8) as char;
                println!("{} {}", t, dir);
            } else {
                println!("{} {}", t, x);
            }
        }
    }
}

#[derive(Debug, Clone)]
struct Bomb {
    C: usize,
    L: usize,
    AB: Vec<(isize, isize)>,
}

impl Bomb {
    fn new(C: usize, L: usize) -> Self {
        input! {
            AB: [(isize, isize); L]
        }
        Bomb { C, L, AB }
    }
}

#[derive(Default)]
struct Solver {}
impl Solver {
    fn solve(&mut self) {
        input! {
            N: usize,
            M: usize,
        }
        let state = State::new(N);
        let mut best_state = state.clone();

        let mut bombs = vec![];
        for _ in 0..M {
            input! {
                C: usize,
                L: usize
            }
            let bomb = Bomb::new(C, L);
            bombs.push(bomb);
        }
        let mut best_score = 0;
        for i in 0..M {
            let mut now_state = state.clone();
            now_state.get_explosion_positions(i, &bombs[i]);
            now_state.action(&bombs[i]);
            let now_score = now_state.score();
            if best_score < now_score {
                best_score = now_score;
                best_state = now_state;
            }
        }
        best_state.output();
    }
}

#[macro_export]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $( $y: expr ),+) => {
        std::cmp::max($x, max!($( $y ),+))
    }
}
#[macro_export]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $( $y: expr ),+) => {
        std::cmp::min($x, min!($( $y ),+))
    }
}

fn main() {
    std::thread::Builder::new()
        .stack_size(128 * 1024 * 1024)
        .spawn(|| Solver::default().solve())
        .unwrap()
        .join()
        .unwrap();
}

fn join_to_string<T: std::string::ToString>(v: &[T], sep: &str) -> String {
    v.iter()
        .fold("".to_string(), |s, x| s + x.to_string().as_str() + sep)
}

#[macro_export]
macro_rules! input {
    () => {};
    (mut $var:ident: $t:tt, $($rest:tt)*) => {
        let mut $var = __input_inner!($t);
        input!($($rest)*)
    };
    ($var:ident: $t:tt, $($rest:tt)*) => {
        let $var = __input_inner!($t);
        input!($($rest)*)
    };
    (mut $var:ident: $t:tt) => {
        let mut $var = __input_inner!($t);
    };
    ($var:ident: $t:tt) => {
        let $var = __input_inner!($t);
    };
}

#[macro_export]
macro_rules! __input_inner {
    (($($t:tt),*)) => {
        ($(__input_inner!($t)),*)
    };
    ([$t:tt; $n:expr]) => {
        (0..$n).map(|_| __input_inner!($t)).collect::<Vec<_>>()
    };
    ([$t:tt]) => {{
        let n = __input_inner!(usize);
        (0..n).map(|_| __input_inner!($t)).collect::<Vec<_>>()
    }};
    (chars) => {
        __input_inner!(String).chars().collect::<Vec<_>>()
    };
    (bytes) => {
        __input_inner!(String).into_bytes()
    };
    (usize1) => {
        __input_inner!(usize) - 1
    };
    ($t:ty) => {
        $crate::read::<$t>()
    };
}

#[macro_export]
macro_rules! println {
    () => {
        $crate::write(|w| {
            use std::io::Write;
            std::writeln!(w).unwrap()
        })
    };
    ($($arg:tt)*) => {
        $crate::write(|w| {
            use std::io::Write;
            std::writeln!(w, $($arg)*).unwrap()
        })
    };
}

#[macro_export]
macro_rules! print {
    ($($arg:tt)*) => {
        $crate::write(|w| {
            use std::io::Write;
            std::write!(w, $($arg)*).unwrap()
        })
    };
}

#[macro_export]
macro_rules! flush {
    () => {
        $crate::write(|w| {
            use std::io::Write;
            w.flush().unwrap()
        })
    };
}

pub fn read<T>() -> T
where
    T: std::str::FromStr,
    T::Err: std::fmt::Debug,
{
    use std::cell::RefCell;
    use std::io::*;

    thread_local! {
        pub static STDIN: RefCell<StdinLock<'static>> = RefCell::new(stdin().lock());
    }

    STDIN.with(|r| {
        let mut r = r.borrow_mut();
        let mut s = vec![];
        loop {
            let buf = r.fill_buf().unwrap();
            if buf.is_empty() {
                break;
            }
            if let Some(i) = buf.iter().position(u8::is_ascii_whitespace) {
                s.extend_from_slice(&buf[..i]);
                r.consume(i + 1);
                if !s.is_empty() {
                    break;
                }
            } else {
                s.extend_from_slice(buf);
                let n = buf.len();
                r.consume(n);
            }
        }
        std::str::from_utf8(&s).unwrap().parse().unwrap()
    })
}

pub fn write<F>(f: F)
where
    F: FnOnce(&mut std::io::BufWriter<std::io::StdoutLock>),
{
    use std::cell::RefCell;
    use std::io::*;

    thread_local! {
        pub static STDOUT: RefCell<BufWriter<StdoutLock<'static>>> =
            RefCell::new(BufWriter::new(stdout().lock()));
    }

    STDOUT.with(|w| f(&mut w.borrow_mut()))
}
0