結果

問題 No.2094 Symmetry
ユーザー Moss_LocalMoss_Local
提出日時 2022-10-07 21:37:19
言語 Rust
(1.77.0)
結果
AC  
実行時間 49 ms / 2,000 ms
コード長 6,829 bytes
コンパイル時間 2,648 ms
コンパイル使用メモリ 156,652 KB
実行使用メモリ 9,244 KB
最終ジャッジ日時 2023-09-03 00:47:05
合計ジャッジ時間 4,629 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 1 ms
4,376 KB
testcase_09 AC 48 ms
8,720 KB
testcase_10 AC 48 ms
8,724 KB
testcase_11 AC 48 ms
8,684 KB
testcase_12 AC 49 ms
8,688 KB
testcase_13 AC 49 ms
8,736 KB
testcase_14 AC 48 ms
8,728 KB
testcase_15 AC 48 ms
8,688 KB
testcase_16 AC 47 ms
8,688 KB
testcase_17 AC 47 ms
8,644 KB
testcase_18 AC 48 ms
8,736 KB
testcase_19 AC 48 ms
8,740 KB
testcase_20 AC 48 ms
8,740 KB
testcase_21 AC 48 ms
8,688 KB
testcase_22 AC 48 ms
8,736 KB
testcase_23 AC 48 ms
8,724 KB
testcase_24 AC 47 ms
8,736 KB
testcase_25 AC 48 ms
8,736 KB
testcase_26 AC 48 ms
8,724 KB
testcase_27 AC 1 ms
4,376 KB
testcase_28 AC 20 ms
8,076 KB
testcase_29 AC 1 ms
4,380 KB
testcase_30 AC 21 ms
8,036 KB
testcase_31 AC 21 ms
7,996 KB
testcase_32 AC 20 ms
8,080 KB
testcase_33 AC 1 ms
4,380 KB
testcase_34 AC 24 ms
9,244 KB
testcase_35 AC 26 ms
8,676 KB
testcase_36 AC 23 ms
9,048 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around type
  --> Main.rs:85:15
   |
85 | fn readi() -> (i64) {
   |               ^   ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
85 - fn readi() -> (i64) {
85 + fn readi() -> i64 {
   |

warning: unnecessary parentheses around method argument
   --> Main.rs:209:23
    |
209 |             pair.push((vv[i][j] + vv[i][n - 1 - j]));
    |                       ^                           ^
    |
help: remove these parentheses
    |
209 -             pair.push((vv[i][j] + vv[i][n - 1 - j]));
209 +             pair.push(vv[i][j] + vv[i][n - 1 - j]);
    |

warning: unnecessary parentheses around method argument
   --> Main.rs:214:23
    |
214 |             data.push((vv[i][j]));
    |                       ^        ^
    |
help: remove these parentheses
    |
214 -             data.push((vv[i][j]));
214 +             data.push(vv[i][j]);
    |

warning: variable does not need to be mutable
   --> Main.rs:193:13
    |
193 |         let mut vvv: Vec<i64> = read_vec();
    |             ----^^^
    |             |
    |             help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: 4 warnings emitted

ソースコード

diff # 

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use core::num;
use std::any::Any;
use std::cmp::Ordering::*;
use std::collections::btree_map::Values;
use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::error::Error;
use std::f32::consts::E;
use std::fmt::Debug;
use std::fmt::Display;
use std::fs::File;
use std::hash::Hash;
use std::io::prelude::*;
use std::io::*;
use std::iter::Filter;
use std::iter::FromIterator;
use std::marker::Copy;
use std::mem::*;
use std::ops::BitAnd;
use std::ops::Bound::*;
use std::ops::RangeBounds;
use std::ops::{Add, Mul, Neg, Sub};
use std::process;
use std::slice::from_raw_parts;
use std::str;
use std::vec;

const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD: i64 = 1000000007;
// const MOD: i64 = 998244353;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;
// const MOD: i64 = INF;

use std::cmp::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;

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

macro_rules! d {
    ($x:expr) => {
        println!("{:?}", $x);
    };
}
#[allow(unused_macros)]
pub mod macros {
    macro_rules! min { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); std::cmp::min($x, y) } }}
    macro_rules! max { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); std::cmp::max($x, y) } }}
    macro_rules! chmin { ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); if $x > y { $x = y; true } else { false } }}}
    macro_rules! chmax { ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); if $x < y { $x = y; true } else { false } }}}
    macro_rules! multi_vec { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_vec![$element; ($($lens),*)]; $len] ); ($element: expr; ($len: expr)) => ( vec![$element; $len] ); }
    macro_rules! multi_box_array { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_box_array![$element; ($($lens),*)]; $len].into_boxed_slice() ); ($element: expr; ($len: expr)) => ( vec![$element; $len].into_boxed_slice() ); }
    #[allow(unused_imports)]
    pub(super) use {chmax, chmin, max, min, multi_box_array, multi_vec};
}
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 readi() -> (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()
}

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

fn solve() {
    let (n, k) = readuu();
    let n = 2 * n;
    let mut vv: Vec<Vec<char>> = vec![vec!['0' as char; (0) as usize]; (n) as usize];
    for i in 0..n {
        let s: String = read();
        let vvv = s.chars().collect();
        vv[i] = vvv;
    }
    let mat = vv;
    let mut vv: Vec<Vec<i64>> = vec![vec![0; (0) as usize]; (n) as usize];
    for i in 0..n {
        let mut vvv: Vec<i64> = read_vec();
        vv[i] = vvv;
    }
    let mut count_black = 0;
    for i in 0..n {
        for j in 0..n {
            if mat[i][j] == '#' {
                count_black += 1;
            }
        }
    }
    let mut res = -1 * INF;
    let mut data = vec![];
    let mut pair = vec![];
    for i in 0..n {
        for j in 0..n / 2 {
            pair.push((vv[i][j] + vv[i][n - 1 - j]));
        }
    }
    for i in 0..n {
        for j in 0..n {
            data.push((vv[i][j]));
        }
    }
    data.sort();
    data.reverse();
    pair.sort();
    pair.reverse();
    let mut r1 = 0;
    for i in 0..count_black {
        r1 += data[i];
    }
    res = max(res, r1);
    if count_black % 2 == 0 {
        let mut r2 = 0;
        for i in 0..count_black / 2 {
            r2 += pair[i];
        }
        res = max(res, r2 + k as i64);
    }
    println!("{}", res);

    return;
}
0