結果
| 問題 | No.957 植林 |
| ユーザー |
 akiradeveloper
|
| 提出日時 | 2019-12-19 23:19:14 |
| 言語 | Rust (1.77.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,894 bytes |
| コンパイル時間 | 2,300 ms |
| コンパイル使用メモリ | 168,852 KB |
| 実行使用メモリ | 4,500 KB |
| 最終ジャッジ日時 | 2023-09-21 07:41:07 |
| 合計ジャッジ時間 | 17,195 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| 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 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | AC | 963 ms
4,376 KB |
| testcase_09 | AC | 950 ms
4,376 KB |
| testcase_10 | AC | 1,025 ms
4,376 KB |
| testcase_11 | AC | 819 ms
4,380 KB |
| testcase_12 | AC | 1,192 ms
4,376 KB |
| testcase_13 | AC | 1,020 ms
4,380 KB |
| testcase_14 | AC | 1,196 ms
4,380 KB |
| testcase_15 | AC | 958 ms
4,376 KB |
| testcase_16 | AC | 740 ms
4,376 KB |
| testcase_17 | AC | 885 ms
4,376 KB |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | WA | - |
| testcase_36 | WA | - |
| testcase_37 | WA | - |
| testcase_38 | WA | - |
| testcase_39 | WA | - |
| testcase_40 | WA | - |
| testcase_41 | AC | 1,253 ms
4,380 KB |
| testcase_42 | AC | 1,595 ms
4,380 KB |
| testcase_43 | AC | 10 ms
4,376 KB |
| testcase_44 | AC | 10 ms
4,376 KB |
| testcase_45 | AC | 2 ms
4,376 KB |
| testcase_46 | AC | 1 ms
4,376 KB |
| testcase_47 | AC | 1 ms
4,376 KB |
コンパイルメッセージ
warning: value assigned to `bene` is never read
--> Main.rs:156:25
|
156 | let mut bene = -1;
| ^^^^
|
= help: maybe it is overwritten before being read?
= note: `#[warn(unused_assignments)]` on by default
warning: variable `G` should have a snake case name
--> Main.rs:113:9
|
113 | G:[[i64;w];h],
| ^ help: convert the identifier to snake case: `g`
|
= note: `#[warn(non_snake_case)]` on by default
warning: variable `R` should have a snake case name
--> Main.rs:114:9
|
114 | R:[i64;h],
| ^ help: convert the identifier to snake case: `r`
warning: variable `C` should have a snake case name
--> Main.rs:115:9
|
115 | C:[i64;w],
| ^ help: convert the identifier to snake case (notice the capitalization): `c`
warning: 4 warnings emitted
ソースコード
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[macro_export]
macro_rules ! chmax { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: max ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! chmin { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: min ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! max { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: max ( $ x , max ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: min ( $ x , min ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! dvec { ( $ t : expr ; $ len : expr ) => { vec ! [ $ t ; $ len ] } ; ( $ t : expr ; $ len : expr , $ ( $ rest : expr ) ,* ) => { vec ! [ dvec ! ( $ t ; $ ( $ rest ) ,* ) ; $ len ] } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[macro_export]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut parser = Parser :: from_str ( $ s ) ; input_inner ! { parser , $ ( $ r ) * } } ; ( parser = $ parser : ident , $ ( $ r : tt ) * ) => { input_inner ! { $ parser , $ ( $ r ) * } } ; ( new_stdin_parser = $ parser : ident , $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let reader = std :: io :: BufReader :: new ( stdin . lock ( ) ) ; let mut $ parser = Parser :: new ( reader ) ; input_inner ! { $ parser , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { input ! { new_stdin_parser = parser , $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! input_inner { ( $ parser : ident ) => { } ; ( $ parser : ident , ) => { } ; ( $ parser : ident , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ parser , $ t ) ; input_inner ! { $ parser $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! read_value { ( $ parser : ident , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ parser , $ t ) ) ,* ) } ; ( $ parser : ident , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ parser , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ parser : ident , chars ) => { read_value ! ( $ parser , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ parser : ident , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
reader: R,
buf: Vec<u8>,
pos: usize,
}
impl Parser<io::Empty> {
pub fn from_str(s: &str) -> Parser<io::Empty> {
Parser {
reader: io::empty(),
buf: s.as_bytes().to_vec(),
pos: 0,
}
}
}
impl<R: BufRead> Parser<R> {
pub fn new(reader: R) -> Parser<R> {
Parser {
reader: reader,
buf: vec![],
pos: 0,
}
}
pub fn update_buf(&mut self) {
self.buf.clear();
self.pos = 0;
loop {
let (len, complete) = {
let buf2 = self.reader.fill_buf().unwrap();
self.buf.extend_from_slice(buf2);
let len = buf2.len();
if len == 0 {
break;
}
(len, buf2[len - 1] <= 0x20)
};
self.reader.consume(len);
if complete {
break;
}
}
}
pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
loop {
let mut begin = self.pos;
while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
begin += 1;
}
let mut end = begin;
while end < self.buf.len() && (self.buf[end] > 0x20) {
end += 1;
}
if begin != self.buf.len() {
self.pos = end;
return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
} else {
self.update_buf();
}
}
}
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
use std::thread;
if BIG_STACK_SIZE {
thread::Builder::new()
.stack_size(32 * 1024 * 1024)
.name("solve".into())
.spawn(solve)
.unwrap()
.join()
.unwrap();
} else {
solve();
}
}
fn solve() {
input!{
h:usize,w:usize,
G:[[i64;w];h],
R:[i64;h],
C:[i64;w],
}
// 残ってるやつ
let mut hs = HashSet::new();
for i in 0..h+1 {
hs.insert(i);
}
let mut ws = HashSet::new();
for j in 0..w+1 {
ws.insert(j);
}
let mut tot = 0;
loop {
let mut hcost = vec![0;h];
for i in 0..h {
let mut cost = 0;
for j in 0..w {
if ws.contains(&j) {
cost += G[i][j];
}
}
hcost[i] = cost;
}
let mut wcost = vec![0;w];
for j in 0..w {
let mut cost = 0;
for i in 0..h {
if hs.contains(&i) {
cost += G[i][j];
}
}
wcost[j] = cost;
}
let mut tgt = None;
// O(n^2)
'outer: for &i in &hs {
for &j in &ws {
if i==h && j==w { continue; }
let mut bene = -1;
if i==h {
bene = C[j];
bene -= wcost[j];
} else if j==w {
bene = R[i];
bene -= hcost[i];
} else {
bene = R[i] + C[j];
bene -= hcost[i] + wcost[j] - G[i][j];
}
if bene >= 0 {
tot += bene;
tgt = Some((i,j));
break 'outer;
}
}
}
// O(1)
if let Some((i,j)) = tgt {
if i < h {
hs.remove(&i);
}
if j < w {
ws.remove(&j);
}
} else {
break;
}
}
println!("{}", tot);
}