結果
問題 | No.533 Mysterious Stairs |
ユーザー |
|
提出日時 | 2020-07-14 19:43:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 396 ms / 5,000 ms |
コード長 | 2,988 bytes |
コンパイル時間 | 376 ms |
コンパイル使用メモリ | 82,208 KB |
実行使用メモリ | 194,480 KB |
最終ジャッジ日時 | 2024-11-18 10:21:42 |
合計ジャッジ時間 | 6,440 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
import sys,bisect,string,math,time,functools,random,fractionsfrom heapq import heappush,heappop,heapifyfrom collections import deque,defaultdict,Counterfrom itertools import permutations,combinations,groupbyrep=range;R=rangedef Golf():n,*t=map(int,open(0).read().split())def I():return int(input())def S_():return input()def IS():return input().split()def LS():return [i for i in input().split()]def MI():return map(int,input().split())def LI():return [int(i) for i in input().split()]def LI_():return [int(i)-1 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 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 RA():return map(int,open(0).read().split())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 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 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)mo=10**9+7inf=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))l_alp=string.ascii_lowercase#sys.setrecursionlimit(10**7)read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()show_flg=Falseshow_flg=Trueans=0n=I()dp=[[0]*4for i in range(n+4)]dp[1][1]=1dp[2][2]=1dp[3][3]=1for i in range(n):for h in range(1,4):for nx in range(1,4):if h==nx:continuedp[i+nx][nx]+=dp[i][h]dp[i+nx][nx]%=mofor h in range(1,4):ans+=dp[n][h]print(ans%mo)