#892398 (Rust) No.5017 Tool-assisted Shooting

提出ソース

結果

問題	No.5017 Tool-assisted Shooting
ユーザー	👑 terry_u16
提出日時	2023-07-16 18:41:13
言語	Rust (1.77.0)
結果	AC
実行時間	1,702 ms / 2,000 ms
コード長	10,475 bytes
コンパイル時間	1,876 ms
コンパイル使用メモリ	162,816 KB
実行使用メモリ	28,568 KB
スコア	4,640,209
平均クエリ数	1000.00
最終ジャッジ日時	2023-07-16 18:43:56
合計ジャッジ時間	159,409 ms
ジャッジサーバーID （参考情報）	judge13 / judge14
	純コード判定しない問題か言語

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,515 ms 24,392 KB
testcase_01	AC	1,482 ms 24,820 KB
testcase_02	AC	1,481 ms 25,776 KB
testcase_03	AC	1,487 ms 25,064 KB
testcase_04	AC	1,496 ms 24,812 KB
testcase_05	AC	1,476 ms 25,524 KB
testcase_06	AC	1,465 ms 25,100 KB
testcase_07	AC	1,560 ms 26,096 KB
testcase_08	AC	1,460 ms 24,436 KB
testcase_09	AC	1,481 ms 24,560 KB
testcase_10	AC	1,564 ms 25,564 KB
testcase_11	AC	1,459 ms 25,432 KB
testcase_12	AC	1,486 ms 25,060 KB
testcase_13	AC	1,484 ms 25,428 KB
testcase_14	AC	1,490 ms 25,084 KB
testcase_15	AC	1,496 ms 25,280 KB
testcase_16	AC	1,470 ms 24,588 KB
testcase_17	AC	1,492 ms 24,956 KB
testcase_18	AC	1,488 ms 25,652 KB
testcase_19	AC	1,504 ms 25,196 KB
testcase_20	AC	1,501 ms 25,008 KB
testcase_21	AC	1,497 ms 25,152 KB
testcase_22	AC	1,503 ms 24,596 KB
testcase_23	AC	1,480 ms 26,196 KB
testcase_24	AC	1,490 ms 25,448 KB
testcase_25	AC	1,490 ms 24,224 KB
testcase_26	AC	1,533 ms 24,856 KB
testcase_27	AC	1,504 ms 25,000 KB
testcase_28	AC	1,498 ms 24,616 KB
testcase_29	AC	1,473 ms 24,752 KB
testcase_30	AC	1,459 ms 25,140 KB
testcase_31	AC	1,465 ms 25,384 KB
testcase_32	AC	1,507 ms 25,220 KB
testcase_33	AC	1,521 ms 24,396 KB
testcase_34	AC	1,487 ms 24,904 KB
testcase_35	AC	1,491 ms 24,584 KB
testcase_36	AC	1,476 ms 24,312 KB
testcase_37	AC	1,484 ms 24,860 KB
testcase_38	AC	1,482 ms 24,904 KB
testcase_39	AC	1,496 ms 25,868 KB
testcase_40	AC	1,520 ms 25,716 KB
testcase_41	AC	1,463 ms 24,208 KB
testcase_42	AC	1,485 ms 24,680 KB
testcase_43	AC	1,489 ms 25,048 KB
testcase_44	AC	1,489 ms 25,108 KB
testcase_45	AC	1,475 ms 25,636 KB
testcase_46	AC	1,496 ms 24,996 KB
testcase_47	AC	1,490 ms 26,016 KB
testcase_48	AC	1,493 ms 24,376 KB
testcase_49	AC	1,519 ms 24,780 KB
testcase_50	AC	1,491 ms 25,452 KB
testcase_51	AC	1,519 ms 25,200 KB
testcase_52	AC	1,484 ms 25,796 KB
testcase_53	AC	1,498 ms 25,284 KB
testcase_54	AC	1,493 ms 25,140 KB
testcase_55	AC	1,481 ms 24,764 KB
testcase_56	AC	1,507 ms 25,868 KB
testcase_57	AC	1,562 ms 25,676 KB
testcase_58	AC	1,490 ms 24,380 KB
testcase_59	AC	1,500 ms 24,788 KB
testcase_60	AC	1,482 ms 25,348 KB
testcase_61	AC	1,476 ms 24,204 KB
testcase_62	AC	1,529 ms 25,000 KB
testcase_63	AC	1,506 ms 24,724 KB
testcase_64	AC	1,493 ms 25,088 KB
testcase_65	AC	1,501 ms 24,768 KB
testcase_66	AC	1,482 ms 24,748 KB
testcase_67	AC	1,482 ms 25,512 KB
testcase_68	AC	1,493 ms 24,956 KB
testcase_69	AC	1,497 ms 24,728 KB
testcase_70	AC	1,501 ms 24,420 KB
testcase_71	AC	1,485 ms 24,388 KB
testcase_72	AC	1,467 ms 24,944 KB
testcase_73	AC	1,487 ms 25,244 KB
testcase_74	AC	1,499 ms 25,064 KB
testcase_75	AC	1,492 ms 24,860 KB
testcase_76	AC	1,494 ms 24,968 KB
testcase_77	AC	1,538 ms 24,724 KB
testcase_78	AC	1,543 ms 25,860 KB
testcase_79	AC	1,486 ms 25,272 KB
testcase_80	AC	1,499 ms 26,312 KB
testcase_81	AC	1,477 ms 24,688 KB
testcase_82	AC	1,443 ms 24,244 KB
testcase_83	AC	1,506 ms 24,840 KB
testcase_84	AC	1,503 ms 25,392 KB
testcase_85	AC	1,494 ms 25,916 KB
testcase_86	AC	1,486 ms 25,252 KB
testcase_87	AC	1,472 ms 25,976 KB
testcase_88	AC	1,529 ms 25,296 KB
testcase_89	AC	1,453 ms 24,860 KB
testcase_90	AC	1,502 ms 25,504 KB
testcase_91	AC	1,463 ms 25,276 KB
testcase_92	AC	1,465 ms 24,604 KB
testcase_93	AC	1,702 ms 28,568 KB
testcase_94	AC	1,461 ms 25,076 KB
testcase_95	AC	1,476 ms 25,988 KB
testcase_96	AC	1,507 ms 24,236 KB
testcase_97	AC	1,471 ms 25,336 KB
testcase_98	AC	1,491 ms 25,444 KB
testcase_99	AC	1,498 ms 25,208 KB

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

