提出詳細
ソースコード
for i in range(int(input())):
print("Case #{}:".format(i + 1))
W, H = map(int, input().split())
P = [input() for _ in range(H)]
black, white = 0, 0
for w in range(1, W):
for h in range(1, H):
for nw in range(0, W - w):
for nh in range(0, H - h):
if P[nh][nw] == P[nh + h][nw] == P[nh][nw + w] == P[nh + h][nw + w] == "B":
tmp = 0
for j in range(nw + 1, nw + w):
for k in range(nh + 1, nh + h):
if P[k][j] == "W":
tmp += 1
black = max(black, tmp)
if P[nh][nw] == P[nh + h][nw] == P[nh][nw + w] == P[nh + h][nw + w] == "W":
tmp = 0
for j in range(nw + 1, nw + w):
for k in range(nh + 1, nh + h):
if P[k][j] == "B":
tmp += 1
white = max(white, tmp)
if white > black:
print("W {}".format(white))
elif black > white:
print("B {}".format(black))
else:
print("DRAW")
提出情報
提出出力結果
テストケース情報