結果
問題 | No.1974 2x2 Flipper |
ユーザー |
|
提出日時 | 2022-06-10 23:30:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 260 ms / 2,000 ms |
コード長 | 4,278 bytes |
コンパイル時間 | 170 ms |
コンパイル使用メモリ | 82,384 KB |
実行使用メモリ | 100,992 KB |
最終ジャッジ日時 | 2024-09-21 07:11:30 |
合計ジャッジ時間 | 8,112 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 25 |
ソースコード
import sysread=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()import bisect,string,math,time,functools,random,fractionsfrom bisect import*from heapq import heappush,heappop,heapifyfrom collections import deque,defaultdict,Counterfrom itertools import permutations,combinations,groupbyrep=range;R=rangedef I():return int(input())def LI():return [int(i) for i in input().split()]def SLI():return sorted([int(i) for i in input().split()])def LI_():return [int(i)-1 for i in input().split()]def S_():return input()def IS():return input().split()def LS():return [i for i in input().split()]def NI(n):return [int(input()) for i in range(n)]def NI_(n):return [int(input())-1 for i in range(n)]def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]def StoLI():return [ord(i)-97 for i in input()]def ItoS(n):return chr(n+97)def LtoS(ls):return ''.join([chr(i+97) for i in ls])def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]def RI(a=1,b=10):return random.randint(a,b)def INP():N=3n=random.randint(1,N)n=3p=4mn,mx=1,100000000q=[[random.randint(mn,mx) for i in range(p)]for i in range(n)]return n,p,qdef Rtest(T):case,err=0,0for i in range(T):inp=INP()a1=naive(*inp)a2=solve(*inp)if a1!=a2:print(inp)print('naive',a1)print('solve',a2)err+=1case+=1print('Tested',case,'case with',err,'errors')def GI(V,E,ls=None,Directed=False,index=1):org_inp=[];g=[[] for i in range(V)]FromStdin=True if ls==None else Falsefor i in range(E):if FromStdin:inp=LI()org_inp.append(inp)else:inp=ls[i]if len(inp)==2:a,b=inp;c=1else:a,b,c=inpif index==1:a-=1;b-=1aa=a,c,;bb=b,c,;g[a].append(bb)if not Directed:g[b].append(aa)return g,org_inpdef RE(E):rt=[[]for i in range(len(E))]for i in range(len(E)):for nb,d in E[i]:rt[nb]+=(i,d),return rtdef GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):#h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usagemp=[boundary]*(w+2);found={}for i in R(h):s=input()for char in search:if char in s:found[char]=((i+1)*(w+2)+s.index(char)+1)mp_def[char]=mp_def[replacement_of_found]mp+=[boundary]+[mp_def[j] for j in s]+[boundary]mp+=[boundary]*(w+2)return h+2,w+2,mp,founddef TI(n):return GI(n,n-1)def accum(ls):rt=[0]for i in ls:rt+=[rt[-1]+i]return rtdef bit_combination(n,base=2):rt=[]for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]return rtdef gcd(x,y):if y==0:return xif x%y==0:return ywhile x%y!=0:x,y=y,x%yreturn ydef RLE(it):rt=[]for i in it:if rt and rt[-1][0]==i:rt[-1][1]+=1else:rt+=[i,1],return rtdef YN(x):print(['NO','YES'][x])def Yn(x):print(['No','Yes'][x])def show(*inp,end='\n'):if show_flg:print(*inp,end=end)def gcj(t,*a):print('Case #{}:'.format(t+1),*a)mo=10**9+7#mo=998244353inf=float('inf')FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))alp=[chr(ord('a')+i)for i in range(26)]#sys.setrecursionlimit(10**7)show_flg=Falseshow_flg=Trueans=0h,w=LI()d=[[1]*w for i in range(h)]ans=h*wif h==1 or w==1:ans=0d=[[0]*w for i in range(h)]elif h%2==1 and w%2==0:ans-=wfor i in range(w):d[0][i]=0elif h%2==0 and w%2==1:ans-=hfor i in range(h):d[i][0]=0elif h%2==1 and w%2==1:ans-=max(h,w)if h<w:for i in range(h):d[h-1-i][i]=0for i in range(h,w):d[0][i]=0if h>=w:for i in range(w):d[w-1-i][i]=0for i in range(w,h):d[i][0]=0print(ans)for i in d:print(*i)#show()