結果
問題 | No.226 0-1パズル |
ユーザー | mkawa2 |
提出日時 | 2023-02-28 22:09:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 81 ms / 5,000 ms |
コード長 | 1,684 bytes |
コンパイル時間 | 288 ms |
コンパイル使用メモリ | 87,248 KB |
実行使用メモリ | 76,380 KB |
最終ジャッジ日時 | 2023-10-04 12:09:03 |
合計ジャッジ時間 | 2,935 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,396 KB |
testcase_01 | AC | 75 ms
71,276 KB |
testcase_02 | AC | 75 ms
71,572 KB |
testcase_03 | AC | 73 ms
71,140 KB |
testcase_04 | AC | 81 ms
76,380 KB |
testcase_05 | AC | 74 ms
71,140 KB |
testcase_06 | AC | 73 ms
71,468 KB |
testcase_07 | AC | 73 ms
71,444 KB |
testcase_08 | AC | 72 ms
71,532 KB |
testcase_09 | AC | 70 ms
71,268 KB |
testcase_10 | AC | 72 ms
71,472 KB |
testcase_11 | AC | 71 ms
71,288 KB |
testcase_12 | AC | 71 ms
71,292 KB |
testcase_13 | AC | 72 ms
71,332 KB |
testcase_14 | AC | 72 ms
71,444 KB |
testcase_15 | AC | 70 ms
71,436 KB |
testcase_16 | AC | 71 ms
71,468 KB |
testcase_17 | AC | 78 ms
75,732 KB |
testcase_18 | AC | 79 ms
76,088 KB |
testcase_19 | AC | 80 ms
76,316 KB |
testcase_20 | AC | 77 ms
76,072 KB |
testcase_21 | AC | 77 ms
76,100 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 md = 10**9+7 # md = 998244353 def solve(): cc = [[-1]*w, [-1]*w] res = 1 for i in range(h): ni = i & 1 for j, a in enumerate(aa[i]): if a == -1: continue if cc[ni][j] == -1: cc[ni][j] = a elif a != cc[ni][j]: return 0 # p2D(cc) for a, b in zip(cc[0], cc[1]): if a == b == -1: res = res*2%md elif a == b == 0 or a == b == 1: return 0 return res h, w = LI() aa = [[-1]*w for _ in range(h)] for i in range(h): for j, c in enumerate(SI()): if c == "?": continue c = int(c) aa[i][j] = c # p2D(aa) ans = -1 ans += solve() # pDB(ans) aa = [col for col in zip(*aa)] h, w = w, h ans += solve() # pDB(ans) x = -1 for i in range(h): for j, a in enumerate(aa[i]): if a == -1: continue if x == -1: x = (i+j+a) & 1 elif x != (i+j+a) & 1: ans += 1 print(ans%md) exit() if x == -1: ans -= 1 print(ans%md)