ソースコード

raw source code

use std::{io::Write, time::Instant};

macro_rules! get {
      ($t:ty) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.trim().parse::<$t>().unwrap()
          }
      };
      ($($t:ty),*) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              let mut iter = line.split_whitespace();
              (
                  $(iter.next().unwrap().parse::<$t>().unwrap(),)*
              )
          }
      };
      ($t:ty; $n:expr) => {
          (0..$n).map(|_|
              get!($t)
          ).collect::<Vec<_>>()
      };
      ($($t:ty),*; $n:expr) => {
          (0..$n).map(|_|
              get!($($t),*)
          ).collect::<Vec<_>>()
      };
      ($t:ty ;;) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.split_whitespace()
                  .map(|t| t.parse::<$t>().unwrap())
                  .collect::<Vec<_>>()
          }
      };
      ($t:ty ;; $n:expr) => {
          (0..$n).map(|_| get!($t ;;)).collect::<Vec<_>>()
      };
}

pub trait ChangeMinMax {
    fn change_min(&mut self, v: Self) -> bool;
    fn change_max(&mut self, v: Self) -> bool;
}

impl<T: PartialOrd> ChangeMinMax for T {
    fn change_min(&mut self, v: T) -> bool {
        *self > v && {
            *self = v;
            true
        }
    }

    fn change_max(&mut self, v: T) -> bool {
        *self < v && {
            *self = v;
            true
        }
    }
}

const MAX_TURN: usize = 1000;
const DEFAULT_SIMULATION_LEN: usize = 40;
const HEIGHT: usize = 60;
const WIDTH: usize = 25;
const CENTER: usize = 12;
const L: usize = !0;
const C: usize = 0;
const R: usize = 1;
const BEAM_WIDTH: [usize; 8] = [20, 15, 10, 5, 5, 5, 3, 3];
const BEAM_CHUNK: usize = 5;

#[derive(Debug, Clone)]
struct State {
    column: usize,
    power: u32,
    raw_score: u32,
    score: f64,
    turn: usize,
    enemies: EnemyState,
}

