結果

問題 No.707 書道
ユーザー nebocconebocco
提出日時 2021-02-24 20:13:08
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 5,571 bytes
コンパイル時間 13,266 ms
コンパイル使用メモリ 384,660 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-24 20:22:55
合計ジャッジ時間 12,800 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 3 ms
6,944 KB
testcase_08 AC 1 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

fn main() {
let mut io = IO::new();
input!{ from io,
h: usize, w: usize,
c: [Chars; h]
}
let mut ans = std::f64::MAX;
for k in 0..w {
let mut cur = 0.;
for i in 0..h {
for j in 0..w {
if c[i][j] == '1' {
cur += ((i as f64 + 1.).powi(2) + (k as f64 - j as f64).powi(2)).sqrt();
}
}
}
if cur < ans { ans = cur; }
let mut cur = 0.;
for i in 0..h {
for j in 0..w {
if c[i][j] == '1' {
cur += (((h - i) as f64).powi(2) + (k as f64 - j as f64).powi(2)).sqrt();
}
}
}
if cur < ans { ans = cur; }
}
for k in 0..h {
let mut cur = 0.;
for i in 0..h {
for j in 0..w {
if c[i][j] == '1' {
cur += ((k as f64 - i as f64).powi(2) + (j as f64 + 1.).powi(2)).sqrt();
}
}
}
if cur < ans { ans = cur; }
let mut cur = 0.;
for i in 0..h {
for j in 0..w {
if c[i][j] == '1' {
cur += ((k as f64 - i as f64).powi(2) + ((w - j) as f64).powi(2)).sqrt();
}
}
}
if cur < ans { ans = cur; }
}
println!("{}", ans);
}
// ------------ io module start ------------
use std::io::{stdout, BufWriter, Read, StdoutLock, Write};
pub struct IO {
iter: std::str::SplitAsciiWhitespace<'static>,
buf: BufWriter<StdoutLock<'static>>,
}
impl IO {
pub fn new() -> Self {
let mut input = String::new();
std::io::stdin().read_to_string(&mut input).unwrap();
let input = Box::leak(input.into_boxed_str());
let out = Box::new(stdout());
IO {
iter: input.split_ascii_whitespace(),
buf: BufWriter::new(Box::leak(out).lock()),
}
}
fn scan_str(&mut self) -> &'static str {
self.iter.next().unwrap()
}
pub fn scan<T: Scan>(&mut self) -> <T as Scan>::Output {
<T as Scan>::scan(self)
}
pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<<T as Scan>::Output> {
(0..n).map(|_| self.scan::<T>()).collect()
}
pub fn print<T: Print>(&mut self, x: T) {
<T as Print>::print(self, x);
}
pub fn println<T: Print>(&mut self, x: T) {
self.print(x);
self.print("\n");
}
pub fn iterln<T: Print, I: Iterator<Item = T>>(&mut self, mut iter: I, delim: &str) {
if let Some(v) = iter.next() {
self.print(v);
for v in iter {
self.print(delim);
self.print(v);
}
}
self.print("\n");
}
pub fn flush(&mut self) {
self.buf.flush().unwrap();
}
}
impl Default for IO {
fn default() -> Self {
Self::new()
}
}
pub trait Scan {
type Output;
fn scan(io: &mut IO) -> Self::Output;
}
macro_rules! impl_scan {
($($t:tt),*) => {
$(
impl Scan for $t {
type Output = Self;
fn scan(s: &mut IO) -> Self::Output {
s.scan_str().parse().unwrap()
}
}
)*
};
}
impl_scan!(i16, i32, i64, isize, u16, u32, u64, usize, String);
pub enum Bytes {}
impl Scan for Bytes {
type Output = &'static [u8];
fn scan(s: &mut IO) -> Self::Output {
s.scan_str().as_bytes()
}
}
pub enum Chars {}
impl Scan for Chars {
type Output = Vec<char>;
fn scan(s: &mut IO) -> Self::Output {
s.scan_str().chars().collect()
}
}
pub enum Usize1 {}
impl Scan for Usize1 {
type Output = usize;
fn scan(s: &mut IO) -> Self::Output {
s.scan::<usize>().wrapping_sub(1)
}
}
impl<T: Scan, U: Scan> Scan for (T, U) {
type Output = (T::Output, U::Output);
fn scan(s: &mut IO) -> Self::Output {
(T::scan(s), U::scan(s))
}
}
impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) {
type Output = (T::Output, U::Output, V::Output);
fn scan(s: &mut IO) -> Self::Output {
(T::scan(s), U::scan(s), V::scan(s))
}
}
impl<T: Scan, U: Scan, V: Scan, W: Scan> Scan for (T, U, V, W) {
type Output = (T::Output, U::Output, V::Output, W::Output);
fn scan(s: &mut IO) -> Self::Output {
(T::scan(s), U::scan(s), V::scan(s), W::scan(s))
}
}
pub trait Print {
fn print(w: &mut IO, x: Self);
}
macro_rules! impl_print_int {
($($t:ty),*) => {
$(
impl Print for $t {
fn print(w: &mut IO, x: Self) {
w.buf.write_all(x.to_string().as_bytes()).unwrap();
}
}
)*
};
}
impl_print_int!(i16, i32, i64, isize, u16, u32, u64, usize);
impl Print for u8 {
fn print(w: &mut IO, x: Self) {
w.buf.write_all(&[x]).unwrap();
}
}
impl Print for &[u8] {
fn print(w: &mut IO, x: Self) {
w.buf.write_all(x).unwrap();
}
}
impl Print for &str {
fn print(w: &mut IO, x: Self) {
w.print(x.as_bytes());
}
}
impl Print for String {
fn print(w: &mut IO, x: Self) {
w.print(x.as_bytes());
}
}
impl<T: Print, U: Print> Print for (T, U) {
fn print(w: &mut IO, (x, y): Self) {
w.print(x);
w.print(" ");
w.print(y);
}
}
impl<T: Print, U: Print, V: Print> Print for (T, U, V) {
fn print(w: &mut IO, (x, y, z): Self) {
w.print(x);
w.print(" ");
w.print(y);
w.print(" ");
w.print(z);
}
}
mod neboccoio_macro {
#[macro_export]
macro_rules! input {
(@start $io:tt @read @rest) => {};
(@start $io:tt @read @rest, $($rest: tt)*) => {
input!(@start $io @read @rest $($rest)*)
};
(@start $io:tt @read @rest mut $($rest:tt)*) => {
input!(@start $io @read @mut [mut] @rest $($rest)*)
};
(@start $io:tt @read @rest $($rest:tt)*) => {
input!(@start $io @read @mut [] @rest $($rest)*)
};
(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [$kind:tt; $len:expr] $($rest:tt)*) => {
let $($mut)* $var = $io.scan_vec::<$kind>($len);
input!(@start $io @read @rest $($rest)*)
};
(@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: $kind:tt $($rest:tt)*) => {
let $($mut)* $var = $io.scan::<$kind>();
input!(@start $io @read @rest $($rest)*)
};
(from $io:tt $($rest:tt)*) => {
input!(@start $io @read @rest $($rest)*)
};
}
}
// ------------ io module end ------------
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0