結果
問題 | No.2871 Universal Serial Bus |
ユーザー |
![]() |
提出日時 | 2024-09-06 21:37:14 |
言語 | Rust (1.83.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,618 bytes |
コンパイル時間 | 12,785 ms |
コンパイル使用メモリ | 409,024 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-06 21:37:46 |
合計ジャッジ時間 | 13,735 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 13 WA * 5 |
コンパイルメッセージ
warning: variable does not need to be mutable --> src/main.rs:118:9 | 118 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable does not need to be mutable --> src/main.rs:124:9 | 124 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:129:9 | 129 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:135:9 | 135 | let mut vec: Vec<f64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:140:9 | 140 | let mut vec: Vec<char> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:145:9 | 145 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:150:9 | 150 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:156:9 | 156 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: unused variable: `w` --> src/main.rs:197:9 | 197 | let w = dimensions[1]; | ^ help: if this is intentional, prefix it with an underscore: `_w` | = note: `#[warn(unused_variables)]` on by default warning: variable does not need to be mutable --> src/main.rs:233:17 | 233 | let mut
ソースコード
// -*- coding:utf-8-unix -*-// #![feature(map_first_last)]#![allow(dead_code)]#![allow(unused_imports)]#![allow(unused_macros)]// use core::num;use std::cmp::*;use std::fmt::*;use std::hash::*;use std::iter::FromIterator;use std::*;use std::{cmp, collections, fmt, io, iter, ops, str};const INF: i64 = 1223372036854775807;const UINF: usize = INF as usize;const LINF: i64 = 2147483647;const INF128: i128 = 1223372036854775807000000000000;const MOD1: i64 = 1000000007;const MOD9: i64 = 998244353;const MOD: i64 = MOD9;// const MOD: i64 = MOD2;const UMOD: usize = MOD as usize;const M_PI: f64 = 3.14159265358979323846;// use proconio::input;// const MOD: i64 = INF;use cmp::Ordering::*;use std::collections::*;use std::io::stdin;use std::io::stdout;use std::io::Write;macro_rules! p {($x:expr) => {//if exprprintln!("{}", $x);};}macro_rules! vp {// vector print separate with space($x:expr) => {println!("{}",$x.iter().map(|x| x.to_string()).collect::<Vec<_>>().join(" "));};}macro_rules! d {($x:expr) => {eprintln!("{:?}", $x);};}macro_rules! yn {($val:expr) => {if $val {println!("Yes");} else {println!("No");}};}macro_rules! map{// declear btreemap($($key:expr => $val:expr),*) => {{let mut map = ::std::collections::BTreeMap::new();$(map.insert($key, $val);)*map}};}macro_rules! set{// declear btreemap($($key:expr),*) => {{let mut set = ::std::collections::BTreeSet::new();$(set.insert($key);)*set}};}//input output#[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 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 vec: Vec<i64> = read_vec();(vec[0], vec[1])}#[allow(dead_code)]fn readiii() -> (i64, i64, i64) {let mut vec: Vec<i64> = read_vec();(vec[0], vec[1], vec[2])}#[allow(dead_code)]fn readuu() -> (usize, usize) {let mut vec: Vec<usize> = read_vec();(vec[0], vec[1])}#[allow(dead_code)]fn readff() -> (f64, f64) {let mut vec: Vec<f64> = read_vec();(vec[0], vec[1])}fn readcc() -> (char, char) {let mut vec: Vec<char> = read_vec();(vec[0], vec[1])}fn readuuu() -> (usize, usize, usize) {let mut vec: Vec<usize> = read_vec();(vec[0], vec[1], vec[2])}#[allow(dead_code)]fn readiiii() -> (i64, i64, i64, i64) {let mut vec: Vec<i64> = read_vec();(vec[0], vec[1], vec[2], vec[3])}#[allow(dead_code)]fn readuuuu() -> (usize, usize, usize, usize) {let mut vec: Vec<usize> = read_vec();(vec[0], vec[1], vec[2], vec[3])}use std::io::BufRead;fn rotate_180(s: &Vec<Vec<char>>) -> Vec<Vec<char>> {let h = s.len();let w = s[0].len();let mut rotated = vec![vec!['.'; w]; h];for i in 0..h {for j in 0..w {rotated[h - i - 1][w - j - 1] = s[i][j];}}rotated}fn compare(s: &Vec<Vec<char>>, t: &Vec<Vec<char>>) -> bool {let h = s.len();let w = s[0].len();for i in 0..h {for j in 0..w {if s[i][j] == t[i][j] {return false;}}}true}fn main() {let stdin = io::stdin();let mut lines = stdin.lock().lines();let first_line = lines.next().unwrap().unwrap();let dimensions: Vec<usize> = first_line.split_whitespace().map(|x| x.parse().unwrap()).collect();let h = dimensions[0];let w = dimensions[1];let mut s = Vec::new();let mut t = Vec::new();for _ in 0..h {let line = lines.next().unwrap().unwrap().chars().collect::<Vec<char>>();s.push(line);}for _ in 0..h {let line = lines.next().unwrap().unwrap().chars().collect::<Vec<char>>();t.push(line);}// d!(s);// d!(t);// 回転したSを作成let rotated_s = rotate_180(&s);let success1 = compare(&s, &t);let succsess2 = compare(&rotated_s, &t);if success1 {//0 + (1-1/(2^2) +(1- 1/(2^4)))let mut ans = 0.0;let mut prob = 1.0;for i in 0..1000 {let mut success = 1.0 - 1.0 / (2.0 as f64).powi(i);if i % 2 == 0 {ans += (i as f64 + 1.0) * prob * success;prob *= 1.0 - success;}}p!(ans);} else if succsess2 {//0 + (1-1/(2^2) +(1- 1/(2^4)))let mut ans = 0.0;let mut prob = 1.0;for i in 0..1000 {let mut success = 1.0 - 1.0 / (2.0 as f64).powi(i);if i % 2 == 1 {ans += (i as f64 + 1.0) * prob * success;prob *= 1.0 - success;}}p!(ans);} else {p!(-1);}}