impl State {
    fn new() -> Self {
        Self {
            column: CENTER,
            power: 100,
            raw_score: 0,
            turn: 0,
            score: 0.0,
            enemies: EnemyState::new(),
        }
    }

    fn level(&self) -> u32 {
        self.power / 100
    }

    fn move_player(&mut self, direction: usize) {
        self.column = (self.column + direction + WIDTH) % WIDTH;
    }

    fn attack(&mut self, enemy_collection: &EnemyCollection) {
        let level = self.level();

        if self.enemies.has_enemy(enemy_collection, self.column) {
            let (hp, power) = self.enemies.damage(enemy_collection, self.column, level);
            self.raw_score += hp;
            self.power += power;
        }
    }

    fn clean_up(&mut self, enemy_collection: &EnemyCollection) {
        self.enemies.clean_up_enemies(enemy_collection, self.turn);
    }

    fn progress_turn(&mut self, enemy_collection: &EnemyCollection, direction: usize) -> bool {
        let mut alive = true;
        alive &= !self.enemies.crash(enemy_collection, self.column, self.turn);
        self.move_player(direction);
        alive &= !self.enemies.crash(enemy_collection, self.column, self.turn);
        self.attack(enemy_collection);
        self.turn += 1;

        self.update_score(enemy_collection);

        alive
    }

    fn update_score(&mut self, enemy_collection: &EnemyCollection) {
        let mut raw_score_point = self.raw_score as f64;
        let mut power_point = self.power as f64;
        let cols = [
            ((self.column + WIDTH - L) % WIDTH, 0.5),
            (self.column, 1.0),
            ((self.column + R) % WIDTH, 0.5),
        ];

        for &(col, coef) in &cols {
            if let Some(enemy) = self.enemies.get(enemy_collection, col) {
                let ratio = self.enemies.damages[col] as f64 / enemy.hp as f64;
                let coef = coef * ratio * ratio * 0.5;
                raw_score_point += enemy.hp as f64 * coef;
                power_point += enemy.power as f64 * coef;
            }
        }

        let raw_score_coef = (self.turn * self.turn) as f64;
        let power_point_coef = ((MAX_TURN - self.turn) * MAX_TURN) as f64;
        self.score = raw_score_point * raw_score_coef + power_point * power_point_coef;
    }
}

#[derive(Debug, Clone, Copy, Default)]
struct Enemy {
    hp: u32,
    power: u32,
    spawn_turn: usize,
}

impl Enemy {
    fn new(hp: u32, power: u32, spawn_turn: usize) -> Self {
        Self {
            hp,
            power,
            spawn_turn,
        }
    }

    fn is_out_of_range(&self, turn: usize) -> bool {
        self.spawn_turn + HEIGHT <= turn
    }

    fn is_bottom(&self, turn: usize) -> bool {
        self.spawn_turn + HEIGHT - 1 == turn
    }
}

#[derive(Debug, Clone)]
struct EnemyState {
    indices: [usize; WIDTH],
    damages: [u32; WIDTH],
}

impl EnemyState {
    fn new() -> Self {
        Self {
            indices: [0; WIDTH],
            damages: [0; WIDTH],
        }
    }

    fn has_enemy(&self, enemies: &EnemyCollection, column: usize) -> bool {
        self.get(enemies, column).is_some()
    }

    fn get<'a>(&self, enemies: &'a EnemyCollection, column: usize) -> Option<&'a Enemy> {
        enemies.get(column, self.indices[column])
    }

    fn crash(&self, enemies: &EnemyCollection, column: usize, turn: usize) -> bool {
        if let Some(enemy) = enemies.get(column, self.indices[column]) {
            enemy.is_bottom(turn)
        } else {
            false
        }
    }

    fn damage(&mut self, enemies: &EnemyCollection, column: usize, attack: u32) -> (u32, u32) {
        let enemy = enemies.get(column, self.indices[column]).unwrap();
        self.damages[column] += attack;

        if self.damages[column] >= enemy.hp {
            self.damages[column] = 0;
            self.indices[column] += 1;
            (enemy.hp, enemy.power)
        } else {
            (0, 0)
        }
    }

    fn clean_up_enemies(&mut self, enemies: &EnemyCollection, turn: usize) {
        let mut column = 0;
        let mut flag = enemies.clean_flags[turn];

        while flag > 0 {
            let tzcnt = flag.trailing_zeros();
            flag >>= tzcnt;
            column += tzcnt;

            let index = &mut self.indices[column as usize];
            let damage = &mut self.damages[column as usize];

            if let Some(enemy) = enemies.get(column as usize, *index) {
                if enemy.is_out_of_range(turn) {
                    *damage = 0;
                    *index += 1;
                }
            }

            flag >>= 1;
            column += 1;
        }
    }
}

