結果
問題 | No.5017 Tool-assisted Shooting |
ユーザー |
![]() |
提出日時 | 2023-07-16 15:40:28 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 68 ms / 2,000 ms |
コード長 | 8,499 bytes |
コンパイル時間 | 1,279 ms |
コンパイル使用メモリ | 164,836 KB |
実行使用メモリ | 24,408 KB |
スコア | 166,624 |
平均クエリ数 | 839.24 |
最終ジャッジ日時 | 2023-07-16 15:40:41 |
合計ジャッジ時間 | 11,423 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 100 |
コンパイルメッセージ
warning: constant `ENEMY_NUM_MAX` is never used --> Main.rs:161:7 | 161 | const ENEMY_NUM_MAX: usize = 25; | ^^^^^^^^^^^^^ | = note: `#[warn(dead_code)]` on by default warning: variant `Left` is never constructed --> Main.rs:166:5 | 165 | enum Command { | ------- variant in this enum 166 | Left, | ^^^^ | = note: `Command` has derived impls for the traits `Debug` and `Clone`, but these are intentionally ignored during dead code analysis warning: 2 warnings emitted
ソースコード
#[allow(unused_imports)]use std::cmp::*;#[allow(unused_imports)]use std::collections::*;#[allow(unused_imports)]use std::io::Write;use std::time::SystemTime;pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);impl<R: std::io::Read, W: std::io::Write> IO<R, W> {pub fn new(r: R, w: W) -> IO<R, W> {IO(r, std::io::BufWriter::new(w))}pub fn write<S: ToString>(&mut self, s: S) {#[allow(unused_imports)]use std::io::Write;self.1.write(s.to_string().as_bytes()).unwrap();}pub fn read<T: std::str::FromStr>(&mut self) -> T {use std::io::Read;let buf = self.0.by_ref().bytes().map(|b| b.unwrap()).skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t').take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t').collect::<Vec<_>>();unsafe { std::str::from_utf8_unchecked(&buf) }.parse().ok().expect("Parse error.")}pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {(0..n).map(|_| self.read()).collect()}pub fn chars(&mut self) -> Vec<char> {self.read::<String>().chars().collect()}}#[macro_export]macro_rules! mat {($($e:expr),*) => { Vec::from(vec![$($e),*]) };($($e:expr,)*) => { Vec::from(vec![$($e),*]) };($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };}pub trait SetMinMax {fn setmin(&mut self, v: Self) -> bool;fn setmax(&mut self, v: Self) -> bool;}impl<T> SetMinMax for TwhereT: PartialOrd,{fn setmin(&mut self, v: T) -> bool {*self > v && {*self = v;true}}fn setmax(&mut self, v: T) -> bool {*self < v && {*self = v;true}}}#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]pub struct Coord {pub x: isize,pub y: isize,}#[allow(dead_code)]impl Coord {pub fn new(p: (isize, isize)) -> Self {Coord { x: p.0, y: p.1 }}pub fn from_usize_pair(p: (usize, usize)) -> Self {Coord {x: p.0 as isize,y: p.1 as isize,}}pub fn in_field(&self) -> bool {(0 <= self.x && self.x < WIDTH as isize) && (0 <= self.y && self.y < HEIGHT as isize)}// ペアへの変換pub fn to_pair(&self) -> (isize, isize) {(self.x, self.y)}pub fn to_usize_pair(&self) -> (usize, usize) {(self.x as usize, self.y as usize)}// マンハッタン距離pub fn distance(&self, that: &Self) -> isize {(self.x - that.x).abs() + (self.y - that.y).abs()}pub fn mk_4dir(&self) -> Vec<Self> {let delta = [(-1, 0), (1, 0), (0, -1), (0, 1)];delta.iter().map(|&p| self.plus(&Coord::new(p))).filter(|&pos| pos.in_field()).collect()}pub fn com_to_delta(com: char) -> Self {match com {'U' => Coord::new((0, -1)),'D' => Coord::new((0, 1)),'L' => Coord::new((-1, 0)),'R' => Coord::new((1, 0)),_ => unreachable!(),}}// 四則演算pub fn plus(&self, that: &Self) -> Self {Coord::new((self.x + that.x, self.y + that.y))}pub fn minus(&self, that: &Self) -> Self {Coord::new((self.x - that.x, self.y - that.y))}pub fn access_matrix<'a, T>(&'a self, mat: &'a Vec<Vec<T>>) -> &'a T {&mat[self.y as usize][self.x as usize]}pub fn set_matrix<T>(&self, mat: &mut Vec<Vec<T>>, e: T) {mat[self.y as usize][self.x as usize] = e;}}// println!("{}") での表示内容impl std::fmt::Display for Coord {fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {write!(f, "({}, {})", self.x, self.y)?;Ok(())}}// println!("{:?}") での表示内容impl std::fmt::Debug for Coord {fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {write!(f, "({}, {})", self.x, self.y)?;Ok(())}}const WIDTH: usize = 25;const HEIGHT: usize = 60;const ENEMY_NUM_MAX: usize = 25;const MAX_TURN: usize = 1_000;#[derive(Clone, Copy, Debug)]enum Command {Left,Right,Stay,}impl Command {fn to_string(&self) -> &str {match self {Command::Left => "L",Command::Right => "R",Command::Stay => "S",}}fn move_num(&self) -> usize {match self {Command::Left => WIDTH - 1,Command::Right => 1,Command::Stay => 0,}}}#[derive(Clone, Copy, Debug)]struct Enemy {hp: usize, // HP (自機レベルが1ターンの与ダメージ。倒すとHP分のスコアが得られる。)power: usize, // パワー (100ごとに自機のレベルが1上がる)x: usize, // x座標score: usize, // 倒したときのスコア}impl Enemy {fn new(hp: usize, power: usize, x: usize) -> Self {Self {hp,power,x,score: hp,}}}#[allow(dead_code)]struct Input {n: usize,enemies: Vec<Enemy>,}impl Input {fn new(n: usize, sc: &mut IO<std::io::StdinLock<'_>, std::io::StdoutLock<'_>>) -> Self {let mut enemies = vec![];for _ in 0..n {let v = (0..3).map(|_| sc.read::<usize>()).collect::<Vec<_>>();let e = Enemy::new(v[0], v[1], v[2]);enemies.push(e);}Self { n, enemies }}}struct State {me: usize, // 自機のx座標exp: usize, // 破壊敵機のパワーの通算。100ごとにレベルアップ。field: Vec<Vec<Option<Enemy>>>,score: usize,}impl State {fn new() -> Self {Self {me: 12,exp: 0,field: mat![None; HEIGHT; WIDTH],score: 0,}}fn get_level(&self) -> usize {1 + self.exp / 100}// inputを反映させる更新// 1. フィールドに存在する全ての敵機が下に1マス移動する。フィールド外に移動した敵機は消滅する。// 2. 一番上の行に新たな敵機が出現する。出現確率は後述のように列ごとに定められている。fn update_by_input(&mut self, input: &Input) {let mut new_row = vec![None; WIDTH];for e in input.enemies.iter() {new_row[e.x] = Some(e.clone());}self.field.remove(0);self.field.push(new_row);}// 3. 自機を左右いずれかに1マス移動、またはその場にとどまる。// 4. 自機と同じ列に存在する敵機の中で自機に一番近い敵機を自動で攻撃する。fn update_by_cmd(&mut self, cmd: &Command) {// 移動self.me = (self.me + cmd.move_num()) % WIDTH;// 射撃let x = self.me;for y in 1..HEIGHT {if let Some(mut enemy) = self.field[y][x] {if enemy.hp <= self.get_level() {self.score += enemy.score;self.exp += enemy.power;self.field[y][x] = None;} else {enemy.hp -= self.get_level();self.field[y][x] = Some(enemy)}break;}}}}fn main() {let system_time = SystemTime::now();let (r, w) = (std::io::stdin(), std::io::stdout());let mut sc = IO::new(r.lock(), w.lock());let mut st = State::new();for _turn in 1..=MAX_TURN {/* input & update */let n: isize = sc.read();if n == -1 {break;}let n = n as usize;let input = Input::new(n, &mut sc);st.update_by_input(&input);/* solve */let mut cmd = Command::Stay;if let Some(enemy) = st.field[1][st.me as usize] {if enemy.hp > st.get_level() {cmd = Command::Right;}}/* output & update */println!("{}", cmd.to_string());st.update_by_cmd(&cmd);}eprintln!("{}ms", system_time.elapsed().unwrap().as_millis());}