problem_id stringlengths 6 6 | user_id stringlengths 10 10 | time_limit float64 1k 8k | memory_limit float64 262k 1.05M | problem_description stringlengths 48 1.55k | codes stringlengths 35 98.9k | status stringlengths 28 1.7k | submission_ids stringlengths 28 1.41k | memories stringlengths 13 808 | cpu_times stringlengths 11 610 | code_sizes stringlengths 7 505 |
|---|---|---|---|---|---|---|---|---|---|---|
p03013 | u821989875 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import math\n# input\nstairs, broken = map(int, input().split())\nbroken_list = []\nfor i in range(broken):\n broken_list.append(int(input()))\n \n# main\ngoalable = True\nfor i in range(1, broken):\n if broken_list[i-1] == broken_list[i]-1:\n goalable = False\n\nif goalable:\n broken_list.append(stairs+1)\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s719853117', 's728465895', 's999721888'] | [7080.0, 7080.0, 6964.0] | [2104.0, 2103.0, 209.0] | [714, 718, 282] |
p03013 | u825378567 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N,M=map(int,input().split())\na=[int(input()) for _ in range(M)]\ndp=[1]*(N+1)\nif 1 in a:\n dp[1]=0\nelse:\n dp[1]=1\nfor i in range(1,N+1):\n if i in a:\n dp[i]=0\n else:\n dp[i]=dp[i-1]+dp[i-2]\n dp[i]%=1000000007\nprint(dp[N])\n\n\n', 'N,M=map(int,input().split())\ndp=[1]*(N+1)\nfor _ in range(M):\n i... | ['Wrong Answer', 'Accepted'] | ['s273916439', 's625674586'] | [7848.0, 6900.0] | [2104.0, 188.0] | [231, 189] |
p03013 | u828766688 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | [' import math\n def cmb(n, r):\n return math.factorial(n)// ( math.factorial(n-r) * math.factorial(r) )\n \n \n \n N,M = input().split()\n \n N = int(N)\n M = int(M)\n \n a = []\n ans = 1\n \n for i in range(M):\n newa = int(input())\n a.append(newa)... | ['Runtime Error', 'Accepted'] | ['s004614746', 's278302165'] | [2940.0, 460020.0] | [17.0, 468.0] | [1172, 559] |
p03013 | u829249049 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['from math import factorial\nimport sys\nN,M=map(int,input().split())\nANS1=1\nANS2=1\nANS3=1\nA=int(input())\nlist1=[A]\nDAN=A\nB=DAN-DAN//2\nfor k in range(B):\n a = factorial(B) / factorial(k+1) / factorial(B - (k+1))\n ANS1+=a\nfor i in range(1,M):\n ans2=1\n A=int(input())\n list1+=[A]\n DAN=A-list1[i-1]-1\... | ['Runtime Error', 'Accepted'] | ['s186116404', 's134474148'] | [5080.0, 460020.0] | [222.0, 488.0] | [657, 287] |
p03013 | u833997299 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N,M = map(int,input().split())\nfor _ in range(M):\n a.append(input())\n\nS = [0] * (N+1)\nfor n in range(N+1):\n if str(n) in a:\n S[n] = 0\n elif n<=1:\n S[n] = 1\n else:\n S[n] = S[n-1] + S[n-2]', 'N,M = map(int,input().split())\na = [True] * (N+1)\n\nfor _ in range(M):\n a[int(inpu... | ['Runtime Error', 'Accepted'] | ['s551768040', 's640170280'] | [3828.0, 7668.0] | [19.0, 194.0] | [217, 281] |
p03013 | u836737505 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['memo = [0]*10**6 \ndef fib(n):\n if n in a:\n return 0\n if n<=1:\n return 1 \n if memo[n] != 0:\n return memo[n] \n memo[n] = fib(n-1) + fib(n-2) \n return memo[n]\n\nprint(fib(i)%1000000007)\n', 'n,m = map(int, input().split())\na = set([int(input()) for _ in range(m)])\ndp = [0]... | ['Runtime Error', 'Accepted'] | ['s323928704', 's599564173'] | [10868.0, 13192.0] | [32.0, 178.0] | [370, 227] |
p03013 | u837286475 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['\nn, m = map(int, input().split())\nan = [0]*m\n\nfor i in range(m):\n\n an[i] = int( input() )\n#an[-1] = n\n\n#an.sort()\ndisjoint = False\nfor i in range(len(an)-1):\n if an[i] + 1 == an[i+1]:\n disjoint = True\n\n\n\n\n\nif disjoint:\n print(0)\n\nelse:\n\n mod = 10**9+7\n tab = [0]*(10**5+1... | ['Runtime Error', 'Accepted'] | ['s354321469', 's509714138'] | [463316.0, 462068.0] | [561.0, 523.0] | [740, 737] |
p03013 | u842388336 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\nbreaks = []\nfor _ in range(m):\n breaks.append(int(input())-1)\nstairs = [0 for _ in range(n)]\n\nif n == 1:\n print(1)\nelse:\n if 0 not in breaks:\n stairs[0]=1\n\n if 1 not in breaks:\n stairs[1]=1 \n\n for i in range(n):\n if i+1 not in breaks:\n if i+1>=n:\n... | ['Runtime Error', 'Accepted'] | ['s610344095', 's183968812'] | [13772.0, 465928.0] | [144.0, 499.0] | [574, 440] |
p03013 | u844646164 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['mod = 10**9+7\nn, m = map(int, input().split())\na = [int(input()) for _ in range(m)]\ncount = [0 for _ in range(n+1)]\nfor num in a:\n count[num] = -1\ncount[1] = 1\ncount[2] = 1\nfor i in range(2, n+1):\n if count[i] != -1:\n count[i] += (count[i-1] + count[i-2])%mod\n else:\n count[i] = 0\nprint(count)\np... | ['Runtime Error', 'Accepted'] | ['s751418243', 's806434996'] | [10252.0, 16616.0] | [207.0, 237.0] | [319, 366] |
p03013 | u846113428 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["n, m = map(int, input().split(' '))\na = []\nfor i in range(m):\n a.append(int(input()))\n\ndef t(current, n):\n if current == n:\n return 1\n if current in a:\n return 0\n p1, p2 = 0, 0\n if current + 1 not in a:\n p1 = t(current + 1, n)\n if current + 2 <= n and current + 2 no... | ['Runtime Error', 'Accepted'] | ['s046658495', 's228611092'] | [6996.0, 11884.0] | [2104.0, 307.0] | [646, 300] |
p03013 | u847861620 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["N, M = map(int,input().split(' '))\na = [int(input()) for i in range(M)]\nfor i in range(M-1):\n if a[i]+1 == a[i+1]:\n print(0)\n exit()\ndef step(n):\n if n == 0 :\n return 1\n elif n == 1 :\n return 2\n tmp = [0]*n\n tmp[0] = 1\n tmp[1] = 2\n for i in range(2,n):\n tmp[i] = tmp[i-2] + tmp[i-1... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s590476116', 's654607822', 's053805015'] | [7080.0, 7080.0, 13216.0] | [167.0, 165.0, 188.0] | [499, 470, 219] |
p03013 | u856775981 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,\xa0m\xa0=\xa0map(int,\xa0input().split())\n\xa0\na\xa0=\xa0[]\nfor\xa0i\xa0in\xa0range(m):\n\xa0\xa0\xa0\xa0a.append(int(input()))\n\xa0\ndp\xa0=\xa0[0]\xa0*\xa0(n\xa0+\xa01)\ndp[0]\xa0=\xa01\nfor\xa0now\xa0in\xa0range(0,\xa0n\xa0+\xa01):\n\xa0\xa0\xa0\xa0print(now,\xa0dp[now])\n\xa0\xa0\xa0\xa0for\xa0next_step\xa... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s383954709', 's541175113', 's663489354'] | [8916.0, 8956.0, 18992.0] | [25.0, 26.0, 210.0] | [439, 410, 335] |
p03013 | u857330600 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import queue\nq=queue.Queue()\nl=[]\nn,m=map(int,input().split())\nfor i in range(m):\n p=int(input())\n q.put(p)\nque=q.get()\nfor j in range(n+1):\n if j==0:\n l.append(1)\n elif j==1 and que!=1:\n l.append(1)\n elif j==que:\n l.append(0)\n que=q.get()\n else:\n l.append(l[j-2]+l[j-1])\nprint(l... | ['Time Limit Exceeded', 'Accepted'] | ['s376752841', 's665287001'] | [429040.0, 460020.0] | [2130.0, 458.0] | [314, 246] |
p03013 | u860002137 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import numpy as np\nfrom math import factorial\nimport math, sys\n\nN, M = map(int, input().split())\nA = [None]*M\n\nfor i in range(M):\n A[i] = int(input())\n\ntmp = 0\nx = []\n\nfor i, a in enumerate(A):\n x.append(a-tmp-1)\n tmp = a + 1\n\nx.append(N - tmp)\n \nx = np.array(x)\nif x[1:].min()<1:\n ... | ['Runtime Error', 'Accepted'] | ['s715802745', 's407133606'] | [21608.0, 18984.0] | [349.0, 153.0] | [656, 305] |
p03013 | u860478135 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\n\nn1, n2 = [int(i) for i in input().split()]\n\nna1 = []\n\nfor i1 in range(n2):\n na1.append(int(input()))\n\nfor i3 in range(n2):\n if i3 == 0:\n continue\n else:\n if na1[i3] == na1[i3 - 1] + 1:\n print("0")\n sys.exit()\n\nn3 = 0\nn4 = 0\nn5 = 0\nn6 = 0\nn7... | ['Wrong Answer', 'Accepted'] | ['s730148668', 's257136978'] | [7080.0, 7080.0] | [203.0, 191.0] | [958, 948] |
p03013 | u864273141 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import math\nN,M=map(int,input().split())\n\na1=int(input())\na2=a1\ndata=[a1]\nans_data=[]\nfor i in range(M-1):\n a1=a2\n a2=int(input())\n #print("a",a2-a1-1)\n data.append(a2-a1-1)\n \ndata.append(N-a2-1)\n \ndata=sorted(data)\n#print(data)\nif data[0]==0:\n print(0)\n \nelif data[M]==1:\n print(1)\nels... | ['Runtime Error', 'Accepted'] | ['s646456239', 's090346163'] | [4772.0, 13984.0] | [189.0, 211.0] | [811, 290] |
p03013 | u868628468 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\nN, M = map(int, input().split())\nA = [int(input()) for i in range(M)]\nd = [0]*N\nd[0] = 1\nd[1] = 1\ndef func(N):\n if d[N] > 0:\n return d[N]\n d[N] = func(N-1) + func(N-2)\n return d[N]\nif M == 0:\n print(func(N)/%1000000007)\n sys.exit()\n\nfor i in range(M-1):\n if A[i+1] =... | ['Runtime Error', 'Accepted'] | ['s755371103', 's318282599'] | [2940.0, 8472.0] | [17.0, 182.0] | [507, 437] |
p03013 | u874709037 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['\nn = 100\n\nm = 5\n\na = [1, 23, 45, 67, 89]\n\n\nINIT = 0\n\ndp = [INIT for i in range(n + 1)]\n\n\ndp[0] = 1\n\n\nfor i in range(1, n + 1):\n \n if (i in a):\n dp[i] = 0\n \n elif (i <= 1):\n dp[i] = dp[i - 1]\n \n else:\n dp[i] = dp[i - 1] + dp[i - 2]\n\n\nprint(dp[n] % 1000... | ['Wrong Answer', 'Accepted'] | ['s252084835', 's501264425'] | [3064.0, 462744.0] | [17.0, 631.0] | [875, 229] |
p03013 | u877415670 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\nA = [int(input()) for _ in range(M)]\nj = 0\ndp = [0] * 100100\ndp[0] = 1\nfor i in range(1,N+1):\n if i == A[j]:\n j += 1\n dp[i] = 0\n else:\n dp[i] = dp[i-1] + dp[i-2]\n dp[i] %= 10**9+7\nprint(dp[N])', 'N,M = (int(i) for i in input().split()) \na... | ['Runtime Error', 'Accepted'] | ['s626583140', 's104350599'] | [7824.0, 462708.0] | [186.0, 581.0] | [259, 253] |
p03013 | u882359130 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = [int(nm) for nm in input().split()]\nA = [-1]\nfor m in range(M):\n A.append(int(input()))\nA.append(N+1)\n\nimport math\ntotal_case = 1\nfor m in range(M+1):\n a1 = A[m]\n a2 = A[m+1]\n safe_stairs = a2 - a1 - 1\n if safe_stairs == 0:\n print(0)\n break\n howmany_jump1 = safe_stairs - 1\n mx_jump... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s422030916', 's464339640', 's327614787'] | [7076.0, 6864.0, 6876.0] | [2104.0, 220.0, 223.0] | [661, 395, 467] |
p03013 | u884601206 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=mp(int,input().split())\na=[int(input()) for i in range(m)]\nmod=10**9+7\n\ndp=[0]*(n+1)\ndp[0]=1\n\nif 1 not in a:\n dp[1]=1\nelse:\n dp[1]=0\n \n\nfor i in range(2,n+1):\n if i in a:\n continue\n dp[i]=dp[i-1]+dp[i-2]\n dp[i]%=mod\n \nprint(dp[n])\n', 'n,m=map(int,input().split())\na=set([int(input())... | ['Runtime Error', 'Accepted'] | ['s482097439', 's345318386'] | [3064.0, 13192.0] | [18.0, 189.0] | [245, 252] |
p03013 | u889344512 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int,input().split())\na = []\nfor i in range(m):\n a.append(int(input()))\ndp = []\ndp.append(1)\nj = 0\nif 1 == a[j]:\n dp.append(0)\n j += 1\nelse:\n dp.append(1)\n\nfor i in range(2,n+1):\n if i == a[j]:\n dp.append(0)\n j += 1\n else:\n dp.append(dp[i-1] + dp[i-2]... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s586460477', 's861423297', 's728947806'] | [428276.0, 4776.0, 460020.0] | [430.0, 2103.0, 457.0] | [328, 358, 385] |
p03013 | u895526251 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['broken_step = []\n \nline = [int(s) for s in input().split()]\n \nN, M = line[0], line[1]\n \nfor i in range(M):\n step_num = int(input().split()[0])\n broken_step.append(step_num)\n \n \ndp = [0]*(N+1)\ndp[0] = 1\nif 1 in broken_step:\n dp[1] = 0\nelse:\n dp[0] = 1\n \nfor i... | ['Wrong Answer', 'Accepted'] | ['s863937601', 's321640729'] | [7848.0, 460788.0] | [2104.0, 433.0] | [403, 283] |
p03013 | u896741788 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["from functools import lru_cache\ndan,ana=map(int,input().split())\nl=[int(input()) for _ in range(ana)]\n@lru_cache(maxsize=float('inf'))\ndef f(x,*li):\n if x in li:return 0\n elif x==1:return 1\n elif x==2:return f(1,*li)+1\n else:return (f(x-1,*li)+f(x-2,*li))%(10**9+7)\n\nprint(f(dan,*l))", 'from functools im... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s278993492', 's834975474', 's854499574', 's164240974'] | [7576.0, 7572.0, 13076.0, 11884.0] | [174.0, 167.0, 394.0, 181.0] | [287, 278, 280, 190] |
p03013 | u898967808 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N,M = (map(int,input1.split()))\nA = list(map(int,input2.split()))\n\ndp = []\ndp.append(1) \nif 1 in A: \n dp.append(0) \nelse :\n dp.append(1) \n\nfor i in range(2,N+1): \n if i in A:\n dp.append(0)\n else :\n dp.append(dp[i-1]+dp[i-2])\nprint(dp[N]) ', 'N,M = map(int,input().split())\nA = list(map(int,[... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s495005266', 's876544225', 's476830800'] | [3064.0, 17408.0, 460788.0] | [18.0, 2104.0, 450.0] | [276, 265, 279] |
p03013 | u899909022 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\nD=[1] * (n + 1)\nfor _ in range(m):\n D[int(input())] = 0\nfor i in range(n+1):\n if i > 2:\n D[i] = (D[i-1] + D[i-2]) % 1000000007 * D[i]\nprint(D[i])', 'n,m = map(int,input().split())\nD=[1] * (n+1)\nfor _ in range(m):\n D[int(input())] = 0\nfor i in range(2, n+1):\n ... | ['Wrong Answer', 'Accepted'] | ['s959603780', 's295233272'] | [6976.0, 6976.0] | [213.0, 208.0] | [187, 172] |
p03013 | u902151549 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['# coding: utf-8\nimport os\nimport time\nimport re\nimport math\n\n\ndef main():\n N,M=map(int,input().split())\n A=[int(input()) for a in range(M)] \n start=time.time();#\n memo=[0]*(N+1)\n memo[0]=1\n ban=[False]*(N+1)\n for a in A:\n ban[a]=True\n mod=1000000007\n print(ban)\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s135361842', 's137802565', 's266849467', 's272171666', 's338757274', 's699197826', 's750398789', 's851460722', 's950515155', 's668538971'] | [10608.0, 465012.0, 8820.0, 8820.0, 8052.0, 8052.0, 461040.0, 8820.0, 8820.0, 8820.0] | [175.0, 517.0, 175.0, 168.0, 1466.0, 1459.0, 452.0, 176.0, 172.0, 170.0] | [613, 529, 597, 613, 574, 587, 591, 606, 638, 598] |
p03013 | u902577051 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['# -*- coding: utf-8 -*-\nn, m = map(int, input().split())\nBIGNUM = 1000000007\n\nzero_flag = False\n\nlast_ana = int(input())\nblocks = [last_ana]\n\nfor _ in range(1, m):\n ana = int(input())\n blocks.append(ana - last_ana - 1)\n last_ana = ana\n\nblocks.append(n - last_ana)\n\nprint(max(blocks))\nb_max = ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s164221974', 's457458011', 's766384521'] | [3876.0, 7060.0, 7056.0] | [189.0, 191.0, 188.0] | [611, 641, 513] |
p03013 | u905203728 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\nA=list(int(input()) for i in range(m))\ndp=[0]*(n+1)\ndp[0]=1\nj=0\nfor i in range(1,n+1):\n if i==A[j]:\n dp[i]=0\n j +=1\n else:\n dp[i]=(dp[i-1]+dp[i-2])\n\nprint(dp[n]%1000000007)', 'n,m=map(int,input().split())\nA=list(int(input()) for i in range(m))+[-1]\... | ['Runtime Error', 'Accepted'] | ['s653051102', 's222936633'] | [428276.0, 460020.0] | [442.0, 449.0] | [228, 230] |
p03013 | u908349502 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int,input().split())\na = [-1]\nfor i in range(m):\n ai = int(input())\n a.append(ai)\na.append(n+1)]\n\ndef factorial(x):\n if x == 0:\n return 1\n else:\n return x * factorial(x-1)\n\ndef C(x,y):\n return factorial(x)//(factorial(x-y)*factorial(y))\n\ndef f(x):\n if x == 0:\n r... | ['Runtime Error', 'Accepted'] | ['s896907453', 's754849264'] | [2940.0, 7848.0] | [17.0, 204.0] | [584, 243] |
p03013 | u908481359 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\n\ndef fib(n):\n if n == 0:\n return 0\n else:\n a0 = 0\n a1 = 1\n for i in range(n-1):\n b = a1\n a1 += a0\n a0 = b\n return a1\n\ncount = 1\nb = 0\nfor i in range(m):\n a = int(input())\n if a == 1:\n ... | ['Runtime Error', 'Accepted'] | ['s086659622', 's055182725'] | [3064.0, 462708.0] | [150.0, 640.0] | [555, 305] |
p03013 | u908763441 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['\n\nD = 1000000007\nn, m = map(int, input().split())\na = [0] * (10**5 + 1)\nfor i in range(m):\n a[int(input())] += 1\n\n\ns0 = 1\nif (a[1] == 1):\n s1 = 0\nelse:\n s1 = 1\n\n\ndef calc(n):\n if (n == 0):\n return s0\n elif (n == 1):\n return s1\n elif(a[n] == 1):\n return 0\n ... | ['Runtime Error', 'Accepted'] | ['s879663968', 's627198853'] | [3064.0, 92828.0] | [17.0, 296.0] | [408, 581] |
p03013 | u910632349 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\na=set([int(input()) for j in range(m)])\ndp=[0]*(n+1)\ndp[0]=1\nif not a[0]==1:\n dp[1]=1\nelse:\n dp[1]=0\nfor i in range(n-1):\n if i+2 in a:\n dp[i+2]=0\n else:\n dp[i+2]=(dp[i+1]+dp[i])%(10**9+7)\nprint(dp[n])', 'n,m=map(int,input().split())\na=set([int(inpu... | ['Runtime Error', 'Accepted'] | ['s166563831', 's563779284'] | [18904.0, 18904.0] | [141.0, 161.0] | [256, 255] |
p03013 | u911153222 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["def typical_stairs():\n n, m, dangerous = map(int, open(0).read().split())\n dangerous = set(dangerous)\n mod = 1000000007\n dp = [0] * (n + 1)\n dp[0] = 1\n if 1 not in dangerous:\n dp[1] = 1\n for i in range(2, n + 1):\n if i not in dangerous:\n dp[i] = (dp[i - 2] + dp[... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s396615237', 's455003174', 's627527856', 's774157765', 's793129640', 's876509468', 's887623576', 's437045608'] | [10548.0, 10428.0, 460020.0, 13940.0, 3064.0, 469632.0, 460020.0, 14180.0] | [25.0, 25.0, 465.0, 43.0, 18.0, 442.0, 475.0, 52.0] | [390, 388, 393, 392, 415, 383, 394, 391] |
p03013 | u911575040 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\nd=[1]*(n+1)\nfor i in range(m):\n d[int(input())]=0\nfor i in range(n+1):\n if i >1:\n d[i]=(d[i-1]+d[i-2]%(10**9+7))*d[i]\nprint(d[n+1])', 'n,m=map(int,input().split())\nd=[1]*(n+1)\nfor i in range(m):\n d[int(input())]=0\nfor i in range(n+1):\n if i >1:\n d[i]... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s032378941', 's464354047', 's031297859'] | [7668.0, 6964.0, 6976.0] | [211.0, 216.0, 213.0] | [173, 173, 188] |
p03013 | u918009437 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["def calc_pattern(stair_num, damaged_step_list, state_number):\n if stair_num == 1:\n return 1\n if stair_num == 3 and damaged_step_list==[1]:\n return 1\n \n \nif __name__ == '__main__':\n N, M = map(int, input().split())\n a = [int(input()) for _ in range(M)]\n a = sorted(a)\n\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s584656054', 's860678996', 's483482581'] | [7848.0, 17964.0, 18804.0] | [2104.0, 209.0, 182.0] | [672, 1511, 591] |
p03013 | u921773161 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N_M = list(map(int, input().split()))\nN = N_M[0]\nM = N_M[1]\ndis = []\nfor _ in range(M):\n dis.append(input())\n\ndp = [0 for i in range(N+2)]\ndp[0] = 1\nif 1 in dis:\n dp[1] = 0\nelse :\n dp[1] = 1\n\nfor i in range(N):\n if i+2 in dis:\n dp[i+2]=0 \n else:\n if i in dis and i+1 in d... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s222363842', 's237856531', 's522022066', 's954378659', 's522107902'] | [10284.0, 3864.0, 10284.0, 460056.0, 7668.0] | [2104.0, 21.0, 2104.0, 2108.0, 1695.0] | [573, 428, 473, 429, 689] |
p03013 | u922449550 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\n\nA = []\nfor i in range(M):\n A.append(int(input()))\n\nA.sort()\nida = 0\na = A[ida]\nmod = 10**9 + 7\n\nx = [1] + [0]*N\nif a == 1:\n ida += 1\n if M >= 2:\n a = A[ida]\n else:\n x[1] = 1\n\nfor i in range(2, N+1):\n if i == a:\n ida += 1\n if ida >= M:\n a =... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s228067387', 's701936498', 's797788287'] | [8616.0, 7780.0, 7652.0] | [215.0, 205.0, 194.0] | [398, 518, 282] |
p03013 | u924467864 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\n\n# a = set()\n\n# a_tmp = int(input())\n# a.add(a_tmp)\n\na = [1 for i in range(m)]\n\ndp = [0] * (n + 1)\nfor i in range(n + 1):\n if i in a:\n dp[i] = 0\n else:\n if i == 0:\n dp[i] = 1\n elif i == 1:\n dp[i] = 1\n el... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s304497540', 's357976971', 's586640998', 's883324431', 's938134315', 's116016706'] | [7028.0, 11884.0, 6900.0, 3828.0, 3828.0, 11884.0] | [2104.0, 178.0, 65.0, 19.0, 18.0, 192.0] | [394, 378, 375, 422, 383, 404] |
p03013 | u927534107 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\ns=[]\nfor i in range(m):\n s.append(int(input()))\nl=[1]\nif s[0]!= 1:l.append(1)\nelse:l.append(0)\nfor i in range(2,n+1):\n if i in s:num=0\n else:num = (l[i-2]+l[i-1])%1000000007\n l.append(num)\nprint(l)', 'n,m = map(int,input().split())\ns=set([int(input()) for i in rang... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s307080611', 's332352544', 's854694566'] | [7064.0, 13216.0, 13192.0] | [2104.0, 180.0, 192.0] | [238, 272, 268] |
p03013 | u931118906 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\na=[]\nfor i in range(m):\n a.append(int(input()))\nres=1\ncount=0\nfor i in range(n):\n if i+1 in a and i+2 in a:\n res=0\n break\n else:\n if i not in a:\n if i<n-1:\n if i+1 not in a:\n count+=1\n ... | ['Wrong Answer', 'Accepted'] | ['s881552004', 's720480478'] | [7056.0, 460020.0] | [2104.0, 472.0] | [464, 378] |
p03013 | u931489673 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import math\ndef calc_pattern(stairs):\n if stairs<=4:\n return stairs\n d=stairs//2+1\n l=[(math.factorial(i+(stairs-i*2))/math.factorial(i)/math.factorial(stairs-i*2))%1000000007 for i in range(d)]\n return (sum(l))%1000000007\nN,M=map(int,input().split())\nA=[-1]\nA.extend([int(input()) for m i... | ['Runtime Error', 'Accepted'] | ['s460500489', 's233963344'] | [3064.0, 7848.0] | [17.0, 206.0] | [549, 172] |
p03013 | u932868243 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\na=list(map(int,input().split()))\nfib=[0,1]\nfor i in range(n):\n fib.append(fib[i]+fib[i+1])\nb=[]\nfor j in range(m):\n b.append(fib[a[m]-1])\nans=0\nfor t in range(m-1):\n ans+=(b[t]*b[t+1])%(10**9+1)\nprint(ans%(10**9+1))', 'n,m=map(int,input().split())\na=[int(input()) for i in r... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s361980546', 's794558927', 's943282389', 's131210038'] | [460020.0, 7824.0, 460020.0, 11884.0] | [467.0, 161.0, 454.0, 202.0] | [247, 214, 247, 229] |
p03013 | u933341648 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = map(int, input().split())\na = [-1] + [int(input()) for i in range(m)] + [n+1]\n\nres = 1\nfor i in range(1, len(a)):\n steps = a[i] - a[i-1] - 2\n if steps < 0:\n patern_nmu = 0\n elif steps <= 1:\n patern_nmu = 1\n else:\n p, q = 1, 0\n for j in range(steps-1):\n ... | ['Wrong Answer', 'Accepted'] | ['s652881877', 's292243102'] | [7884.0, 7824.0] | [208.0, 200.0] | [404, 357] |
p03013 | u933622697 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\n\nif M == 0:\n alist = set()\nelse:\n alist = set(map(int, input()) for _ in range(M))\n\ndp = [0] * (N + 1)\ndp[0] = 1\ndp[1] = 1 if 1 not in alist else 0\n\nMOD = 10**9 + 7\nfor i in range(2, N + 1):\n if i in alist:\n continue\n dp[i] = (dp[i - 1] + dp[i - 2]) %... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s014707931', 's482185037', 's736415797'] | [33256.0, 22120.0, 11884.0] | [295.0, 128.0, 169.0] | [322, 336, 292] |
p03013 | u933722792 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n, m = list(map(int, input().split()))\naaa = list(int(input()) for i in range(m))\n\ndp = [0] * (n + 1)\ndp[0] = 1\ndp[1] = 1 if 1 not in aaa else 0\nMOD = 10 ** 9 + 7\n\nfor i in range(2, n + 1):\n if i in aaa:\n continue\n dp[i] = (dp[i - 2] + dp[i - 1]) % MOD\n', 'n, m = list(map(int, input().split(... | ['Wrong Answer', 'Accepted'] | ['s693113307', 's037599361'] | [13664.0, 13536.0] | [2206.0, 149.0] | [267, 317] |
p03013 | u934099192 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['\nN, M = map(int, input().split())\n\ns = [0] * (N+1)\n\nfor i in range(M):\n ai = int(input())\n s[ai] = -1\n\nprint(s)\n\ns[0] = 1\n\nif N == 1:\n print(1)\nelse:\n if s[1] == 0:\n s[1] = 1\n\n for i in range(2,N+1):\n if s[i] >= 0:\n s[i] += (max(0,s[i-1]) + max(0,s[i-2]))\n... | ['Runtime Error', 'Accepted'] | ['s903206425', 's036957574'] | [134720.0, 462708.0] | [2107.0, 711.0] | [342, 314] |
p03013 | u934868410 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m = map(int, input())\na = set()\nfor i in range(m):\n a.add(int(input()))\n \nb = [0]* (n+1)\nb[0] = 1\nif 1 not in a:\n b[1] = 1\nfor i in range(2, n+1):\n if i in a:\n b[i] = 0\n else:\n b[i] = b[i-1] + b[i-2]\nprint(b[n] % 1000000007)', 'n,m = map(int, input())\na = set()\nfor i in range(m):\n a.add... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s390482815', 's446508526', 's704566686'] | [3064.0, 3064.0, 460020.0] | [17.0, 17.0, 465.0] | [237, 237, 269] |
p03013 | u936985471 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\nbroken=[False]*(n+1)\nfor i in range(m):\n broken[int(input())]=True\ndp=[0]*(n+1)\ndp[0]=1\ndp[1]=1 if 1 not in broken else 0\n\nfor i in range(2,len(dp)):\n if broken[i]:\n dp[i]=0\n else:\n dp[i]=(dp[i-2]+dp[i-1])%1000000007\n \nprint(dp[-1])\n', 'n,m=map(int,input().split()... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s307403211', 's824849466', 's970058313'] | [7668.0, 6900.0, 19020.0] | [180.0, 184.0, 68.0] | [272, 304, 330] |
p03013 | u938486382 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["n, m = list(map(int, input().split(' ')))\naaa = [0] * (n + 3)\nfor i in range(m):\n aaa[int(input())] = True\n\ndp = [1] * (n + 3)\nfor i in range(1, n+1): # 1e5\n if not aaa[i]:\n dp[i] = dp[i-1]\n dp[i] += dp[i-2]\n dp[i] = dp[i] % int(1e9 + 7)\n else:\n dp[i] = 0\nprint(dp[n... | ['Wrong Answer', 'Accepted'] | ['s592876401', 's247710325'] | [7668.0, 7668.0] | [187.0, 180.0] | [307, 330] |
p03013 | u941434715 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['#coding: utf-8\nimport math\nimport heapq\nimport bisect\n#from scipy.misc import comb\n\nMOD = 10**9+7\n\nN = int(input())\nX,Y = map(int, input().split())\n\n\nL = list(map(int, input().split()))\n\n\nA = []\nfor i in range(N):\n a = tuple(map(int, input().split()))\n A.append(a)', '#coding: utf-8\nimport mat... | ['Runtime Error', 'Accepted'] | ['s617287300', 's356768695'] | [3188.0, 8652.0] | [19.0, 196.0] | [394, 437] |
p03013 | u941438707 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\na=[int(input()) for i in range(m)]\na.insert(0,0)\na.append(n)\nb=[a[i+1]-a[i] for i in range(m+1)]\nans=1\nz=[1,2]\nfor i in range(10**5):\n z.append(z[i]+z[i+1])\nfor i in b:\n if i!=0:\n ans =ans*z[i-1]\n if i==0:\n ans=0\nprint(ans%1000000007) ', 'n,m=map(int,... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s249189147', 's551534174', 's875876503', 's028998374'] | [464816.0, 464808.0, 3064.0, 460788.0] | [600.0, 612.0, 18.0, 483.0] | [288, 243, 371, 205] |
p03013 | u944643608 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\na = [int(input()) for _ in range(M)]\ndef fibo(i):\n c, b = 1, 0\n while i > 0:\n c, b = c + b, c\n i -= 1\n return c\nm = a[0] + 1\nnum = fibo(m - 2)\nif M > 1 :\n for i in range(M - 1):\n m = a[i + 1] - a[i]\n if m > 1:\n num = num * fibo(m - ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s073823587', 's079749271', 's292015470', 's898602708', 's349440708'] | [2940.0, 2940.0, 7004.0, 2940.0, 460020.0] | [17.0, 17.0, 165.0, 18.0, 465.0] | [487, 524, 542, 519, 430] |
p03013 | u948524308 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N,M=map(int,input().split())\n\nchk=[True]*(10**5+1)\nfor i in range(M):\n a=int(input())\n chk[a]=False\n\nmod=10**9+7\n\nif N==1:\n print(1)\n exit()\n\nf=[0]*(N+1)\n\nif chk[1]:\n f[1]=1\nelse:\n f[1]=0\n\n\nfor i in range(2,N+1):\n if chk[i-2]:\n f[i]+=f[i-2]\n if chk[i-1]:\n ... | ['Wrong Answer', 'Accepted'] | ['s698731442', 's622885603'] | [7764.0, 7848.0] | [199.0, 181.0] | [337, 407] |
p03013 | u951480280 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\nA=[int(input()) for _ in range(m)]\nL=[0]*(n+1)\nL[0]=1\nif 1 in A:L[1]=0\nfor i in range(2,n+1):\n if i in A:\n L[i]=0\n else:\n L[i]=L[i-2]+L[i-1]\nprint(L[n]%(10**9 + 7))', 'from collections import deque\n\nn,m=map(int,input().split())\nA={int(input()) for _ in ran... | ['Wrong Answer', 'Accepted'] | ['s130583635', 's736268111'] | [460020.0, 460364.0] | [2120.0, 391.0] | [213, 251] |
p03013 | u965602776 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['n,m=map(int,input().split())\na=[int(input()) for _ in range(m)]\nf=[1]\nfor i in range(1,n+1):\n if i in a:f.append(0)\n else:f.append(f[i-1]+f[i-2])\nprint(1 if n==1 else f[-1]%1000000007)', 'n,m=map(int,input().split())\na=set([int(input()) for _ in range(m)])\np,q=0,1\nfor i in range(1,n+1):\n p,q=q,(p+q... | ['Wrong Answer', 'Accepted'] | ['s360729470', 's109285490'] | [460020.0, 13192.0] | [2119.0, 194.0] | [190, 147] |
p03013 | u967594789 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\n#from scipy.special import comb\nfrom scipy.misc import comb\n\nN,M = list(map(int, input().split()))\n\nA = [0]*M\n\nfor i in range(M):\n A[i] = int(input())\n\nA.append(N+1)\n\ntotal_combo = 1\nNOW = 0\nfor a in A:\n if NOW == a:\n print(0)\n sys.exit()\n L = a-1-NOW\n combo = ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Time Limit Exceeded', 'Accepted'] | ['s094213665', 's516711577', 's590090920', 's594775104', 's942681793', 's906429368'] | [17104.0, 17100.0, 17084.0, 17076.0, 16988.0, 463988.0] | [2108.0, 2109.0, 2108.0, 2104.0, 2108.0, 581.0] | [509, 543, 456, 509, 557, 729] |
p03013 | u968846084 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N,M=map(int,input().split())\nL=[0]*M\nR=[0]*M\nfor i in range(M):\n L[i],R[i]=map(int,input().split())\ndef quick_sort(arr):\n left = []\n right = []\n if len(arr) <= 1:\n return arr\n\n \n # ref = random.choice(arr)\n ref = arr[0]\n ref_count = 0\n\n for ele in arr:\n if ele... | ['Runtime Error', 'Accepted'] | ['s382026200', 's667701660'] | [4596.0, 7668.0] | [20.0, 220.0] | [719, 191] |
p03013 | u969708690 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\ninput = sys.stdin.readline\nimport math\ndef fibnatch(n):\n if n==0:\n return 1\n a=(pow(((1+math.sqrt(5))/2),n)-pow(((1-math.sqrt(5))/2),n))/math.sqrt(5)\n c=int(a)\n if n==1:\n return 1\n elif abs(c-a)>=abs(c-a+1):\n return (c+1)%1000000007\n else:\n return c%1000000007\nL=list()\nN,M=... | ['Runtime Error', 'Accepted'] | ['s929521652', 's186341377'] | [4776.0, 20028.0] | [136.0, 196.0] | [560, 284] |
p03013 | u970308980 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N, M = map(int, input().split())\nMOD = 1000000007\n\nbroken = [0] * N\nfor i in range(M):\n broken[int(input())-1] = 1\n\n\ndp = [0] * (N + 1)\ndp[N-1] = dp[N] = 1\nfor i in reversed(range(N-1)):\n if broken[i]:\n dp[i] = 0\n continue\n dp[i] = dp[i+1] + dp[i+2]\n\nprint(dp[0] % MOD)\n', 'MOD ... | ['Wrong Answer', 'Accepted'] | ['s737603510', 's840951310'] | [460788.0, 11884.0] | [380.0, 173.0] | [293, 264] |
p03013 | u977193988 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import sys\nn,m=map(int,input().split())\na=[int(input()) for i in range(m)]\ns=n-len(a)*2\nS=[1,2]\nfor i in range(s):\n S.append((S[-1]+S[-2])%1000000007)\nprint(S)\nstep=[]\na=[0]+a+[n]\nfor i in range(len(a)-1):\n if i==0 and a[1]==1:\n step.append(1)\n elif i==0:\n step.append(S[a[i+1]-a[i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s207554494', 's521837233', 's732060751', 's656304080'] | [10280.0, 8856.0, 8620.0, 13192.0] | [173.0, 1246.0, 1247.0, 192.0] | [618, 495, 496, 226] |
p03013 | u981040490 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["# -*- coding: utf-8 -*-\ndef main():\n N,M = map(int,input().split())\n A = [int(input()) for i in range(M)]\n MOD = 1000000007\n ans = []\n ans.append(0) if 1 in A else ans.append(1)\n ans.append(0) if 2 in A else ans.append(1)\n for i in range(2,N):\n ans.append(0)\n if i+1 in A:\... | ['Wrong Answer', 'Accepted'] | ['s867190323', 's318916932'] | [462708.0, 462708.0] | [2118.0, 578.0] | [432, 389] |
p03013 | u981931040 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N , M = map(int ,input().split())\nmod = 10 ** 9 + 7\nA = []\nfor i in range(M):\n A.append(int(input()))\n if A[i] - 1 == A[i - 1] and i > 0:\n print("0")\n exit()\ndp = [0] * (N + 1)\ndp[0] = 1\nidx = 0\ncrash = A[idx]\nfor i in range(1 , N + 1):\n if i == crash:\n idx += 1\n cr... | ['Runtime Error', 'Accepted'] | ['s372485909', 's016246879'] | [7376.0, 7372.0] | [137.0, 145.0] | [479, 518] |
p03013 | u985963315 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['Num = 10 ** 9 + 7\nN, M = map(int, input().split())\nif M != 0\n danger = int(input())\ncount = 1\nl = [1, 1]\nfor i in range(1, N):\n if i == danger:\n l[1] = 0\n if count < M:\n danger = int(input())\n count += 1\n l = [l[1] % Num, l[0] + l[1]]\n if l == [0, 0]:\n break\nif N == danger:\n l[... | ['Runtime Error', 'Accepted'] | ['s486381096', 's145227829'] | [2940.0, 3188.0] | [17.0, 161.0] | [326, 339] |
p03013 | u987164499 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['from sys import stdin\nfrom itertools import accumulate\n\na,b = [int(x) for x in stdin.readline().rstrip().split()]\nli = [int(stdin.readline().rstrip()) for _ in range(b)]\n\nif a == 1:\n print(1)\n exit()\n\nelif a == 2:\n if b == 0:\n print(2)\n exit()\n else:\n print(1) \n ... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s123962661', 's489563067', 's662240990', 's741249121', 's604992800'] | [7104.0, 460148.0, 7104.0, 8976.0, 7076.0] | [80.0, 353.0, 76.0, 149.0, 165.0] | [824, 880, 823, 445, 446] |
p03013 | u989345508 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['import math\ndef combinations_count(n, r):\n return math.factorial(n) // (math.factorial(n - r)*math.factorial(r))\n\nn,m=map(int(i) ,input().split())\na1=[int(input()) for i in range(m)]\na1.append(n+1)\nc1=1\na2=0\nfor i in a1:\n a3=i-1-a2\n c2=0\n for j in range(a3//2+1):\n c2+=combinations_coun... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s442471658', 's492035216', 's841090191'] | [3064.0, 7080.0, 7852.0] | [17.0, 2104.0, 210.0] | [395, 386, 444] |
p03013 | u993435350 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['N,M = map(int, input().split())\nA = [int(input()) for a in range(M)]\nA = set(A)\n\t\nDP = [0] * (N + 1)\t\nDP[0] = 1\n\nmod = (10 ** 9) + 7\n\nfor i in range(1,N+1):\n\tif i in A:\n\t\tDP[i] = 0\n\telse:\n\t\tDP[i] = DP[i-1] + DP[i-2]\n\nprint(DP[n] % (mod))', 'N,M = map(int,input().split())\nA = [int(input()) for ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s056288545', 's409209689', 's876036090', 's121378017'] | [460020.0, 3064.0, 2940.0, 460020.0] | [458.0, 18.0, 23.0, 447.0] | [237, 298, 298, 237] |
p03013 | u993461026 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['from scipy.misc import comb as combination\n\nN,M = map(int, input().split())\na = [int(input()) for _ in range(M)]\na.append(N+1)\n\nif M != 1:\n for i in range(M-1):\n if a[i+1] - a[i] == 1:\n print(0)\n exit()\n\nroute = []\nbegin = 0\nfor i in range(M+1):\n stair = a[i]-1\n space = stair - begin\n... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s636263013', 's646365279', 's702165030', 's968809830'] | [17432.0, 7080.0, 22384.0, 13216.0] | [2109.0, 165.0, 2109.0, 184.0] | [613, 213, 523, 222] |
p03013 | u993587645 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['def fb(num):\n \n a, b = 1, 0\n for _ in range(num):\n a, b = a + b, a\n return b\n\nimport functools\nimport operator\n\nimport sys\nn, m = map(int, input().split())\na = sorted(list(set(map(int, sys.stdin.readlines()))))\nm = len(a)\n\ns = 0\ne = n\nxs = [0] * (m + 1)\nfor i, j in enumerate(a):\n... | ['Wrong Answer', 'Accepted'] | ['s958726467', 's904064569'] | [18876.0, 18872.0] | [155.0, 155.0] | [510, 510] |
p03013 | u997641430 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ['mod=1000000007\nN,M=map(int,input().split())\nA=[]\nfor m in range(M):\n A.append(int(input()))\n\ndef check(A):\n for m in range(M-1):\n if A[m+1]-A[m]==1:\n return False\n return True\n\ndef fibo(n):\n if n==0 or n==1:\n return 1\n else:\n L=[1,1]\n for i in ran... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s081538806', 's745962187', 's055030681'] | [7052.0, 7076.0, 7832.0] | [321.0, 326.0, 199.0] | [592, 599, 268] |
p03013 | u998733244 | 2,000 | 1,048,576 | There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step. He can climb up one or two steps at a time. However, the treads of the a_1-th, a_2-th, a_3-th, \ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps. How many are there to climb ... | ["N, M = map(int, input().split())\n\nA = [int(input()) for i in range(M)]\n\nfor i in range(1, len(A)):\n if A[i]-A[i-1]==1:\n print(0)\n exit()\n\nans = 0\n\nm = []\nnow = 0\nrlt = 0\nfor a in A:\n n = a-now\n if n==1 or n==2: s = 1\n else: s = int((float(1)/2)*(pow(n-2,2)-n+2+4))\n\n m.a... | ['Wrong Answer', 'Accepted'] | ['s451386433', 's448262679'] | [7080.0, 6900.0] | [169.0, 188.0] | [505, 276] |
p03014 | u010090035 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['h,w=map(int,input().split())\ns=[]\nfor i in range(h):\n s.append(list(input()))\n\ntate=[[-1 for _ in range(w)] for _ in range(h)]\nyoko=[[-1 for _ in range(w)] for _ in range(h)]\n\ndef search(i,j):\n ansij=1\n\n if(yoko[i][j] == -1):\n xl=j\n while(0<xl and s[i][xl-1]==\'.\'):\n a... | ['Wrong Answer', 'Accepted'] | ['s556351513', 's978785129'] | [233460.0, 252284.0] | [2118.0, 1373.0] | [1198, 704] |
p03014 | u027406156 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import numpy as np\n\nh,w=map(int,input().split())\ns=[input() for i in range(h)]\n\nl=[[0 for i in range(w)] for j in range(h)]\nr=[[0 for i in range(w)] for j in range(h)]\nd=[[0 for i in range(w)] for j in range(h)]\nu=[[0 for i in range(w)] for j in range(h)]\n\nfor i in range(h):\n for j in range(w):\n ... | ['Runtime Error', 'Accepted'] | ['s625129119', 's001549802'] | [3064.0, 266488.0] | [17.0, 909.0] | [1142, 739] |
p03014 | u062459048 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import numpy as np\nH,W = mmap(int, input().split())\nS = [[] for i in range(H)]\nfor i in range(H):\n S[i] = list(input())\nS = np.array(S)\nS = np.where(S=="#",0,1)\n\nl = np.zeros((H,W))\nl[:,-1] = S[:,-1]\nr = np.zeros((H,W))\nr[:,0] = S[:,0]\nu = np.zeros((H,W))\nu[-1] = S[-1]\nd = np.zeros((H,W))\nd[0] = S[0]\... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s460208034', 's734754157', 's614761077'] | [12428.0, 12464.0, 231168.0] | [149.0, 159.0, 891.0] | [543, 546, 542] |
p03014 | u067729694 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["H, W = map(int, input().split())\n\nS = []\nfor _ in range(H):\n tmp = list(input())\n S.append(tmp)\n \nimport numpy as np\n\ndef count_light(Gs, h, w):\n Gc = np.empty((h,w))\n for i, gs in enumerate(Gs):\n count = 0\n for j, s in enumerate(gs):\n if s == '#':\n ... | ['Runtime Error', 'Accepted'] | ['s758387802', 's981924643'] | [81692.0, 238880.0] | [2111.0, 1007.0] | [792, 696] |
p03014 | u102367647 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['#ABC129D-Lamp.py\n\n#import list\nfrom sys import stdin, setrecursionlimit\nfrom functools import lru_cache\nimport numpy as np\n\ninput = stdin.readline\nsetrecursionlimit(1000)\n\n#constant\nH, W = list(map(int,input().split()))\nS = [input() for _ in range(H)]\n\n#variable\n\n#function\n#@lru_cache(maxsize=None)\n... | ['Wrong Answer', 'Accepted'] | ['s521064507', 's354926322'] | [49344.0, 110196.0] | [2113.0, 441.0] | [1642, 857] |
p03014 | u102461423 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import numpy as np', "import numpy as np\nimport sys\nbuf = sys.stdin.buffer\n\nH,W = map(int,buf.readline().split())\n\ngrid = np.zeros((H+2,W+2),dtype=np.bool)\ngrid[1:-1,1:] = (np.frombuffer(buf.read(H*(W+1))+b'\\n',dtype='S1') == b'.').reshape((H,W+1))\n\n\ndef F(transpose):\n x = grid\n if transpose:\n x = ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s084482965', 's187033920', 's275400727', 's383598808', 's456740358', 's615529912', 's640585099', 's819116276', 's841778929', 's866254887', 's931582511', 's187669849'] | [12428.0, 20292.0, 24248.0, 159156.0, 186472.0, 63356.0, 20276.0, 63356.0, 20276.0, 63356.0, 216308.0, 47596.0] | [148.0, 195.0, 321.0, 748.0, 1071.0, 527.0, 194.0, 478.0, 196.0, 565.0, 925.0, 488.0] | [18, 868, 1056, 802, 713, 183, 267, 174, 267, 209, 789, 666] |
p03014 | u144913062 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["H, W = map(int, input().split())\ngrid = [input() for i in range(H)]\ncount = [[[0, 0] for j in range(W)] for i in range(H)]\nfor i in range(H):\n row = '#' + grid[i] + '#'\n left = 0\n while True:\n right = row.find('\n if right == -1:\n break\n for j in range(left, right-1):... | ['Time Limit Exceeded', 'Accepted'] | ['s995174448', 's524742760'] | [433396.0, 219804.0] | [2131.0, 869.0] | [765, 549] |
p03014 | u185948224 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["import numpy as np\n\nH, W = map(int, input().split())\n\nmaze_x = [input() for _ in range(H)]\nmaze_y = [''.join(x) for x in zip(*maze_x)]\n\ndef count_light(maze, W, H):\n cnt = [[0]*W for _ in range(H)]\n for hh in range(H):\n lst1 = [i for i in maze[hh].split('\n lst2 = [i for i in maze[hh].sp... | ['Wrong Answer', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s007014895', 's062588296', 's234692632', 's285461883', 's327300253', 's620526944', 's664190913', 's672488311', 's839230324'] | [115084.0, 115084.0, 80060.0, 9460.0, 115092.0, 115052.0, 115012.0, 211904.0, 153512.0] | [2111.0, 2112.0, 2109.0, 2104.0, 2111.0, 2112.0, 2111.0, 2120.0, 1880.0] | [882, 681, 1319, 668, 714, 851, 933, 735, 812] |
p03014 | u194894739 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["import sys\ninput = sys.stdin.readline\nimport numpy as np\n\nH, W = map(int, input().split())\nS = np.array([list(input()) for _ in range(H)]) == '.'\nups = np.zeros((H,W), dtype=int)\ndowns = np.zeros((H,W), dtype=int)\nlefts = np.zeros((H,W), dtype=int)\nrights = np.zeros((H,W), dtype=int)\n\nfor h in range(H):\n ... | ['Runtime Error', 'Accepted'] | ['s632752358', 's182252105'] | [64744.0, 219816.0] | [559.0, 900.0] | [559, 572] |
p03014 | u196697332 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["import numpy as np\n\nH, W = map(int, input().split())\nS = np.array([list(input() for _ in range(H))]) == '.'\n\nD = np.zeros((H, W), dtype=int)\nU = np.zeros((H, W), dtype=int)\nL = np.zeros((H, W), dtype=int)\nR = np.zeros((H, W), dtype=int)\n\nfor h in range(H):\n U[h] = (U[h - 1] + 1) * S[h]\n D[-h - 1] = ... | ['Runtime Error', 'Accepted'] | ['s127382821', 's383559806'] | [47972.0, 219796.0] | [176.0, 882.0] | [480, 472] |
p03014 | u201802797 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["# solution\n\nimport numpy as np\nn,m = map(int,input().split())\nar = np.array([list(input()) for _ in range(h)]) == '.'\nl = np.zeros((n,m),dtype=int)\nr = np.zeros((n,m),dtype=int)\nu = np.zeros((n,m),dtype=int)\nd = np.zeros((n,m),dtype=int)\n\nfor i in range(n):\n u[i] = (u[i-1]+1)*ar[i]\n d[-i-1] = (d[-i]+1)*... | ['Runtime Error', 'Accepted'] | ['s600810786', 's337555874'] | [12464.0, 219796.0] | [150.0, 864.0] | [430, 477] |
p03014 | u219197917 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import sys\nimport numpy as np\n\n\ndef read():\n return sys.stdin.readline().rstrip()\n\n\ndef main():\n h, w = map(int, read().split())\n s = np.array([[i == "." for i in read()] for _ in range(h)], dtype=int)\n left = s.copy()\n right = s.copy\n up = s.copy\n down = s.copy\n for i in range(... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s597192185', 's682222748', 's430080118'] | [103720.0, 105332.0, 228924.0] | [479.0, 2110.0, 829.0] | [644, 1012, 586] |
p03014 | u298297089 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["import numpy as np\nimport sys\n\nH, W = list(map(int, sys.stdin.readline().split()))\nS = np.array([list(sys.stdin.readline().rstrip()) for _ in range(H)]) == '.'\nups = np.zeros((H, W), dtype=int)\ndowns = np.zeros((H, W), dtype=int)\nrights = np.zeros((H, W), dtype=int)\nlefts = np.zeros((H, W), dtype=int)\n\nfor ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s306308926', 's684043363', 's696887382'] | [65252.0, 157296.0, 219816.0] | [715.0, 817.0, 879.0] | [622, 506, 614] |
p03014 | u314050667 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nimport numpy as np\n\nH,W = map(int, readline().split())\ngrid = np.frombuffer(read(), 'S1').reshape(H,-1)[:,:W]\n\nprint(grid)\n\n\nX,Y = np.where(grid == b'#')\n\nA = np.ones((H,W), np.int32)\nB... | ['Wrong Answer', 'Accepted'] | ['s192995579', 's567392046'] | [129588.0, 129556.0] | [775.0, 800.0] | [667, 653] |
p03014 | u340781749 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["import sys\nfrom itertools import accumulate\n\nimport numpy as np\n\nh, w = list(map(int, input().split()))\nfield = [[int(c == '.') for c in line.rstrip()] for line in sys.stdin]\nfunc = lambda x, a: (x + a) * a\nans = np.zeros([h, w], dtype=np.int)\n\nfor i, row in enumerate(field):\n ans[i] += list(accumulate(... | ['Time Limit Exceeded', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s379319748', 's853251268', 's933718365', 's144723673'] | [73316.0, 75920.0, 75992.0, 121972.0] | [2113.0, 2109.0, 2109.0, 963.0] | [619, 777, 603, 537] |
p03014 | u346851130 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nimport numpy\n\n\ndef main():\n r, c = map(int, input().split())\n g = [input().strip() for _ in range(r)]\n v = numpy.zeros((2, r, c), dtype=numpy.int)\n\n for y in range(r):\n s = 0\n for x in range(c):\n if g[y][x] == '#':\n v[0, y, s:x] = x - s... | ['Wrong Answer', 'Runtime Error', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s352571009', 's445874835', 's486745619', 's677131165', 's693559139'] | [110456.0, 78012.0, 75960.0, 138344.0, 129168.0] | [2109.0, 674.0, 2112.0, 2110.0, 1599.0] | [585, 668, 583, 613, 653] |
p03014 | u347640436 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["def main():\n _max = max\n h, w = map(int, input().split())\n s = [input() + '#' for _ in range(h)]\n s.append('#' * (w + 1))\n\n rt = [[-1] * w for _ in range(h)]\n\n tstart = [-1] * (w + 1)\n for i in range(h + 1):\n si = s[i]\n rti = rt[i]\n ystart = -1\n for j in range(w + 1):\n if si[j] =... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s027745063', 's118849125', 's244701724', 's294773136', 's677681928', 's154411306'] | [165844.0, 3064.0, 38900.0, 165876.0, 165876.0, 40820.0] | [1913.0, 17.0, 115.0, 1198.0, 2037.0, 1402.0] | [752, 759, 968, 858, 735, 1344] |
p03014 | u349091349 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import numpy as np\n \ndef convert(L):\n dp = np.zeros((L.shape[0],L.shape[1]), dtype=\'int\')\n for i in range(L.shape[0]):\n l=L[i]\n for j in range(L.shape[1]):\n if l[j]:\n if j == 0:\n dp[i][j] = 1\n else:\n dp[i][... | ['Wrong Answer', 'Accepted'] | ['s004013252', 's786775142'] | [46908.0, 141820.0] | [2110.0, 1679.0] | [670, 906] |
p03014 | u379692329 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["import sys\ninput = sys.stdin.readline\n\nH, W = map(int, input().split())\nS = [input() for _ in range(H)]\n \nup = [[0]*(W+2) for _ in range(H+2)]\ndown = [[0]*(W+2) for _ in range(H+2)]\nleft = [[0]*(W+2) for _ in range(H+2)]\nright = [[0]*(W+2) for _ in range(H+2)]\n \nfor i in range(1, H+1):\n for j in r... | ['Wrong Answer', 'Accepted'] | ['s841299266', 's263756723'] | [249488.0, 219860.0] | [2119.0, 901.0] | [712, 498] |
p03014 | u475503988 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["import numpy as np\nH, W = map(int, input().split())\nS = [input() for _ in range(H)]\n\nij = np.zeros([H,W]) \nji = np.zeros([H,W]) \n\nfor i in range(H):\n cnt = 0\n start = 0\n end = 0\n for j in range(W):\n if S[i][j] == '#':\n ij[i, start:end+1] += cnt\n cnt = 0\n ... | ['Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s006596645', 's100860747', 's259248851', 's602791672'] | [70884.0, 45660.0, 47324.0, 219816.0] | [2109.0, 2109.0, 2109.0, 886.0] | [1188, 1111, 1117, 687] |
p03014 | u489559146 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import numpy as np\n\nHeight, Width = map(int,input().split(" "))\n\nlineBlocks = [(input()) for i in range(Height)]\n\ntwoDimMap = []\nfor Block in lineBlocks:\n twoDimMap.append(list(Block))\n \nansList = []\nheightList = np.zeros((Height, Width), dtype=int)\nwidthList = np.zeros((Height, Width), dtype=int)\n\nf... | ['Runtime Error', 'Accepted'] | ['s647587801', 's358120208'] | [175212.0, 219832.0] | [2114.0, 904.0] | [1422, 472] |
p03014 | u507613674 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import sys, math, heapq\nstdin = sys.stdin\nread_int = lambda : list(map(int,stdin.readline().split()))\nread_str = lambda : stdin.readline().rstrip()\n\nH, W = read_int()\ngrid = []\nimport numpy as np\nL = np.zeros((H, W))\nR = np.zeros((H, W))\nU = np.zeros((H, W))\nD = np.zeros((H, W))\nres = np.zeros((H, W))\n# ... | ['Wrong Answer', 'Accepted'] | ['s926587905', 's079370569'] | [93264.0, 298804.0] | [2111.0, 1334.0] | [1939, 2173] |
p03014 | u528482684 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['H, W = [int(i) for i in input().split(" ")]\nS = []\nfor i in range(H):\n S.append(input())\n \nimport numpy as np\n\nr_lens = []\nfor s in S:\n counts = [len(block) for block in s.split("#")]\n \n r_len = []\n for c in counts:\n r_len+=[c]*c\n r_len+=[0]\n r_lens.append(r_len)\nr_lens = np.array(r_lens)... | ['Runtime Error', 'Accepted'] | ['s657867853', 's776952845'] | [105240.0, 248404.0] | [2111.0, 1239.0] | [604, 426] |
p03014 | u551909378 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["H,W = map(int,input().split())\nS = []\nfor i in range(H):\n S += [['#'] + list(input()) + ['#']]\nS = [['\n\nans,v = 0,[0 for i in range(W)]\nfor i in range(1,W+1):\n k = 1\n while S[k][i] == '.':\n k += 1\n v[i-1] = k - 1\n\nfor i in range(1,H+1):\n j,dot = 1,0\n while j < W+1:\n whi... | ['Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s734987603', 's784995215', 's134047702'] | [36596.0, 36596.0, 3064.0] | [2105.0, 2105.0, 1934.0] | [696, 746, 779] |
p03014 | u600402037 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ["import numpy as np\n\nH, W = map(int, input().split())\nS = np.array([list(input()) for _ in range(H)])=='.'\n\nR = np.zeros((H, W), dtype=int)\nL = np.zeros((H, W), dtype=int)\nU = np.zeros((H, W), dtype=int)\nD = np.zeros((H, W), dtype=int)\n\nfor i in range(H):\n U[i] = (U[i-1] + 1) * S[i]\n D[-i-1] = (D[-i]... | ['Runtime Error', 'Accepted'] | ['s022536828', 's588416186'] | [219752.0, 71528.0] | [896.0, 963.0] | [451, 779] |
p03014 | u619819312 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import numpy as np\na=np.array([[0 if i!="." else 1 for i in input()]for j in range(h)])\ns,t,u,p=np.zeros((h,w)),np.zeros((h,w)),np.zeros((h,w)),np.zeros((h,w))\nfor i in range(h):\n s[i]=(s[i-1]+1)*a[i]\n t[-i-1]=(t[-i]+1)*a[-i-1]\nfor i in range(w):\n u[:,j]=(u[:,j-1]+1)*a[:,j]\n p[:,-j-1]=(p[:,-j]+1)*... | ['Runtime Error', 'Time Limit Exceeded', 'Accepted'] | ['s115610362', 's212417786', 's538266919'] | [12452.0, 450932.0, 253884.0] | [150.0, 2138.0, 1062.0] | [344, 723, 378] |
p03014 | u638456847 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['H,W = map(int, input().split())\ns = [input() for j in range(H)]\n\ndef counter(x, y):\n count = 1\n h1 = x - 1\n while h1 >= 0 and s[h1][y] == ".":\n count += 1\n h1 -= 1\n \n h2 = x + 1\n while h2 < H and s[h2][y] == ".":\n count += 1\n h2 += 1\n \n w1 = y -1\n ... | ['Wrong Answer', 'Accepted'] | ['s302063522', 's422487664'] | [27352.0, 266532.0] | [2104.0, 864.0] | [625, 765] |
p03014 | u648212584 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import numpy as np\n\ndef main():\n\tH,W = map(int,input().split())\n\tdis_list1 = []\n\tdis_list2 = []\n\tfor i in range(H):\n\t\tst = input()\n\t\tdis_list1.append([0 if i == "\n\t\tdis_list2.append([0 if i == "\n\tw_list = dis_list1\n\th_list = dis_list2\n\tfor i in range(H):\n\t\tfor j in range(W-1):\n\t\t\tif w_... | ['Time Limit Exceeded', 'Accepted'] | ['s777539680', 's236465046'] | [187560.0, 217524.0] | [2119.0, 925.0] | [919, 725] |
p03014 | u653807637 | 2,000 | 1,048,576 | There is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares. Snuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it. The lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and... | ['import numpy as np\nh, w = list(map(int, input().split()))\nss = np.array([list(input()) for _ in range(h)])\nprint(ss)\n\nans = 0\nws = np.zeros((h, w))\nhs = np.zeros((h, w))\n\ni = 0\nwhile i < h:\n\tj = 0\n\twhile j < w:\n\t\tif ss[i, j] == ".":\n\t\t\tend = w\n\t\t\tfor k in range(j, w):\n\t\t\t\tif ss[i, k] == ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s061292772', 's368445688', 's693321176', 's762004816'] | [94840.0, 91492.0, 186288.0, 219820.0] | [2110.0, 2112.0, 2111.0, 845.0] | [631, 909, 562, 715] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.