#[derive(Debug, Clone)]
struct EnemyCollection {
    enemies: Vec<Vec<Enemy>>,
    clean_flags: Vec<u32>,
}

impl EnemyCollection {
    fn new() -> Self {
        Self {
            enemies: vec![vec![]; WIDTH],
            clean_flags: vec![0; MAX_TURN],
        }
    }

    fn spawn(&mut self, enemies: &[(u32, u32, usize)], turn: usize) {
        let mut flag = 0;

        for &(hp, power, col) in enemies {
            self.enemies[col].push(Enemy::new(hp, power, turn));
            flag |= 1 << col;
        }

        if turn + HEIGHT < MAX_TURN {
            self.clean_flags[turn + HEIGHT] = flag;
        }
    }

    fn get(&self, column: usize, index: usize) -> Option<&Enemy> {
        self.enemies[column].get(index)
    }
}

fn main() {
    let since = Instant::now();
    let mut state = State::new();
    let mut enemy_collection = EnemyCollection::new();
    let mut turn = 0;

    while let Some(enemies) = read_spawns() {
        enemy_collection.spawn(&enemies, turn);
        let mut all_states = vec![(state.clone(), C)];
        let mut current_states = vec![vec![]; WIDTH];
        current_states[state.column].push(0);
        let simulation_len = DEFAULT_SIMULATION_LEN.min(MAX_TURN - turn);

        for iter in 0..simulation_len {
            let mut next_states = vec![vec![]; WIDTH];
            let beam_width = BEAM_WIDTH[iter / BEAM_CHUNK];

            for &i in current_states.iter().flatten() {
                all_states[i].0.clean_up(&enemy_collection);

                for &dir in &[L, C, R] {
                    let (state, first_dir) = &all_states[i];
                    let mut state = state.clone();
                    let is_alive = state.progress_turn(&enemy_collection, dir);

                    if !is_alive {
                        continue;
                    }

                    let next_col = state.column;
                    let dir = if iter == 0 { dir } else { *first_dir };

                    next_states[next_col].push(all_states.len());
                    all_states.push((state, dir));
                }
            }

            for next in next_states.iter_mut() {
                if next.len() > beam_width {
                    next.select_nth_unstable_by(beam_width, |&i, &j| {
                        all_states[j]
                            .0
                            .score
                            .partial_cmp(&all_states[i].0.score)
                            .unwrap()
                    });
                    next.truncate(beam_width);
                }
            }

            current_states = next_states;
        }

        let mut best_score = std::f64::MIN;
        let mut best_dir = C;

        for (state, dir) in current_states.iter().flatten().map(|&i| &all_states[i]) {
            if best_score.change_max(state.score) {
                best_dir = *dir;
            }
        }

        write_direction(best_dir);
        state.clean_up(&enemy_collection);
        state.progress_turn(&enemy_collection, best_dir);
        turn += 1;

        if turn == MAX_TURN {
            break;
        }
    }

    eprintln!("final score: {}", state.raw_score);
    eprintln!("{:.3}s", (Instant::now() - since).as_secs_f64());
}

fn read_spawns() -> Option<Vec<(u32, u32, usize)>> {
    let n = get!(i32);

    if n < 0 {
        return None;
    }

    let mut enemies = vec![];

    for _ in 0..n {
        enemies.push(get!(u32, u32, usize));
    }

    Some(enemies)
}

fn write_direction(direction: usize) {
    match direction {
        L => println!("L"),
        C => println!("S"),
        R => println!("R"),
        _ => unreachable!(),
    }

    std::io::stdout().flush().unwrap();
}

yukicoder

結果

テストケース

ソースコード