結果

問題 No.5017 Tool-assisted Shooting
ユーザー tipstar0125tipstar0125
提出日時 2023-07-16 16:39:47
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 34 ms / 2,000 ms
コード長 8,460 bytes
コンパイル時間 2,251 ms
コンパイル使用メモリ 162,152 KB
実行使用メモリ 24,408 KB
スコア 2,501
平均クエリ数 80.54
最終ジャッジ日時 2023-07-16 16:40:06
合計ジャッジ時間 8,571 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
23,388 KB
testcase_01 AC 25 ms
24,048 KB
testcase_02 AC 29 ms
24,348 KB
testcase_03 AC 25 ms
23,664 KB
testcase_04 AC 26 ms
24,060 KB
testcase_05 AC 27 ms
24,348 KB
testcase_06 AC 25 ms
23,652 KB
testcase_07 AC 28 ms
23,856 KB
testcase_08 AC 26 ms
24,048 KB
testcase_09 AC 26 ms
24,384 KB
testcase_10 AC 26 ms
24,048 KB
testcase_11 AC 25 ms
24,348 KB
testcase_12 AC 25 ms
24,336 KB
testcase_13 AC 25 ms
23,544 KB
testcase_14 AC 25 ms
24,408 KB
testcase_15 AC 27 ms
23,400 KB
testcase_16 AC 29 ms
23,556 KB
testcase_17 AC 26 ms
24,336 KB
testcase_18 AC 25 ms
23,376 KB
testcase_19 AC 25 ms
24,336 KB
testcase_20 AC 30 ms
24,324 KB
testcase_21 AC 27 ms
23,424 KB
testcase_22 AC 27 ms
23,388 KB
testcase_23 AC 25 ms
24,360 KB
testcase_24 AC 26 ms
23,424 KB
testcase_25 AC 27 ms
23,436 KB
testcase_26 AC 26 ms
24,036 KB
testcase_27 AC 26 ms
24,336 KB
testcase_28 AC 26 ms
24,036 KB
testcase_29 AC 26 ms
23,412 KB
testcase_30 AC 25 ms
24,276 KB
testcase_31 AC 26 ms
23,544 KB
testcase_32 AC 25 ms
23,388 KB
testcase_33 AC 26 ms
23,436 KB
testcase_34 AC 26 ms
24,060 KB
testcase_35 AC 27 ms
24,348 KB
testcase_36 AC 26 ms
23,844 KB
testcase_37 AC 25 ms
23,832 KB
testcase_38 AC 26 ms
23,436 KB
testcase_39 AC 29 ms
23,388 KB
testcase_40 AC 25 ms
23,676 KB
testcase_41 AC 26 ms
23,640 KB
testcase_42 AC 26 ms
24,336 KB
testcase_43 AC 26 ms
24,036 KB
testcase_44 AC 25 ms
23,700 KB
testcase_45 AC 26 ms
23,628 KB
testcase_46 AC 26 ms
24,024 KB
testcase_47 AC 25 ms
24,360 KB
testcase_48 AC 25 ms
23,388 KB
testcase_49 AC 26 ms
24,372 KB
testcase_50 AC 26 ms
24,024 KB
testcase_51 AC 26 ms
23,652 KB
testcase_52 AC 26 ms
23,664 KB
testcase_53 AC 28 ms
23,664 KB
testcase_54 AC 26 ms
24,396 KB
testcase_55 AC 28 ms
23,664 KB
testcase_56 AC 27 ms
23,400 KB
testcase_57 AC 31 ms
24,360 KB
testcase_58 AC 29 ms
24,012 KB
testcase_59 AC 26 ms
23,424 KB
testcase_60 AC 25 ms
24,348 KB
testcase_61 AC 34 ms
24,264 KB
testcase_62 AC 26 ms
23,544 KB
testcase_63 AC 26 ms
24,024 KB
testcase_64 AC 26 ms
23,856 KB
testcase_65 AC 26 ms
24,396 KB
testcase_66 AC 26 ms
24,276 KB
testcase_67 AC 27 ms
23,664 KB
testcase_68 AC 26 ms
23,544 KB
testcase_69 AC 29 ms
23,640 KB
testcase_70 AC 29 ms
23,424 KB
testcase_71 AC 26 ms
23,436 KB
testcase_72 AC 29 ms
24,348 KB
testcase_73 AC 25 ms
23,532 KB
testcase_74 AC 25 ms
23,676 KB
testcase_75 AC 26 ms
23,640 KB
testcase_76 AC 25 ms
24,324 KB
testcase_77 AC 25 ms
23,664 KB
testcase_78 AC 25 ms
24,048 KB
testcase_79 AC 29 ms
23,556 KB
testcase_80 AC 26 ms
24,396 KB
testcase_81 AC 25 ms
23,436 KB
testcase_82 AC 26 ms
24,012 KB
testcase_83 AC 25 ms
24,048 KB
testcase_84 AC 26 ms
23,436 KB
testcase_85 AC 26 ms
23,544 KB
testcase_86 AC 27 ms
24,396 KB
testcase_87 AC 26 ms
24,348 KB
testcase_88 AC 24 ms
23,640 KB
testcase_89 AC 25 ms
23,400 KB
testcase_90 AC 29 ms
24,336 KB
testcase_91 AC 26 ms
23,832 KB
testcase_92 AC 27 ms
23,400 KB
testcase_93 AC 26 ms
23,544 KB
testcase_94 AC 29 ms
23,388 KB
testcase_95 AC 26 ms
23,424 KB
testcase_96 AC 25 ms
23,856 KB
testcase_97 AC 29 ms
24,024 KB
testcase_98 AC 28 ms
23,544 KB
testcase_99 AC 26 ms
24,360 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, 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 H: usize = 60;
const W: usize = 25;
const TURN: usize = 1000;

