結果
問題 | No.43 野球の試合 |
ユーザー |
![]() |
提出日時 | 2020-06-04 00:29:35 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 564 ms / 5,000 ms |
コード長 | 1,732 bytes |
コンパイル時間 | 72 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 11,008 KB |
最終ジャッジ日時 | 2024-11-26 11:20:05 |
合計ジャッジ時間 | 2,844 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 7 |
ソースコード
import sysdef input(): return sys.stdin.readline().strip()def list2d(a, b, c): return [[c] * b for i in range(a)]def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]def ceil(x, y=1): return int(-(-x // y))def INT(): return int(input())def MAP(): return map(int, input().split())def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]def Yes(): print('Yes')def No(): print('No')def YES(): print('YES')def NO(): print('NO')sys.setrecursionlimit(10 ** 9)INF = 10 ** 19MOD = 10 ** 9 + 7EPS = 10 ** -10N = INT()grid = []for i in range(N):grid += list(input())def check(grid):win = [0] * Nfor i in range(N):for j in range(i+1, N):if grid[i*N+j] == 'o':win[i] += 1elif grid[i*N+j] == 'x':win[j] += 1win = [(a, i) for i, a in enumerate(win)]win.sort(reverse=1)rank = [0] * Ncur = 1rank[win[0][1]] = curfor i in range(1, N):if win[i][0] != win[i-1][0]:cur += 1rank[win[i][1]] = curreturn rank[0]gtob = {}b = 0for i in range(N):for j in range(i+1, N):gtob[i*N+j] = bb += 1ans = INFfor bit in range(1<<b):cur = grid[:]for i in range(N):for j in range(i+1, N):if cur[i*N+j] == '-':k = gtob[i*N+j]if bit>>k & 1:cur[i*N+j] = 'o'cur[j*N+i] = 'x'else:cur[i*N+j] = 'x'cur[j*N+i] = 'o'ans = min(ans, check(cur))print(ans)