#921146 (Rust) No.2509 Beam Shateki

提出ソース

結果

問題	No.2509 Beam Shateki
ユーザー	Moss_Local
提出日時	2023-10-20 22:03:05
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	1,469 ms / 2,000 ms
コード長	6,927 bytes
コンパイル時間	15,193 ms
コンパイル使用メモリ	384,628 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-20 19:02:43
合計ジャッジ時間	51,738 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	AC	1 ms 6,944 KB
testcase_03	AC	151 ms 6,940 KB
testcase_04	AC	144 ms 6,944 KB
testcase_05	AC	151 ms 6,944 KB
testcase_06	AC	154 ms 6,940 KB
testcase_07	AC	150 ms 6,940 KB
testcase_08	AC	146 ms 6,940 KB
testcase_09	AC	149 ms 6,944 KB
testcase_10	AC	152 ms 6,944 KB
testcase_11	AC	154 ms 6,940 KB
testcase_12	AC	149 ms 6,940 KB
testcase_13	AC	1,363 ms 6,940 KB
testcase_14	AC	1,346 ms 6,940 KB
testcase_15	AC	1,321 ms 6,944 KB
testcase_16	AC	1,331 ms 6,940 KB
testcase_17	AC	1,314 ms 6,940 KB
testcase_18	AC	1,351 ms 6,940 KB
testcase_19	AC	1,365 ms 6,944 KB
testcase_20	AC	1,347 ms 6,944 KB
testcase_21	AC	1,364 ms 6,944 KB
testcase_22	AC	1,359 ms 6,940 KB
testcase_23	AC	1,336 ms 6,940 KB
testcase_24	AC	1,463 ms 6,940 KB
testcase_25	AC	1,469 ms 6,944 KB
testcase_26	AC	1,345 ms 6,940 KB
testcase_27	AC	1,348 ms 6,940 KB
testcase_28	AC	1,377 ms 6,940 KB
testcase_29	AC	1,365 ms 6,940 KB
testcase_30	AC	1,331 ms 6,944 KB
testcase_31	AC	1,353 ms 6,940 KB
testcase_32	AC	1,319 ms 6,944 KB
testcase_33	AC	17 ms 6,940 KB
testcase_34	AC	276 ms 6,940 KB
testcase_35	AC	637 ms 6,944 KB
testcase_36	AC	101 ms 6,940 KB
testcase_37	AC	4 ms 6,940 KB
testcase_38	AC	117 ms 6,944 KB
testcase_39	AC	91 ms 6,940 KB
testcase_40	AC	339 ms 6,944 KB
testcase_41	AC	2 ms 6,940 KB
testcase_42	AC	131 ms 6,944 KB
testcase_43	AC	771 ms 6,944 KB
testcase_44	AC	943 ms 6,940 KB
testcase_45	AC	91 ms 6,940 KB
testcase_46	AC	171 ms 6,944 KB
testcase_47	AC	938 ms 6,940 KB
testcase_48	AC	227 ms 6,944 KB
testcase_49	AC	409 ms 6,944 KB
testcase_50	AC	491 ms 6,940 KB
testcase_51	AC	15 ms 6,944 KB
testcase_52	AC	300 ms 6,944 KB
testcase_53	AC	1 ms 6,940 KB
testcase_54	AC	1 ms 6,940 KB
testcase_55	AC	1 ms 6,940 KB
testcase_56	AC	1 ms 6,944 KB
testcase_57	AC	1 ms 6,940 KB
testcase_58	AC	1 ms 6,944 KB
testcase_59	AC	1 ms 6,940 KB
testcase_60	AC	2 ms 6,940 KB
testcase_61	AC	1 ms 6,940 KB
testcase_62	AC	1 ms 6,940 KB
testcase_63	AC	1 ms 6,940 KB

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

ソースコード

raw source code

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

fn main() {
    solve();
}

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readimat(h: usize, w: usize) -> Vec<Vec<i64>> {
    let mut mat = vec![vec![0; w]; h];
    for i in 0..h {
        let mut str = String::new();
        let _ = stdin().read_line(&mut str).unwrap();
        let mut iter = str.split_whitespace();
        for j in 0..w {
            mat[i][j] = iter.next().unwrap().parse::<i64>().unwrap();
        }
    }
    mat
}

fn readcmat(h: usize, w: usize) -> Vec<Vec<char>> {
    let mut mat = vec![vec!['.'; w]; h];
    for i in 0..h {
        let mut str = String::new();
        let _ = stdin().read_line(&mut str).unwrap();
        let mut iter = str.chars();
        for j in 0..w {
            mat[i][j] = iter.next().unwrap();
        }
    }
    mat
}

fn solve() {
    let (h, w) = readuu();
    let mat = readimat(h, w);
    let mut cand = vec![];
    for i in 0..h {
        let mut c = vec![];
        for j in 0..w {
            c.push((i, j));
        }
        cand.push(c);
    }
    for j in 0..w {
        let mut c = vec![];
        for i in 0..h {
            c.push((i, j));
        }
        cand.push(c);
    }
    for i in 0..=(h + w - 2) {
        let mut c = vec![];
        for j in 0..=i {
            if j >= h || i - j >= w {
                continue;
            }
            c.push((j, i - j));
        }
        cand.push(c);
    }
    for i in 0..h {
        let mut pi = i;
        let mut pj = 0;
        let mut c = vec![];
        while pi < h && pj < w {
            c.push((pi, pj));
            pi += 1;
            pj += 1;
        }
        cand.push(c);
    }
    for i in 0..w {
        let mut pi = 0;
        let mut pj = i;
        let mut c = vec![];
        while pi < h && pj < w {
            c.push((pi, pj));
            pi += 1;
            pj += 1;
        }
        cand.push(c);
    }

    let mut res = 0;
    for i in 0..cand.len() {
        for j in i + 1..cand.len() {
            let mut set = BTreeSet::new();
            for k in 0..cand[i].len() {
                set.insert(cand[i][k]);
            }
            for k in 0..cand[j].len() {
                set.insert(cand[j][k]);
            }
            let mut sum = 0;
            for s in set {
                sum += mat[s.0][s.1];
            }
            res = max(res, sum);
        }
    }
    p!(res);
    return;
}

yukicoder

結果

テストケース

ソースコード