結果
| 問題 |
No.1345 Beautiful BINGO
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2021-01-16 15:00:50 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 3,904 bytes |
| コンパイル時間 | 13,817 ms |
| コンパイル使用メモリ | 402,932 KB |
| 実行使用メモリ | 6,824 KB |
| 最終ジャッジ日時 | 2024-11-27 17:20:41 |
| 合計ジャッジ時間 | 15,831 ms |
|
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 39 WA * 22 |
ソースコード
#![allow(unused_imports, unused_macros, dead_code)]
use std::{cmp::*, collections::*};
fn main() {
let mut sc = Scanner::new();
let n: usize = sc.cin();
let m: usize = sc.cin();
let mut x = vec![vec![0; n]; n];
for i in 0..n {
for j in 0..n {
let a: u64 = sc.cin();
x[i][j] = a;
}
}
let mut ans = 0;
for _ in 0..m {
ans += greedy(&mut x);
}
put!(ans);
}
fn greedy(x: &mut Vec<Vec<u64>>) -> u64 {
let n = x.len();
let mut mx = 200 * n as u64;
{
let s: u64 = (0..n).map(|i| x[i][i]).sum();
if s > 0 {
mx = min!(mx, s);
}
}
{
let s: u64 = (0..n).map(|i| x[i][n - 1 - i]).sum();
if s > 0 {
mx = min!(mx, s);
}
}
for i in 0..n {
let s: u64 = (0..n).map(|j| x[i][j]).sum();
if s > 0 {
mx = min!(mx, s);
}
}
for i in 0..n {
let s: u64 = (0..n).map(|j| x[j][i]).sum();
if s > 0 {
mx = min!(mx, s);
}
}
{
let s: u64 = (0..n).map(|i| x[i][i]).sum();
if s == mx {
for i in 0..n {
x[i][i] = 0;
}
return mx;
}
}
{
let s: u64 = (0..n).map(|i| x[i][n - 1 - i]).sum();
if s == mx {
for i in 0..n {
x[i][n - 1 - i] = 0;
}
return mx;
}
}
for i in 0..n {
let s: u64 = (0..n).map(|j| x[i][j]).sum();
if s == mx {
for j in 0..n {
x[i][j] = 0;
}
return mx;
}
}
for i in 0..n {
let s: u64 = (0..n).map(|j| x[j][i]).sum();
if s == mx {
for j in 0..n {
x[j][i] = 0;
}
return mx;
}
}
return 0;
}
// {{{
use std::io::{self, Write};
use std::str::FromStr;
struct Scanner {
stdin: io::Stdin,
buffer: VecDeque<String>,
}
impl Scanner {
fn new() -> Self {
Self {
stdin: io::stdin(),
buffer: VecDeque::new(),
}
}
fn cin<T: FromStr>(&mut self) -> T {
while self.buffer.is_empty() {
let mut line = String::new();
let _ = self.stdin.read_line(&mut line);
for w in line.split_whitespace() {
self.buffer.push_back(String::from(w));
}
}
self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
}
fn chars(&mut self) -> Vec<char> {
self.cin::<String>().chars().collect()
}
fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> {
(0..n).map(|_| self.cin()).collect()
}
}
fn flush() {
std::io::stdout().flush().unwrap();
}
#[macro_export]
macro_rules! min {
(.. $x:expr) => {{
let mut it = $x.iter();
it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
}};
($x:expr) => ($x);
($x:expr, $($ys:expr),*) => {{
let t = min!($($ys),*);
if $x < t { $x } else { t }
}}
}
#[macro_export]
macro_rules! max {
(.. $x:expr) => {{
let mut it = $x.iter();
it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
}};
($x:expr) => ($x);
($x:expr, $($ys:expr),*) => {{
let t = max!($($ys),*);
if $x > t { $x } else { t }
}}
}
#[macro_export]
macro_rules! trace {
($x:expr) => {
#[cfg(debug_assertions)]
eprintln!(">>> {} = {:?}", stringify!($x), $x)
};
($($xs:expr),*) => { trace!(($($xs),*)) }
}
#[macro_export]
macro_rules! put {
(.. $x:expr) => {{
let mut it = $x.iter();
if let Some(x) = it.next() { print!("{}", x); }
for x in it { print!(" {}", x); }
println!("");
}};
($x:expr) => { println!("{}", $x) };
($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}
// }}}