#921262 (Rust) No.2509 Beam Shateki

提出ソース
結果

問題	No.2509 Beam Shateki
ユーザー	tipstar0125
提出日時	2023-10-20 22:31:50
言語	Rust (1.77.0 + proconio)
結果	WA
実行時間	-
コード長	23,182 bytes
コンパイル時間	13,883 ms
コンパイル使用メモリ	382,784 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-20 20:14:28
合計ジャッジ時間	16,881 ms
ジャッジサーバーID （参考情報）	judge3 / judge4
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	1 ms 5,248 KB
testcase_02	AC	1 ms 5,248 KB
testcase_03	AC	7 ms 5,376 KB
testcase_04	AC	7 ms 5,376 KB
testcase_05	AC	7 ms 5,376 KB
testcase_06	AC	7 ms 5,376 KB
testcase_07	AC	7 ms 5,376 KB
testcase_08	AC	7 ms 5,376 KB
testcase_09	AC	6 ms 5,376 KB
testcase_10	WA	-
testcase_11	AC	7 ms 5,376 KB
testcase_12	AC	8 ms 5,376 KB
testcase_13	AC	45 ms 5,376 KB
testcase_14	AC	44 ms 5,376 KB
testcase_15	AC	42 ms 5,376 KB
testcase_16	WA	-
testcase_17	AC	44 ms 5,376 KB
testcase_18	AC	43 ms 5,376 KB
testcase_19	AC	43 ms 5,376 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	44 ms 5,376 KB
testcase_23	AC	43 ms 5,376 KB
testcase_24	AC	44 ms 5,376 KB
testcase_25	AC	44 ms 5,376 KB
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	46 ms 5,376 KB
testcase_29	AC	44 ms 5,376 KB
testcase_30	AC	46 ms 5,376 KB
testcase_31	WA	-
testcase_32	AC	43 ms 5,376 KB
testcase_33	AC	2 ms 5,376 KB
testcase_34	AC	12 ms 5,376 KB
testcase_35	AC	23 ms 5,376 KB
testcase_36	AC	5 ms 5,376 KB
testcase_37	AC	1 ms 5,376 KB
testcase_38	AC	6 ms 5,376 KB
testcase_39	AC	5 ms 5,376 KB
testcase_40	AC	14 ms 5,376 KB
testcase_41	AC	1 ms 5,376 KB
testcase_42	AC	7 ms 5,376 KB
testcase_43	AC	28 ms 5,376 KB
testcase_44	AC	34 ms 5,376 KB
testcase_45	AC	5 ms 5,376 KB
testcase_46	AC	9 ms 5,376 KB
testcase_47	AC	33 ms 5,376 KB
testcase_48	AC	10 ms 5,376 KB
testcase_49	AC	17 ms 5,376 KB
testcase_50	AC	20 ms 5,376 KB
testcase_51	AC	2 ms 5,376 KB
testcase_52	AC	12 ms 5,376 KB
testcase_53	WA	-
testcase_54	WA	-
testcase_55	AC	1 ms 5,376 KB
testcase_56	AC	1 ms 5,376 KB
testcase_57	AC	1 ms 5,376 KB
testcase_58	WA	-
testcase_59	AC	1 ms 5,376 KB
testcase_60	WA	-
testcase_61	AC	1 ms 5,376 KB
testcase_62	WA	-
testcase_63	WA	-
権限があれば一括ダウンロードができます
ソースコード

raw source code
#![allow(non_snake_case)]
#![allow(unused_imports)]
#![allow(unused_macros)]
#![allow(clippy::needless_range_loop)]
#![allow(clippy::comparison_chain)]
#![allow(clippy::nonminimal_bool)]
#![allow(clippy::neg_multiply)]
#![allow(dead_code)]
// use itertools::Itertools;
// use superslice::Ext;
use std::cmp::Reverse;
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, VecDeque};

