結果

問題 No.43 野球の試合
ユーザー McGregorshMcGregorsh
提出日時 2023-05-11 23:29:44
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,372 bytes
コンパイル時間 148 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 91,520 KB
最終ジャッジ日時 2024-05-05 18:55:27
合計ジャッジ時間 2,462 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 140 ms
89,344 KB
testcase_01 AC 140 ms
88,960 KB
testcase_02 AC 136 ms
88,960 KB
testcase_03 AC 138 ms
89,472 KB
testcase_04 AC 136 ms
89,472 KB
testcase_05 AC 135 ms
89,472 KB
testcase_06 AC 148 ms
89,984 KB
testcase_07 AC 213 ms
91,520 KB
testcase_08 WA -
testcase_09 AC 141 ms
89,472 KB
testcase_10 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from fractions import Fraction
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext, ROUND_HALF_UP
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


def main():
   
   N = int(input())
   S = [input() for i in range(N)]
   
   nums = []
   count = [0] * N
   for i in range(N):
   	  for j in range(i+1, N):
   	  	  if S[i][j] == '-':
   	  	  	  nums.append([i, j])
   	  	  elif S[i][j] == 'o':
   	  	  	  count[i] += 1
   	  	  elif S[i][j] == 'x':
   	  	  	  count[j] += 1
   
   if len(nums) == 0:
   	  p = count[0]
   	  count.sort(reverse=True)
   	  for j in range(N):
   	  	  if count[j] <= p:
   	  	  	  print(j+1)
   	  	  	  exit()
   else:
   	  lennums = len(nums)
   	  ans = INF
   	  for bit in product([0, 1], repeat=lennums):
   	  	  nc = deepcopy(count)
   	  	  for i in range(lennums):
   	  	  	  if bit[i] == 1:
   	  	  	  	  a, b = nums[i]
   	  	  	  	  nc[a] += 1
   	  	  	  else:
   	  	  	  	  a, b = nums[i]
   	  	  	  	  nc[b] += 1
   	  	  p = nc[0]
   	  	  nc.sort(reverse=True)
   	  	  P = 0
   	  	  for j in range(N):
   	  	  	  if nc[j] <= p:
   	  	  	  	  P = j + 1
   	  	  	  	  break
   	  	  ans = min(ans, P)
   	  print(ans)
   	  	  
if __name__ == '__main__':
    main()
0