結果

問題 No.2871 Universal Serial Bus
ユーザー katonyonkokatonyonko
提出日時 2024-09-06 23:21:01
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,776 bytes
コンパイル時間 258 ms
コンパイル使用メモリ 82,452 KB
実行使用メモリ 57,184 KB
最終ジャッジ日時 2024-09-06 23:21:12
合計ジャッジ時間 1,637 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 14 WA * 4
権限があれば一括ダウンロードができます

ソースコード

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

import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math
from itertools import product
_INPUT = """\
6
6 20
....................
.##################.
.#................#.
.##################.
.##################.
....................
####################
#..................#
#.################.#
#..................#
#..................#
####################
"""
def input():
return sys.stdin.readline()[:-1]
def solve(test):
H,W=map(int, input().split())
S=[input() for _ in range(H)]
T=[input() for _ in range(H)]
a,b=0,0
ans=0
for i in range(H):
for j in range(W):
if S[i][j]==T[i][j]:
a=1
if S[i][j]==T[H-1-i][W-1-j]:
b=1
r=1
for i in range(50):
if i%2==0 and a==0 or i%2==1 and b==0:
k=1-(1/2)**i
else:
k=0
# print(i+1,k)
ans+=(i+1)*k*r
r*=1-k
print(ans)
def random_input():
from random import randint,shuffle
N=randint(1,10)
M=randint(1,N)
A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
shuffle(A)
return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3
def simple_solve():
return []
def main(test):
if test==0:
solve(0)
elif test==1:
sys.stdin = io.StringIO(_INPUT)
case_no=int(input())
for _ in range(case_no):
solve(0)
else:
for i in range(1000):
sys.stdin = io.StringIO(random_input())
x=solve(1)
y=simple_solve()
if x!=y:
print(i,x,y)
print(*[line for line in sys.stdin],sep='')
break
#0:1:2:
main(0)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0