結果

問題 No.1225 I hate I hate Matrix Construction
ユーザー Strorkis
提出日時 2020-09-11 22:29:53
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 32 ms / 2,000 ms
コード長 1,834 bytes
コンパイル時間 25,897 ms
コンパイル使用メモリ 378,036 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-27 16:02:48
合計ジャッジ時間 27,595 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

fn main() {
let n: usize = {
let mut buf = String::new();
std::io::stdin().read_line(&mut buf).unwrap();
buf.trim_end().parse().unwrap()
};
let s: Vec<u8> = {
let mut buf = String::new();
std::io::stdin().read_line(&mut buf).unwrap();
let iter = buf.split_whitespace();
iter.map(|x| x.parse().unwrap()).collect()
};
let t: Vec<u8> = {
let mut buf = String::new();
std::io::stdin().read_line(&mut buf).unwrap();
let iter = buf.split_whitespace();
iter.map(|x| x.parse().unwrap()).collect()
};
let mut a = vec![vec![3; n]; n];
for i in 0..n {
if s[i] == 1 { continue; }
for j in 0..n {
a[i][j] = if s[i] == 0 { 0 } else { 1 };
}
}
for j in 0..n {
if t[j] == 1 { continue; }
for i in 0..n {
a[i][j] = if t[j] == 0 { 0 } else { 1 };
}
}
for i in 0..n {
if s[i] != 1 || (0..n).any(|j| a[i][j] == 1) { continue; }
for j in 0..n {
if t[j] != 1 { continue; }
if (0..n).any(|k| a[k][j] == 1) { continue; }
a[i][j] = 1;
break;
}
}
for i in 0..n {
if s[i] != 1 || (0..n).any(|j| a[i][j] == 1) { continue; }
for j in 0..n {
if a[i][j] == 3 {
a[i][j] = 1;
break;
}
}
}
for j in 0..n {
if t[j] != 1 || (0..n).any(|i| a[i][j] == 1) { continue; }
for i in 0..n {
if a[i][j] == 3 {
a[i][j] = 1;
break;
}
}
}
let mut ans = 0;
for i in 0..n {
for j in 0..n {
if a[i][j] == 1 {
ans += 1;
}
}
}
println!("{}", ans);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0