#[derive(Debug, Clone)]
struct State {
    pos: usize,
    S: usize,
    enemy: [[(isize, usize); W]; H],
    turn: usize,
}

impl State {
    fn new() -> Self {
        State {
            pos: 12,
            S: 0,
            enemy: [[(0, 0); W]; H],
            turn: 0,
        }
    }
    fn update_enemy(&mut self, HPX: Vec<(usize, usize, usize)>) {
        for i in 1..H {
            self.enemy[i - 1] = self.enemy[i];
        }
        let mut new_enemy = [(0, 0); W];
        for (h, p, x) in HPX {
            new_enemy[x] = (h as isize, p);
        }
        self.enemy[H - 1] = new_enemy;
    }
    fn decide_target(&self) -> Vec<(usize, Reverse<usize>, usize)> {
        let mut targets = vec![];
        for i in 1..H {
            for j in 0..W {
                if self.enemy[i][j] == (0, 0) {
                    continue;
                }
                let (h, p) = self.enemy[i][j];
                if self.pos < j {
                    let right = j - self.pos;
                    let left = self.pos + W - j;
                    if left <= right {
                        let dx = left;
                        let dy = i + 1;
                        if dy as isize - dx as isize - h <= 0 {
                            continue;
                        }
                        targets.push((p, Reverse(left), 1));
                    } else {
                        let dx = right;
                        let dy = i + 1;
                        if dy as isize - dx as isize - h <= 0 {
                            continue;
                        }
                        targets.push((p, Reverse(right), 2));
                    }
                } else if self.pos > j {
                    let left = self.pos - j;
                    let right = j + W - self.pos;
                    if left <= right {
                        let dx = left;
                        let dy = i + 1;
                        if dy as isize - dx as isize - h <= 0 {
                            continue;
                        }
                        targets.push((p, Reverse(left), 1));
                    } else {
                        let dx = right;
                        let dy = i + 1;
                        if dy as isize - dx as isize - h <= 0 {
                            continue;
                        }
                        targets.push((p, Reverse(right), 2));
                    }
                } else {
                    let dy = i + 1;
                    if dy as isize - h <= 0 {
                        continue;
                    }
                    targets.push((p, Reverse(0), 0));
                }
            }
        }
        targets.sort();
        targets.reverse();
        targets
    }
    fn update_field(&mut self, dir: usize) {
        if dir == 1 {
            self.pos = (W + self.pos - 1) % W;
        } else if dir == 2 {
            self.pos = (self.pos + 1) % W;
        }
        for i in 1..H {
            if self.enemy[i][self.pos] != (0, 0) {
                let level = (1 + self.S / 100) as isize;
                let (h, p) = self.enemy[i][self.pos];
                if h - level <= 0 {
                    self.S += p;
                    self.enemy[i][self.pos] = (0, 0);
                } else {
                    self.enemy[i][self.pos] = (h - level, p);
                }
                break;
            }
        }
    }
    fn is_done(&self) -> bool {
        self.turn == TURN
    }
    fn output(&self, dir: usize) {
        if dir == 0 {
            println!("S");
        } else if dir == 1 {
            println!("L");
        } else {
            println!("R");
        }
    }
}

#[derive(Default)]
struct Solver {}
impl Solver {
    fn solve(&mut self) {
        let mut state = State::new();

        while !state.is_done() {
            let N: isize = read();
            if N == -1 {
                return;
            }

            let mut HPX = vec![];
            for _ in 0..N {
                let v: Vec<usize> = read_vec();
                let h = v[0];
                let p = v[1];
                let x = v[2];
                HPX.push((h, p, x));
            }
            state.update_enemy(HPX);
            let targets = state.decide_target();
            let mut dir = 0;
            for (_, Reverse(dx), d) in targets {
                if d == 0 {
                    break;
                } else if d == 1 {
                    let next = (W + state.pos - dx) % W;
                    if state.enemy[0][next] == (0, 0) {
                        dir = 1;
                        break;
                    }
                } else {
                    let next = (state.pos + dx) % W;
                    if state.enemy[0][next] == (0, 0) {
                        dir = 2;
                        break;
                    }
                }
            }
            state.update_field(dir);
            state.turn += 1;
            state.output(dir);
        }
    }
}

#[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 read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
0