結果

問題 No.43 野球の試合
ユーザー terasa
提出日時 2022-06-06 18:12:05
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,611 bytes
コンパイル時間 217 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 77,184 KB
最終ジャッジ日時 2024-09-21 04:42:36
合計ジャッジ時間 1,605 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 5 WA * 2
権限があれば一括ダウンロードができます

ソースコード

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

import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')
def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1
def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1
def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)
def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)
N = int(input())
S = [input()[:-1] for _ in range(N)]
rest = 0
for s in S:
    rest += s.count('-')
rest //= 2
ans = N
for s in range(1 << rest):
    cnt = 0
    A = [[None for _ in range(N)] for _ in range(N)]
    for i in range(N):
        for j in range(i, N):
            if S[i][j] == '-':
                A[i][j] = 'o' if s & (1 << cnt) else 'x'
                cnt += 1
            else:
                A[i][j] = S[i][j]
    for i in range(N):
        for j in range(i):
            if S[i][j] == '-':
                A[i][j] = 'x' if A[j][i] == 'o' else 'o'
            else:
                A[i][j] = S[i][j]
    result = [(i, A[i].count('o')) for i in range(N)]
    result.sort(key=lambda x: x[1], reverse=True)
    for i in range(N):
        j, _ = result[i]
        if j == 0:
            ans = min(ans, i + 1)
            break
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0