#[derive(Default)]
struct Solver {}
impl Solver {
    fn solve(&mut self) {
        input! {
            H: usize,
            W: usize,
            A: [[usize; W]; H]
        }

        let mut ans = 0;
        // yoko
        for i in 0..H {
            let mut s = 0;
            let mut used = vec![vec![false; W]; H];
            for j in 0..W {
                s += A[i][j];
                used[i][j] = true;
            }

            // yoko
            for k in 0..H {
                let mut ss = s;
                for l in 0..W {
                    if !used[k][l] {
                        ss += A[k][l];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // tate
            for k in 0..W {
                let mut ss = s;
                for l in 0..H {
                    if !used[l][k] {
                        ss += A[l][k];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // naname1
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname2
            for k in 0..H {
                let mut x = k;
                let mut y = 0_usize;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname3
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
            // naname4
            for k in 0..H {
                let mut x = k;
                let mut y = W - 1;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
        }

        // tate
        for i in 0..W {
            let mut s = 0;
            let mut used = vec![vec![false; W]; H];
            for j in 0..H {
                s += A[j][i];
                used[j][i] = true;
            }

            // yoko
            for k in 0..H {
                let mut ss = s;
                for l in 0..W {
                    if !used[k][l] {
                        ss += A[k][l];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // tate
            for k in 0..W {
                let mut ss = s;
                for l in 0..H {
                    if !used[l][k] {
                        ss += A[l][k];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // naname1
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname2
            for k in 0..H {
                let mut x = k;
                let mut y = 0_usize;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname3
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
            // naname4
            for k in 0..H {
                let mut x = k;
                let mut y = W - 1;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
        }
        // naname1
        for i in 0..W {
            let mut s = 0;
            let mut used = vec![vec![false; W]; H];
            let mut x = 0_usize;
            let mut y = i;
            while x < H && y < W {
                s += A[x][y];
                used[x][y] = true;
                x = x.wrapping_add(1);
                y = y.wrapping_add(1);
            }

            // yoko
            for k in 0..H {
                let mut ss = s;
                for l in 0..W {
                    if !used[k][l] {
                        ss += A[k][l];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // tate
            for k in 0..W {
                let mut ss = s;
                for l in 0..H {
                    if !used[l][k] {
                        ss += A[l][k];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // naname1
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname2
            for k in 0..H {
                let mut x = k;
                let mut y = 0_usize;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname3
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
            // naname4
            for k in 0..H {
                let mut x = k;
                let mut y = W - 1;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
        }
        // naname2
        for i in 0..H {
            let mut used = vec![vec![false; W]; H];
            let mut x = i;
            let mut y = 0_usize;
            let mut s = 0;
            while x < H && y < W {
                s += A[x][y];
                used[x][y] = true;
                x = x.wrapping_add(1);
                y = y.wrapping_add(1);
            }

            // yoko
            for k in 0..H {
                let mut ss = s;
                for l in 0..W {
                    if !used[k][l] {
                        ss += A[k][l];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // tate
            for k in 0..W {
                let mut ss = s;
                for l in 0..H {
                    if !used[l][k] {
                        ss += A[l][k];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // naname1
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname2
            for k in 0..H {
                let mut x = k;
                let mut y = 0_usize;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname3
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
            // naname4
            for k in 0..H {
                let mut x = k;
                let mut y = W - 1;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
        }
        // naname3
        for i in 0..W {
            let mut s = 0;
            let mut used = vec![vec![false; W]; H];
            let mut x = 0_usize;
            let mut y = i;
            while x < H && y < W {
                s += A[x][y];
                used[x][y] = true;
                x = x.wrapping_add(1);
                y = y.wrapping_add(!0);
            }

            // yoko
            for k in 0..H {
                let mut ss = s;
                for l in 0..W {
                    if !used[k][l] {
                        ss += A[k][l];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // tate
            for k in 0..W {
                let mut ss = s;
                for l in 0..H {
                    if !used[l][k] {
                        ss += A[l][k];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // naname1
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname2
            for k in 0..H {
                let mut x = k;
                let mut y = 0_usize;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname3
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
            // naname4
            for k in 0..H {
                let mut x = k;
                let mut y = W - 1;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
        }
        // naname4
        for i in 0..H {
            let mut used = vec![vec![false; W]; H];
            let mut x = i;
            let mut y = W - 1;
            let mut s = 0;
            while x < H && y < W {
                s += A[x][y];
                used[x][y] = true;
                x = x.wrapping_add(1);
                y = y.wrapping_add(!0);
            }

            // yoko
            for k in 0..H {
                let mut ss = s;
                for l in 0..W {
                    if !used[k][l] {
                        ss += A[k][l];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // tate
            for k in 0..W {
                let mut ss = s;
                for l in 0..H {
                    if !used[l][k] {
                        ss += A[l][k];
                    } else {
                        break;
                    }
                }
                ans = max!(ans, ss);
            }
            // naname1
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname2
            for k in 0..H {
                let mut x = k;
                let mut y = 0_usize;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(1);
                }
                ans = max!(ans, ss);
            }
            // naname3
            for k in 0..W {
                let mut x = 0_usize;
                let mut y = k;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
            // naname4
            for k in 0..H {
                let mut x = k;
                let mut y = W - 1;
                let mut ss = 0;
                while x < H && y < W {
                    if !used[x][y] {
                        ss += A[x][y];
                    } else {
                        break;
                    }
                    x = x.wrapping_add(1);
                    y = y.wrapping_add(!0);
                }
                ans = max!(ans, ss);
            }
        }
        println!("{}", ans);
    }
}

#[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();
}

#[macro_export]
macro_rules! input {
    () => {};
    (mut $var:ident: $t:tt, $($rest:tt)*) => {
        let mut $var = __input_inner!($t);
        input!($($rest)*)
    };
    ($var:ident: $t:tt, $($rest:tt)*) => {
        let $var = __input_inner!($t);
        input!($($rest)*)
    };
    (mut $var:ident: $t:tt) => {
        let mut $var = __input_inner!($t);
    };
    ($var:ident: $t:tt) => {
        let $var = __input_inner!($t);
    };
}

#[macro_export]
macro_rules! __input_inner {
    (($($t:tt),*)) => {
        ($(__input_inner!($t)),*)
    };
    ([$t:tt; $n:expr]) => {
        (0..$n).map(|_| __input_inner!($t)).collect::<Vec<_>>()
    };
    ([$t:tt]) => {{
        let n = __input_inner!(usize);
        (0..n).map(|_| __input_inner!($t)).collect::<Vec<_>>()
    }};
    (chars) => {
        __input_inner!(String).chars().collect::<Vec<_>>()
    };
    (bytes) => {
        __input_inner!(String).into_bytes()
    };
    (usize1) => {
        __input_inner!(usize) - 1
    };
    ($t:ty) => {
        $crate::read::<$t>()
    };
}

#[macro_export]
macro_rules! println {
    () => {
        $crate::write(|w| {
            use std::io::Write;
            std::writeln!(w).unwrap()
        })
    };
    ($($arg:tt)*) => {
        $crate::write(|w| {
            use std::io::Write;
            std::writeln!(w, $($arg)*).unwrap()
        })
    };
}

#[macro_export]
macro_rules! print {
    ($($arg:tt)*) => {
        $crate::write(|w| {
            use std::io::Write;
            std::write!(w, $($arg)*).unwrap()
        })
    };
}

#[macro_export]
macro_rules! flush {
    () => {
        $crate::write(|w| {
            use std::io::Write;
            w.flush().unwrap()
        })
    };
}

pub fn read<T>() -> T
where
    T: std::str::FromStr,
    T::Err: std::fmt::Debug,
{
    use std::cell::RefCell;
    use std::io::*;

    thread_local! {
        pub static STDIN: RefCell<StdinLock<'static>> = RefCell::new(stdin().lock());
    }

    STDIN.with(|r| {
        let mut r = r.borrow_mut();
        let mut s = vec![];
        loop {
            let buf = r.fill_buf().unwrap();
            if buf.is_empty() {
                break;
            }
            if let Some(i) = buf.iter().position(u8::is_ascii_whitespace) {
                s.extend_from_slice(&buf[..i]);
                r.consume(i + 1);
                if !s.is_empty() {
                    break;
                }
            } else {
                s.extend_from_slice(buf);
                let n = buf.len();
                r.consume(n);
            }
        }
        std::str::from_utf8(&s).unwrap().parse().unwrap()
    })
}

pub fn write<F>(f: F)
where
    F: FnOnce(&mut std::io::BufWriter<std::io::StdoutLock>),
{
    use std::cell::RefCell;
    use std::io::*;

    thread_local! {
        pub static STDOUT: RefCell<BufWriter<StdoutLock<'static>>> =
            RefCell::new(BufWriter::new(stdout().lock()));
    }

    STDOUT.with(|w| f(&mut w.borrow_mut()))
}

trait Bound<T> {
    fn lower_bound(&self, x: &T) -> usize;
    fn upper_bound(&self, x: &T) -> usize;
}

impl<T: PartialOrd> Bound<T> for [T] {
    fn lower_bound(&self, x: &T) -> usize {
        let (mut low, mut high) = (0, self.len());
        while low + 1 < high {
            let mid = (low + high) / 2;
            if self[mid] < *x {
                low = mid;
            } else {
                high = mid;
            }
        }
        if self[low] < *x {
            low + 1
        } else {
            low
        }
    }

    fn upper_bound(&self, x: &T) -> usize {
        let (mut low, mut high) = (0, self.len());
        while low + 1 < high {
            let mid = (low + high) / 2;
            if self[mid] <= *x {
                low = mid;
            } else {
                high = mid;
            }
        }
        if self[low] <= *x {
            low + 1
        } else {
            low
        }
    }
}
yukicoder

結果

テストケース

ソースコード
