結果
| 問題 | No.5017 Tool-assisted Shooting |
| ユーザー |
 terry_u16
|
| 提出日時 | 2023-07-16 23:09:32 |
| 言語 | Rust (1.77.0 + proconio) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 10,926 bytes |
| コンパイル時間 | 1,245 ms |
| コンパイル使用メモリ | 161,316 KB |
| 実行使用メモリ | 63,748 KB |
| スコア | 0 |
| 最終ジャッジ日時 | 2023-07-16 23:12:03 |
| 合計ジャッジ時間 | 8,633 ms |
|
ジャッジサーバーID （参考情報） |
judge16 / judge15 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | TLE | - |
| testcase_02 | TLE | - |
| testcase_03 | TLE | - |
| testcase_04 | TLE | - |
| testcase_05 | TLE | - |
| testcase_06 | TLE | - |
| testcase_07 | TLE | - |
| testcase_08 | TLE | - |
| testcase_09 | TLE | - |
| testcase_10 | TLE | - |
| testcase_11 | TLE | - |
| testcase_12 | TLE | - |
| testcase_13 | TLE | - |
| testcase_14 | TLE | - |
| testcase_15 | TLE | - |
| testcase_16 | TLE | - |
| testcase_17 | TLE | - |
| testcase_18 | TLE | - |
| testcase_19 | TLE | - |
| testcase_20 | TLE | - |
| testcase_21 | TLE | - |
| testcase_22 | TLE | - |
| testcase_23 | TLE | - |
| testcase_24 | TLE | - |
| testcase_25 | TLE | - |
| testcase_26 | TLE | - |
| testcase_27 | TLE | - |
| testcase_28 | TLE | - |
| testcase_29 | TLE | - |
| testcase_30 | TLE | - |
| testcase_31 | TLE | - |
| testcase_32 | TLE | - |
| testcase_33 | TLE | - |
| testcase_34 | TLE | - |
| testcase_35 | TLE | - |
| testcase_36 | TLE | - |
| testcase_37 | TLE | - |
| testcase_38 | TLE | - |
| testcase_39 | TLE | - |
| testcase_40 | TLE | - |
| testcase_41 | TLE | - |
| testcase_42 | TLE | - |
| testcase_43 | TLE | - |
| testcase_44 | TLE | - |
| testcase_45 | TLE | - |
| testcase_46 | TLE | - |
| testcase_47 | TLE | - |
| testcase_48 | TLE | - |
| testcase_49 | TLE | - |
| testcase_50 | TLE | - |
| testcase_51 | TLE | - |
| testcase_52 | TLE | - |
| testcase_53 | TLE | - |
| testcase_54 | -- | - |
| testcase_55 | -- | - |
| testcase_56 | -- | - |
| testcase_57 | -- | - |
| testcase_58 | -- | - |
| testcase_59 | -- | - |
| testcase_60 | -- | - |
| testcase_61 | -- | - |
| testcase_62 | -- | - |
| testcase_63 | -- | - |
| testcase_64 | -- | - |
| testcase_65 | -- | - |
| testcase_66 | -- | - |
| testcase_67 | -- | - |
| testcase_68 | -- | - |
| testcase_69 | -- | - |
| testcase_70 | -- | - |
| testcase_71 | -- | - |
| testcase_72 | -- | - |
| testcase_73 | -- | - |
| testcase_74 | -- | - |
| testcase_75 | -- | - |
| testcase_76 | -- | - |
| testcase_77 | -- | - |
| testcase_78 | -- | - |
| testcase_79 | -- | - |
| testcase_80 | -- | - |
| testcase_81 | -- | - |
| testcase_82 | -- | - |
| testcase_83 | -- | - |
| testcase_84 | -- | - |
| testcase_85 | -- | - |
| testcase_86 | -- | - |
| testcase_87 | -- | - |
| testcase_88 | -- | - |
| testcase_89 | -- | - |
| testcase_90 | -- | - |
| testcase_91 | -- | - |
| testcase_92 | -- | - |
| testcase_93 | -- | - |
| testcase_94 | -- | - |
| testcase_95 | -- | - |
| testcase_96 | -- | - |
| testcase_97 | -- | - |
| testcase_98 | -- | - |
| testcase_99 | -- | - |
ソースコード
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 = 30;
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 = 23;
const TURN_STRIDE: usize = 4;
#[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.7;
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; BEAM_WIDTH])];
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::with_capacity(BEAM_WIDTH * 3); WIDTH];
for &i in current_states.iter().flatten() {
all_states[i].0.clean_up(&enemy_collection);
for &dir in &[L, C, R] {
let (state, directions) = &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 mut directions = directions.clone();
if iter < TURN_STRIDE {
directions[iter] = dir;
}
next_states[next_col].push(all_states.len());
all_states.push((state, directions));
}
}
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; BEAM_WIDTH];
for (state, dir) in current_states.iter().flatten().map(|&i| &all_states[i]) {
if best_score.change_max(state.score) {
best_dir = dir.clone();
}
}
write_direction(best_dir[0]);
state.clean_up(&enemy_collection);
state.progress_turn(&enemy_collection, best_dir[0]);
turn += 1;
for i in 1..TURN_STRIDE {
if let Some(enemies) = read_spawns() {
enemy_collection.spawn(&enemies, turn);
write_direction(best_dir[i]);
state.clean_up(&enemy_collection);
state.progress_turn(&enemy_collection, best_dir[i]);
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();
}