結果
| 問題 | No.3803 Crossword Key Checker |
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2026-11-20 04:46:53 |
| 言語 | Rust (1.99.1 + proconio + num + itertools + ACL) |
| 結果 |
AC
不安定
|
| 実行時間 | 1 ms / 2,000 ms |
| + 752µs | |
| コード長 | 4,540 bytes |
| 記録 | |
| コンパイル時間 | 1,088 ms |
| コンパイル使用メモリ | 180,684 KB |
| 実行使用メモリ | 9,920 KB |
| 最終ジャッジ日時 | 2026-11-20 04:47:00 |
| 合計ジャッジ時間 | 4,691 ms |
|
ジャッジサーバーID (参考情報) |
judge3_0 / judge1_0 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 47 |
コンパイルメッセージ
warning: unused variable: `h`
--> src/main.rs:85:21
|
85 | fn get_key_length_h(h :i32, w: i32, v: &Vec<bool>, y: i32, x: i32) -> i32 {
| ^ help: if this is intentional, prefix it with an underscore: `_h`
|
= note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
warning: unused variable: `h`
--> src/main.rs:135:13
|
135 | fn set_keys(h :i32, w: i32, v: &mut Vec<char>, ky: i32, kx: i32, kh: i32, kv: i32, khs: Option<String>, kvs: Option<String>) -> Res...
| ^ help: if this is intentional, prefix it with an underscore: `_h`
ソースコード
use std::io::stdin;
fn main() {
let (h, w) = input_size();
let board = input_board(h, w);
let mut keys: Vec<(i32, i32, i32, i32)> = Vec::new();
for i in 0..h {
for j in 0..w {
let kh = get_key_length_h(h, w, &board, i ,j);
let kv = get_key_length_v(h, w, &board, i, j);
if 1 < kh && 1 < kv {
keys.push((i, j, kh, kv));
} else if 1 < kh && kv <= 1 {
keys.push((i, j, kh, 0));
} else if kh <= 1 && 1 < kv {
keys.push((i, j, 0, kv));
}
}
}
let mut board: Vec<char> = board.into_iter().map(|v| {
if v {
'.'
} else {
'#'
}
}).collect();
let key_num = input_num();
for i in 0..key_num {
let (khs, kvs) = input_keys();
let (ky, kx, kh, kv) = keys[i as usize];
let result = set_keys(h, w, &mut board, ky, kx, kh, kv, khs, kvs);
if result == Err(()) {
println!("No");
return;
}
}
println!("Yes");
}
fn input_size() -> (i32, i32) {
let mut a = String::new();
stdin().read_line(&mut a).unwrap();
let v: Vec<i32> = a.trim().split_whitespace().map(|e| e.parse().ok().unwrap()).collect();
(v[0], v[1])
}
fn input_board(h: i32, w: i32) -> Vec<bool> {
let mut board = vec![false; (w*h) as usize];
for i in 0..h {
let mut a = String::new();
stdin().read_line(&mut a).unwrap();
let c: Vec<char> = a.chars().collect();
for j in 0..w {
if c[j as usize] == '.' {
board[(i * w + j) as usize] = true;
}
}
}
board
}
fn input_num() -> i32 {
let mut a = String::new();
stdin().read_line(&mut a).unwrap();
a.trim().parse().ok().unwrap()
}
fn input_keys() -> (Option<String>, Option<String>) {
let mut a = String::new();
stdin().read_line(&mut a).unwrap();
let v: Vec<Option<String>> = a.trim().split_whitespace().map(|e| {
if e == "-" {
None
} else {
Some(e.to_string())
}
}).collect();
(v[0].clone(), v[1].clone())
}
fn get_key_length_h(h :i32, w: i32, v: &Vec<bool>, y: i32, x: i32) -> i32 {
// 横
// 対象マスが黒か
if v[(y * w + x) as usize] == false {
return 0;
}
// 対象マスの左が白か
if 0 <= x - 1 && v[(y * w + (x - 1)) as usize] == true {
return 0;
}
// 対象マスの右が黒か
if x + 1 < w && v[(y * w + (x + 1)) as usize] == false {
return 0;
}
// 対象マスから右に続く白マスの数を取得
let mut vx = 0;
while x + vx < w {
if v[(y * w + (x + vx)) as usize] == false {
break;
}
vx += 1;
}
return vx;
}
fn get_key_length_v(h :i32, w: i32, v: &Vec<bool>, y: i32, x: i32) -> i32 {
// 縦
// 対象マスが黒か
if v[(y * w + x) as usize] == false {
return 0;
}
// 対象マスの上が白か
if 0 <= y - 1 && v[((y - 1) * w + x) as usize] == true {
return 0;
}
// 対象マスの下が黒か
if y + 1 < h && v[((y + 1) * w + x) as usize] == false {
return 0;
}
// 対象マスから下に続く白マスの数を取得
let mut vy = 0;
while y + vy < h {
if v[((y + vy) * w + x) as usize] == false {
break;
}
vy += 1;
}
return vy;
}
fn set_keys(h :i32, w: i32, v: &mut Vec<char>, ky: i32, kx: i32, kh: i32, kv: i32, khs: Option<String>, kvs: Option<String>) -> Result<(), ()>{
if let Some(khs) = khs {
if khs.len() != kh as usize {
return Err(());
}
for i in 0..khs.len() {
let kc = khs.chars().nth(i).unwrap();
let vc = v[(w * ky + (kx + i as i32)) as usize];
if vc == '.' || kc == vc {
v[(w * ky + (kx + i as i32)) as usize] = kc;
} else {
return Err(());
}
}
}
if let Some(kvs) = kvs {
if kvs.len() != kv as usize {
return Err(());
}
for i in 0..kvs.len() {
let kc = kvs.chars().nth(i).unwrap();
let vc = v[(w * (ky + i as i32) + kx) as usize];
if vc == '.' || kc == vc {
v[(w * (ky + i as i32) + kx) as usize] = kc;
} else {
return Err(());
}
}
}
Ok(())
}