結果
問題 | No.1974 2x2 Flipper |
ユーザー |
|
提出日時 | 2022-06-10 23:18:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 158 ms / 2,000 ms |
コード長 | 2,936 bytes |
コンパイル時間 | 208 ms |
コンパイル使用メモリ | 82,652 KB |
実行使用メモリ | 87,296 KB |
最終ジャッジ日時 | 2024-09-21 07:11:07 |
合計ジャッジ時間 | 5,468 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 25 |
ソースコード
def isPrimeMR(n):if n==1:return 0d = n - 1d = d // (d & -d)L = [2, 3, 5, 7, 11, 13, 17]if n in L:return 1for a in L:t = dy = pow(a, t, n)if y == 1: continuewhile y != n - 1:y = (y * y) % nif y == 1 or t == n - 1: return 0t <<= 1return 1def findFactorRho(n):from math import gcdm = 1 << n.bit_length() // 8for c in range(1, 99):f = lambda x: (x * x + c) % ny, r, q, g = 2, 1, 1, 1while g == 1:x = yfor i in range(r):y = f(y)k = 0while k < r and g == 1:ys = yfor i in range(min(m, r - k)):y = f(y)q = q * abs(x - y) % ng = gcd(q, n)k += mr <<= 1if g == n:g = 1while g == 1:ys = f(ys)g = gcd(abs(x - ys), n)if g < n:if isPrimeMR(g): return gelif isPrimeMR(n // g): return n // greturn findFactorRho(g)def primeFactor(n):i = 2ret = {}rhoFlg = 0while i*i <= n:k = 0while n % i == 0:n //= ik += 1if k: ret[i] = ki += 1 + i % 2if i == 101 and n >= 2 ** 20:while n > 1:if isPrimeMR(n):ret[n], n = 1, 1else:rhoFlg = 1j = findFactorRho(n)k = 0while n % j == 0:n //= jk += 1ret[j] = kif n > 1: ret[n] = 1if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}return retimport sys,random,bisectfrom collections import deque,defaultdict,Counterfrom heapq import heapify,heappop,heappushfrom itertools import cycle, permutationsfrom math import log,gcdinput = lambda :sys.stdin.readline().rstrip()mi = lambda :map(int,input().split())li = lambda :list(mi())H,W = mi()if H&1==0 and W&1==0:print(H*W)for _ in range(H):print(*[1]*W)elif H&1==1 and W&1==0:print(H*W-W)for _ in range(H-1):print(*[1]*W)print(*[0]*W)elif H&1==0 and W&1==1:print(H*W-H)for _ in range(H):print(*([1]*(W-1)+[0]))else:if H <= W:print(H*W-W)res = [[1]*W for i in range(H)]for i in range(H):res[i][i] = 0for j in range(H,W):res[0][j] = 0for i in range(H):print(*res[i])else:print(H*W-H)res = [[1]*W for i in range(H)]for i in range(W):res[i][i] = 0for j in range(W,H):res[j][0] = 0for i in range(H):print(*res[i])