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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03062 | u952708174 | 2,000 | 1,048,576 | There are N integers, A_1, A_2, ..., A_N, arranged in a row in this order. You can perform the following operation on this integer sequence any number of times: **Operation** : Choose an integer i satisfying 1 \leq i \leq N-1. Multiply both A_i and A_{i+1} by -1. Let B_1, B_2, ..., B_N be the integer sequence after ... | ["def d_flipping_signs_dp(N, A):\n dp = [[0] * 2 for _ in range(N + 1)]\n dp[0][0] = 0\n dp[0][1] = -float('inf')\n for i in range(N):\n dp[i + 1][0] = max(dp[i][0] + A[i], dp[i][1] - A[i])\n dp[i + 1][1] = max(dp[i][0] - A[i], dp[i][1] + A[i])\n return dp[N][0]\n\nN = int(input())\nA = [in... | ['Runtime Error', 'Accepted'] | ['s661050960', 's068712488'] | [14468.0, 25600.0] | [47.0, 165.0] | [368, 371] |
p03062 | u959651981 | 2,000 | 1,048,576 | There are N integers, A_1, A_2, ..., A_N, arranged in a row in this order. You can perform the following operation on this integer sequence any number of times: **Operation** : Choose an integer i satisfying 1 \leq i \leq N-1. Multiply both A_i and A_{i+1} by -1. Let B_1, B_2, ..., B_N be the integer sequence after ... | ['N = int(input())\nA = list(map(int,input().split()))\nB = list(map(abs,a))\nC = [a for a in A if a < 0]\n\nif len(C) % 2 == 0:\n print((sum(B)))\nelse:\n print((sum(B)-min(B)*2))', 'n = int(input())\na = list(map(int,input().split()))\nb = list(map(abs,a))\nc = list(a for a in A if a < 0)\n\nif len(c) % 2 == 0:... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s031637037', 's490567589', 's582600512', 's381764439'] | [14412.0, 14332.0, 14412.0, 14412.0] | [43.0, 48.0, 42.0, 55.0] | [176, 176, 173, 180] |
p03062 | u960653324 | 2,000 | 1,048,576 | There are N integers, A_1, A_2, ..., A_N, arranged in a row in this order. You can perform the following operation on this integer sequence any number of times: **Operation** : Choose an integer i satisfying 1 \leq i \leq N-1. Multiply both A_i and A_{i+1} by -1. Let B_1, B_2, ..., B_N be the integer sequence after ... | ['N = int(input())\nA = [int(i) for i in input().split()]\n\ncount = 0\n\nfor i in range(N):\n if A[i] <=0:\n count = count + 1\n A[i] = A[i] * -1\n\nif count%2 == 1:\n ans = sum(A)\nelse:\n ans = sum(A) - 2*min(A)\n\nprint(ans)\n', 'N = int(input())\nA = [int(i) for i in input().split()]\n\ncount = 0\nfor i i... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s030325733', 's264416941', 's434360704', 's820975181', 's326767398'] | [14412.0, 14412.0, 142716.0, 14412.0, 14412.0] | [75.0, 78.0, 2104.0, 78.0, 77.0] | [221, 260, 222, 259, 259] |
p03062 | u961674365 | 2,000 | 1,048,576 | There are N integers, A_1, A_2, ..., A_N, arranged in a row in this order. You can perform the following operation on this integer sequence any number of times: **Operation** : Choose an integer i satisfying 1 \leq i \leq N-1. Multiply both A_i and A_{i+1} by -1. Let B_1, B_2, ..., B_N be the integer sequence after ... | ['n=int(input())\na=list(map(int,input().split()))\ncnt=0\nzero=0\nans=0\nmn=1000000001\nfor x in a:\n mn=min(mn,abs(x))\n if x<0:\n cnt+=1\n ans-=x\n else:\n ans+=x\n print(ans)\ncnt%=2\nif cnt==0:\n print(ans)\nelse:\n print(ans-mn*2)\n \n \n \n \n \n#print(ans,cnt,mn)', 'n=int(input())\na=list(ma... | ['Wrong Answer', 'Accepted'] | ['s866890262', 's814207370'] | [14412.0, 14284.0] | [183.0, 90.0] | [265, 266] |
p03062 | u963903527 | 2,000 | 1,048,576 | There are N integers, A_1, A_2, ..., A_N, arranged in a row in this order. You can perform the following operation on this integer sequence any number of times: **Operation** : Choose an integer i satisfying 1 \leq i \leq N-1. Multiply both A_i and A_{i+1} by -1. Let B_1, B_2, ..., B_N be the integer sequence after ... | ['input()\na = list(map(int, input().split()))\ncnt = sum([i < 0 for i in a])\ns = [abs(i) for i in a]\nprint(cnt)\nif cnt % 2 == 0:\n print(sum(s))\nelse:\n print(sum(s) - min(s) * 2)', 'input()\na = list(map(int, input().split()))\ncnt = sum([i < 0 for i in a])\ns = [abs(i) for i in a]\nif cnt % 2 == 0:\n pr... | ['Wrong Answer', 'Accepted'] | ['s407488545', 's399009101'] | [14412.0, 14412.0] | [57.0, 58.0] | [180, 169] |
p03062 | u980492406 | 2,000 | 1,048,576 | There are N integers, A_1, A_2, ..., A_N, arranged in a row in this order. You can perform the following operation on this integer sequence any number of times: **Operation** : Choose an integer i satisfying 1 \leq i \leq N-1. Multiply both A_i and A_{i+1} by -1. Let B_1, B_2, ..., B_N be the integer sequence after ... | ['n = int(input())\nnum = list(map(int,input().split()))\nnumabs = [abs(i) for i in num]\ncnt = 0 \nnegative = [] \nfor i in num :\n if i < 0 :\n cnt += 1\n negtive.append()\n\nif cnt % 2 == 0 :\n print(sum(numabs))\n\nif cnt % 2 == 1 :\n print(sum(numabs)-2*max(negative))', 'n = int(in... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s407136986', 's408109545', 's069013877'] | [14284.0, 15020.0, 14412.0] | [54.0, 52.0, 62.0] | [290, 291, 250] |
p03062 | u985648232 | 2,000 | 1,048,576 | There are N integers, A_1, A_2, ..., A_N, arranged in a row in this order. You can perform the following operation on this integer sequence any number of times: **Operation** : Choose an integer i satisfying 1 \leq i \leq N-1. Multiply both A_i and A_{i+1} by -1. Let B_1, B_2, ..., B_N be the integer sequence after ... | ['\nnum_count = int(input())\n\n\nnums_list = list(map(int, input().split()))\n\n\nconvert_nums = [0] * num_count\n\nmax_num = 0\n\nfor num in nums_list:\n max_num += abs(num)\n\nif num_count % 2 != 0:\n max_num -= min(list(map(abs, nums_list))) * 2\n\nprint(max_num)', '\nnum_count = int(input())\n\n\nnums_list =... | ['Wrong Answer', 'Accepted'] | ['s081949525', 's477990183'] | [14332.0, 14224.0] | [65.0, 77.0] | [326, 391] |
p03062 | u994521204 | 2,000 | 1,048,576 | There are N integers, A_1, A_2, ..., A_N, arranged in a row in this order. You can perform the following operation on this integer sequence any number of times: **Operation** : Choose an integer i satisfying 1 \leq i \leq N-1. Multiply both A_i and A_{i+1} by -1. Let B_1, B_2, ..., B_N be the integer sequence after ... | ['n=int(input())\nA=list(map(int,input().split()))\nB=[0]*n\nfor i in range(n):\n B[i]=abs(A[i])\nB.sort()\nprint(sum(B)-2*B[0])', 'n=int(input())\nA=list(map(int,input().split()))\nB=[0]*n\ncnt=0\nfor i in range(n):\n if A[i]<0:\n cnt+=1\n B[i]=abs(A[i])\nB.sort()\nif cnt%2==0:\n print(sum(B))\nelse... | ['Wrong Answer', 'Accepted'] | ['s859738844', 's564273484'] | [14284.0, 14412.0] | [99.0, 117.0] | [123, 200] |
p03072 | u000349418 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ["n = int(input())\nh = list(map(int,input().split(' ')))\nans = 1\ni = 1\nh0 = h[0]\nwhile i < n:\n if h[i] > h0:\n ans += 1\n h0 = h[i]\n i += 1\nprint(ans)", "n = int(input())\nh = list(map(int,input().split(' ')))\nans = 1\ni = 1\nh0 = h[0]\nwhile i < n:\n if h[i] > h0:\n ans += 1\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s963520425', 's963520425', 's963520425', 's963520425', 's967658172', 's967658172', 's967658172', 's967658172'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [166, 166, 166, 166, 167, 167, 167, 167] |
p03072 | u001041019 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh = list(map(int,input().split()))\n \nans=1\ncnt=0\nfor i in range(n-1):\n for j in range(i+1):\n if h[j]<=h[i+1]:\n cnt+=1\n else:\n break\n if cnt==i+2:\n ans+=1\n cnt=0\n break\n\n\nprint(ans)', 'n=int(input())\nh = list(map(int,input().split()))\n \nans=1\ncnt=0... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s485627569', 's485627569', 's882653046', 's882653046', 's485627569', 's485627569', 's882653046', 's882653046', 's172516980', 's172516980', 's172516980', 's172516980'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [230, 230, 216, 216, 230, 230, 216, 216, 242, 242, 242, 242] |
p03072 | u003501233 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nm=list(map(int,input().split()))\nans=0\n\nfor i in range(n+1):\n if m[0] <= m[i]:\n ans += 1\nprint(ans)', 'n=int(input())\nm=list(map(int,input().split()))\nans=0\n\nfor i in range(n+1):\n if m[0] <= m[i]:\n ans += 1\nprint(ans)', 'n=int(input())\nm=list(map(int,input().split()))\nans=0\n\nf... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s841162932', 's841162932', 's841162932', 's841162932', 's478472514', 's478472514', 's478472514', 's478472514'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [118, 118, 118, 118, 124, 124, 124, 124] |
p03072 | u013408661 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int,input()))\nans=1\nfor i in range(1,n):\n if max(h[:i])<h[i]:\n ans+=1\nprint(ans)', 'n=int(input())\nh=list(map(int,input()))\nans=1\nfor i in range(1,n):\n if max(h[:i])<h[i]:\n ans+=1\nprint(ans)', 'n=int(input())\nh=list(map(int,input().split()))\nans=1\nfor i in range(1,n):\... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s080286990', 's080286990', 's874046531', 's874046531', 's080286990', 's080286990', 's874046531', 's874046531', 's077952956', 's077952956', 's077952956', 's077952956'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [110, 110, 118, 118, 110, 110, 118, 118, 119, 119, 119, 119] |
p03072 | u013582910 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = input()\na = list(map(int, input().split()))\nprint(sum(max(x[:i] <= x[i] for i in range(n))', 'n = input()\na = list(map(int, input().split()))\nprint(sum(max(x[:i] <= x[i] for i in range(n))', 'n = input()\na = list(map(int, input().split()))\nprint(sum(max(x[:i] <= x[i] for i in range(n))', 'n = input()\na = l... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s169714627', 's169714627', 's169714627', 's169714627', 's875116549', 's875116549', 's875116549', 's875116549'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [94, 94, 94, 94, 107, 107, 107, 107] |
p03072 | u013605408 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nm = 0\nb = 0\nfor _ in range(N):\n a = int(input())\n if b <= a:\n m += 1\n b = max(b,a)\nprint(m)', 'N = int(input())\nm = 0\nb = 0\nfor _ in range(N):\n a = int(input())\n if b <= a:\n m += 1\n b = max(b,a)\nprint(m)', 'N = int(input())\nm = 0\nb = 0\nfor _ in range(N):\n a = int(inpu... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s972129268', 's972129268', 's972129268', 's972129268', 's152195802', 's152195802', 's152195802', 's152195802'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [114, 114, 114, 114, 126, 126, 126, 126] |
p03072 | u016182925 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['num = 1\nnum1 = 0\nN = int(input())\nH = list(map(int, input.split())\nfor i in range(1,N):\n if H[i] >= H[i-1]:\n num += 1\n else :\n num1 += 1\nprint(a)\n ', 'num = 1\nnum1 = 0\nN = int(input())\nH = list(map(int, input.split())\nfor i in range(1,N):\n if H[i] >= H[i-1]:\n num += 1\n else :\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s222791012', 's222791012', 's348933977', 's348933977', 's860434627', 's860434627', 's932001799', 's932001799', 's222791012', 's222791012', 's348933977', 's348933977', 's860434627', 's860434627', 's932001799', 's932001799', 's007861369', 's007861369', 's007861369', 's007861369'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [163, 163, 152, 152, 203, 203, 175, 175, 163, 163, 152, 152, 203, 203, 175, 175, 147, 147, 147, 147] |
p03072 | u017063101 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int,input().split()))\nmax=h[0]\ncnt=0\nfor i in range(1,n):\n if h[i]>=max:\n cnt+=1\n max=h[i]\nprint(cnt)\n', 'n=int(input())\nh=list(map(int,input().split()))\nmax=h[0]\ncnt=0\nfor i in range(1,n):\n if h[i]>=max:\n cnt+=1\n max=h[i]\nprint(cnt)\n', 'n=... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s507712967', 's507712967', 's507712967', 's507712967', 's407415494', 's407415494', 's407415494', 's407415494'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [145, 145, 145, 145, 144, 144, 144, 144] |
p03072 | u026762204 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = map(int, input().split(" "))\nresult = 1\n\nfor i in range(n):\n viewable = False\n for j in range(i):\n if h[j] > h[i]:\n break\n else if j == i - 1:\n viewable = True\n \n if viewable == True:\n result += 1\n \nprint("{}".format(result))', 'n = int(input())\nh = map(i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s585265865', 's585265865', 's585265865', 's585265865', 's053025340', 's053025340', 's053025340', 's053025340'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [272, 272, 272, 272, 275, 275, 275, 275] |
p03072 | u027076164 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = map(int, input().split())\n\ncnt = 0\nfor i in range(len(H)):\n if (max(H[0:i+1]) == H[i]):\n cnt += 1\n\nprint(cnt)\n', 'N = int(input())\nH = map(int, input().split())\n\ncnt = 0\nfor i in range(len(H)):\n if (max(H[0:i+1]) == H[i]):\n cnt += 1\n\nprint(cnt)\n', 'N = int(in... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Erro... | ['s032973391', 's032973391', 's282025106', 's282025106', 's522157783', 's522157783', 's911435380', 's911435380', 's989151757', 's989151757', 's032973391', 's032973391', 's282025106', 's282025106', 's522157783', 's522157783', 's911435380', 's911435380', 's989151757', 's989151757', 's700309467', 's700309467', 's700309467... | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.0, 3064.0, 3064.0] | [19.0, 19.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0, 19.0, 19.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0, 18.0, 18.0, 18.0, 18.0] | [141, 141, 145, 145, 128, 128, 131, 131, 145, 145, 141, 141, 145, 145, 128, 128, 131, 131, 145, 145, 147, 147, 147, 147] |
p03072 | u027675217 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int,input().split()))\ncnt=1\nfor i in range(1,n+1):\n\tif h[i]>=h[0]:\n\t\tcnt+=1\nprint(cnt)', 'n=int(input())\nh=list(map(int,input().split()))\ncnt=1\nfor i in range(1,n+1):\n\tif h[i]>=h[0]:\n\t\tcnt+=1\nprint(cnt)', 'n=int(input())\nh=list(map(int,input().split()))\ncnt=1\nfor i in ra... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s127733045', 's127733045', 's127733045', 's127733045', 's867561210', 's867561210', 's867561210', 's867561210'] | [3064.0, 3064.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [112, 112, 112, 112, 132, 132, 132, 132] |
p03072 | u027929618 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int,input().split()))\nans=1\nfor i in range(1,n):\n for j in range(i):\n if h[i]<h[j]:\n break\n ans+=1\nprint(ans)\n ', 'n=int(input())\nh=list(map(int,input().split()))\nans=1\nfor i in range(1,n):\n for j in range(i):\n if h[i]<h[j]:\n break\n ans+=1\nprint(ans)\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s223469246', 's223469246', 's382590705', 's382590705', 's619271442', 's619271442', 's744507287', 's744507287', 's223469246', 's223469246', 's382590705', 's382590705', 's619271442', 's619271442', 's744507287', 's744507287', 's718310727', 's718310727', 's718310727', 's718310727'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [148, 148, 148, 148, 136, 136, 130, 130, 148, 148, 148, 148, 136, 136, 130, 130, 131, 131, 131, 131] |
p03072 | u038676814 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nHList = [int(i) for i in input().split(" ")]\nstn = HList[0]\n\ncount = 0\nfor i in range(len(HList)) :\n if i == 0 :\n count += 1\n elif HList[i] >= stn and HList[i] >= HList[i-1] :\n count += 1\n if stn > HList[i] :\n stn = HList[i]\n\nprint(count)\nprint()', ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s193118461', 's193118461', 's462430928', 's462430928', 's193118461', 's193118461', 's462430928', 's462430928', 's145216513', 's145216513', 's145216513', 's145216513'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [301, 301, 300, 300, 301, 301, 300, 300, 216, 216, 216, 216] |
p03072 | u046187684 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ["def solve(string):\n n, *h = map(int, string.split())\n count = 1\n for i in range(1, n):\n if max(h[:i]) <= h[i]:\n count += 1\n return str(count)\n\n\nif __name__ == '__main__':\n print(solve(input()))\n", "def solve(string):\n n, *h = map(int, string.split())\n count = 1\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s857847161', 's857847161', 's857847161', 's857847161', 's432739628', 's432739628', 's432739628', 's432739628'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0, 18.0, 18.0, 18.0, 18.0] | [227, 227, 227, 227, 249, 249, 249, 249] |
p03072 | u046585946 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=[list(map(int,input().split()))]\nhigh=0\ncount=0\nfor i in range(n):\n if high<=h[i]:\n count=count+1\n high=h[i]\nprint(count)', 'n=int(input())\nh=[list(map(int,input().split()))]\nhigh=0\ncount=0\nfor i in range(n):\n if high<=h[i]:\n count=count+1\n high=h[i]\nprint(count)', 'n=in... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s412315323', 's412315323', 's412315323', 's412315323', 's650686035', 's650686035', 's650686035', 's650686035'] | [3064.0, 3064.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [145, 145, 145, 145, 143, 143, 143, 143] |
p03072 | u054559808 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\na = []\na.append(int(i) for i in input().split()) \nans = 0\nm = a[0]\nfor i in range(n-1):\n if m <= a[i+1]:\n ans += 1\n m = a[i+1]\nprint(ans)', 'n = int(input())\na = []\na.append(int(i) for i in input().split()) \nans = 0\nm = a[0]\nfor i in range(n-1):\n if m <= a[i+1]:\n ans += 1... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s544650545', 's544650545', 's624758926', 's624758926', 's544650545', 's544650545', 's624758926', 's624758926', 's784959852', 's784959852', 's784959852', 's784959852'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [162, 162, 162, 162, 162, 162, 162, 162, 143, 143, 143, 143] |
p03072 | u058295774 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['# coding: utf-8\nminutes = [int(input()) for _ in range(5)]\ntime=0\nl=[]\n\nfor i in minutes:\n time = time + i\n if(i%10==0):\n l.append(0)\n else:\n l.append(10-i%10)\n\nl.sort()\ntime = time + sum(l[:-1])\nprint(time)', '# coding: utf-8\nminutes = [int(input()) for _ in range(5)]\ntime=0\nl... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s136112906', 's136112906', 's660186237', 's660186237', 's911269705', 's911269705', 's136112906', 's136112906', 's660186237', 's660186237', 's911269705', 's911269705', 's017336640', 's017336640', 's017336640', 's017336640'] | [3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [230, 230, 227, 227, 199, 199, 230, 230, 227, 227, 199, 199, 208, 208, 208, 208] |
p03072 | u058300412 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ["Hs = input().strip().split(' ')\nans = 0;\nH = 0;\nfor i in Hs:\n i = int(i)\n if (i >= H):\n \tans += 1\n H = max(H, i)\n\nprint(ans)", "Hs = input().strip().split(' ')\nans = 0;\nH = 0;\nfor i in Hs:\n i = int(i)\n if (i >= H):\n \tans += 1\n H = max(H, i)\n\nprint(ans)", "Hs = input().strip().split(' ')\na... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s008968881', 's008968881', 's503135415', 's503135415', 's008968881', 's008968881', 's503135415', 's503135415', 's206814862', 's206814862', 's206814862', 's206814862'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [128, 128, 127, 127, 128, 128, 127, 127, 140, 140, 140, 140] |
p03072 | u062604519 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = list(map(int,input().split()))\na=[h[i+1] for i in range(n-1) if h[i] >= max(h[i:])]\nprint(len([i for i in a])+1)', 'n = int(input())\nh = list(map(int,input().split()))\na=[h[i+1] for i in range(n-1) if h[i] >= max(h[i:])]\nprint(len([i for i in a])+1)', 'n = int(input())\nh = list(map(int,inp... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s982316453', 's982316453', 's982316453', 's982316453', 's665762898', 's665762898', 's665762898', 's665762898'] | [3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [133, 133, 133, 133, 112, 112, 112, 112] |
p03072 | u062706707 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = [int(i) for i in input().split()]\n\ncount = 0\nfor n in range(N):\n if H[0]<=H[n]:\n if H[n-1]<=H[n]:\n count += 1\nprint(count)', 'N = int(input())\nH = [int(i) for i in input().split()]\n\ncount = 0\nfor n in range(N):\n if H[0]<=H[n]:\n if H[n-1]<=H[n]:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s490166775', 's490166775', 's490166775', 's490166775', 's179661832', 's179661832', 's179661832', 's179661832'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [164, 164, 164, 164, 176, 176, 176, 176] |
p03072 | u064408584 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\na=list(map(int, input().split()))\nans=0\nh=0\nfor i in a:\n if i>h:\n ans+=1\n h=i\nprint(ans)', 'n=int(input())\na=list(map(int, input().split()))\nans=0\nh=0\nfor i in a:\n if i>h:\n ans+=1\n h=i\nprint(ans)', 'n=int(input())\na=list(map(int, input().split()))\nans... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s610822300', 's610822300', 's610822300', 's610822300', 's434591628', 's434591628', 's434591628', 's434591628'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [120, 120, 120, 120, 121, 121, 121, 121] |
p03072 | u066455063 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int, input().split()))\ncount = 0\n\nfor i in range(N):\n if H[0] <= H[i] and H[i-1] <= H[i]:\n count += 1\nprint(count)', 'N = int(input())\nH = list(map(int, input().split()))\ncount = 0\n\nfor i in range(N):\n if H[0] <= H[i] and H[i-1] <= H[i]:\n count +=... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s390337746', 's390337746', 's390337746', 's390337746', 's271940347', 's271940347', 's271940347', 's271940347'] | [3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [158, 158, 158, 158, 173, 173, 173, 173] |
p03072 | u072949274 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nmax_num = 1\ncnt = 0\nlist_num = [int(x) for x input().split()]\nfor x in list_num:\n if max_num <= a:\n \tcnt += 1\n max_num = a\nprint(cnt)', 'N = int(input())\nmax_num = 1\ncnt = 0\nlist_num = [int(x) for x input().split()]\nfor x in list_num:\n if max_num <= a:\n \tcnt += 1\n max_num... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Erro... | ['s352103896', 's352103896', 's487925174', 's487925174', 's548631215', 's548631215', 's616502700', 's616502700', 's634303698', 's634303698', 's773418701', 's773418701', 's889552166', 's889552166', 's352103896', 's352103896', 's487925174', 's487925174', 's548631215', 's548631215', 's616502700', 's616502700', 's634303698... | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [156, 156, 151, 151, 150, 150, 173, 173, 153, 153, 124, 124, 176, 176, 156, 156, 151, 151, 150, 150, 173, 173, 153, 153, 124, 124, 176, 176, 186, 186, 186, 186] |
p03072 | u073606136 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['# coding: utf-8\n\nnum = int(input())\nstr = input().split()\ntable = [int(i) for i in str]\ncount = 0\npointed = table[0]\nfor i in range(1, num):\n if table[0] <= table[i]:\n count += 1\nprint(count)\n', '# coding: utf-8\n\nnum = int(input())\nstr = input().split()\ntable = [int(i) for i in str]\ncount = ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s075162365', 's075162365', 's075162365', 's075162365', 's300111322', 's300111322', 's300111322', 's300111322'] | [9160.0, 9160.0, 9160.0, 9160.0, 9012.0, 9012.0, 9012.0, 9012.0] | [26.0, 26.0, 26.0, 26.0, 28.0, 28.0, 28.0, 28.0] | [202, 202, 202, 202, 238, 238, 238, 238] |
p03072 | u073711480 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['# -*- coding:utf-8 -*-\n\nn = int(input())\nh = input().split()\nflag = 0\ncount = 0\n\nfor i in range(1, n+1):\n print(i)\n for j in range(1, i):\n if h[i-1-j] <= h[i-1]:\n pass\n else:\n flag = 1\n if flag == 0:\n count += 1\n\nprint(count)\n', '# -*- coding:utf-8... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s152994382', 's152994382', 's297399884', 's297399884', 's152994382', 's152994382', 's297399884', 's297399884', 's524945106', 's524945106', 's524945106', 's524945106'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [278, 278, 279, 279, 278, 278, 279, 279, 366, 366, 366, 366] |
p03072 | u075303794 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['import math\nn,d = map(int, input().split())\nx = [list(map(int, input().split())) for _ in range(n)]\nans = 0\n\nfor i in range(n):\n for j in range(i+1,n):\n temp = 0\n for k in range(d):\n temp += (x[i][k] - x[j][k]) ** 2\n l = math.sqrt(temp)\n if l.is_integer():\n ans += 1\nprint(ans)', 'i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s010208071', 's010208071', 's010208071', 's010208071', 's505495160', 's505495160', 's505495160', 's505495160'] | [3064.0, 3064.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [300, 300, 300, 300, 174, 174, 174, 174] |
p03072 | u075304271 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ["import numpy as np\nimport math\nimport collections\nimport fractions\nimport itertools\n\ndef solve():\n n = int(input)\n h = list(map(int, input().split()))\n m = h[0]\n ans = 0\n for i in range(1,h-1):\n if h[i] >= m:\n ans += 1\n m = h[i]\n print(ans)\n return 0\n... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s038624427', 's038624427', 's573052731', 's573052731', 's589848757', 's589848757', 's038624427', 's038624427', 's573052731', 's573052731', 's589848757', 's589848757', 's427990526', 's427990526', 's427990526', 's427990526'] | [27036.0, 27036.0, 27160.0, 27160.0, 27120.0, 27120.0, 27036.0, 27036.0, 27160.0, 27160.0, 27120.0, 27120.0, 27256.0, 27256.0, 27256.0, 27256.0] | [115.0, 115.0, 119.0, 119.0, 115.0, 115.0, 115.0, 115.0, 119.0, 119.0, 115.0, 115.0, 119.0, 119.0, 119.0, 119.0] | [340, 340, 342, 342, 342, 342, 340, 340, 342, 342, 342, 342, 342, 342, 342, 342] |
p03072 | u076996519 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = map(int, input().split())\nsum = 0\nmax = 0\nfor i in range(n):\n if max <= h[i]:\n sum\u3000+= 1\n max = h[i]\nprint(sum)\n \n ', 'n = int(input())\nh = map(int, input().split())\nsum = 0\nmax = 0\nfor i in range(n):\n if max <= h[i]:\n sum\u3000+= 1\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s176510810', 's176510810', 's296792984', 's296792984', 's626116543', 's626116543', 's176510810', 's176510810', 's296792984', 's296792984', 's626116543', 's626116543', 's815727543', 's815727543', 's815727543', 's815727543'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [164, 164, 148, 148, 154, 154, 164, 164, 148, 148, 154, 154, 135, 135, 135, 135] |
p03072 | u077291787 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['# ABC124B - Great Ocean View\nn = int(input())\ndata = list(map(int, input().rstrip().split()))\ncount = 1\n\nfor i in range(1, n):\n print(count)\n if data[i] == max(data[:i + 1]):\n count += 1\n \nprint(count)', '# ABC124B - Great Ocean View\nn = int(input())\ndata = list(map(int, input().rstrip().s... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s007098068', 's007098068', 's007098068', 's007098068', 's282061257', 's282061257', 's282061257', 's282061257'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [217, 217, 217, 217, 200, 200, 200, 200] |
p03072 | u082337294 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int,input().split()))\na=0\ni=1\n\n\nwhile True:\n for i in range(n):\n for j in range(i-1):\n if h[i]<h[j]:\n break\n a+=1\n\nprint(a)', 'n=int(input())\nh=list(map(int,input().split()))\na=0\ni=1\n\n\nwhile True:\n for i in range(n):\n ... | ['Time Limit Exceeded', 'Time Limit Exceeded', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted',... | ['s143833521', 's143833521', 's576088046', 's576088046', 's675706618', 's675706618', 's898123272', 's898123272', 's143833521', 's143833521', 's576088046', 's576088046', 's675706618', 's675706618', 's898123272', 's898123272', 's337281950', 's337281950', 's337281950', 's337281950'] | [2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [2104.0, 2104.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 2104.0, 2104.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [192, 192, 262, 262, 252, 252, 252, 252, 192, 192, 262, 262, 252, 252, 252, 252, 171, 171, 171, 171] |
p03072 | u088974156 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nb=0\nc=0\nfor h in map(int, input.split()):\n if b<=h:\n b=h\n c+=1\nprint(c)', 'n=int(input())\nb=0\nc=0\nfor h in map(int, input.split()):\n if b<=h:\n b=h\n c+=1\nprint(c)', 'n=int(input())\nb=0\nc=0\nfor h in map(int, input.split()):\n if b<=h:\n b=h\n c+=1\nprint(c)', 'n=int(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s862239957', 's862239957', 's862239957', 's862239957', 's071085797', 's071085797', 's071085797', 's071085797'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [93, 93, 93, 93, 94, 94, 94, 94] |
p03072 | u089230684 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['k= int(input())\nnumerosSTR = input().split(" ")\nnumeros = []\ncontador=0\nfor i in numerosSTR:\n numeros.append(int(i))\nfor j in numeros:\n if j <= numeros[-1]:\n contador+=1\nprint(contador)\n ', 'k= int(input())\nnumerosSTR = input().split(" ")\nnumeros = []\ncontador=0\nfor i in numerosSTR:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s107197866', 's107197866', 's107197866', 's107197866', 's965651472', 's965651472', 's965651472', 's965651472'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [204, 204, 204, 204, 173, 173, 173, 173] |
p03072 | u098130832 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int,input().split()))\nsaidai = 0\ncnt = 0\n\nfor i in H:\n print(N)\n if(i >= saidai):\n saidai = i\n cnt += 1\n \n\nprint(cnt)', 'N = int(input())\nH = list(map(int,input().split()))\nsaidai = 0\ncnt = 0\n\nfor i in H:\n print(N)\n if(i >= saidai):\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s769170716', 's769170716', 's769170716', 's769170716', 's251987755', 's251987755', 's251987755', 's251987755'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [170, 170, 170, 170, 157, 157, 157, 157] |
p03072 | u098982053 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = [int(i) for i in input().split(" ")]\nMax = H[0]\ncount = 1\nfor i in range(1,N):\n if H[i]>Max:\n count+=1\nprint(count)', 'N = int(input())\nH = [int(i) for i in input().split(" ")]\nMax = H[0]\ncount = 1\nfor i in range(1,N):\n if H[i]>Max:\n count+=1\nprint(count)', 'N = int(inpu... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s015232069', 's015232069', 's496798897', 's496798897', 's015232069', 's015232069', 's496798897', 's496798897', 's193954239', 's193954239', 's193954239', 's193954239'] | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [142, 142, 157, 157, 142, 142, 157, 157, 158, 158, 158, 158] |
p03072 | u099300051 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int,input().split()))\nans = 1\nfor i in range(1,N):\n for j in range(i+1):\n if H[i] <= H[j]:\n break\n if j == i+1:\n ans +=1\n\nprint(ans)\n', 'N = int(input())\nH = list(map(int,input().split()))\nans = 1\nfor i in range(1,N):\n for j in range(i+1):\n if H[i] <=... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s149145819', 's149145819', 's185786726', 's185786726', 's291232139', 's291232139', 's902276734', 's902276734', 's149145819', 's149145819', 's185786726', 's185786726', 's291232139', 's291232139', 's902276734', 's902276734', 's081652025', 's081652025', 's081652025', 's081652025'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [180, 180, 178, 178, 178, 178, 180, 180, 180, 180, 178, 178, 178, 178, 180, 180, 177, 177, 177, 177] |
p03072 | u101742684 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['\nN = int(input())\nh = map(int,input().split())\nH = []\nfor c in h:\n H.append(int(c))\nprint(H)\n\ncount = 0\nmaxH = 0\nfor i in range(N):\n if H[i] >= maxH:\n count = count + 1\n maxH = H[i]\n\nprint(count)', '\nN = int(input())\nh = map(int,input().split())\nH = []\nfor c in h:\n H.append(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s017354596', 's017354596', 's017354596', 's017354596', 's650733261', 's650733261', 's650733261', 's650733261'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [215, 215, 215, 215, 206, 206, 206, 206] |
p03072 | u102960641 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = list(map(int, input().split()))\nans = 1\nMAX = s[0]\nfor i in s[1:]:\n if i >= MAX:\n ans += 1\n MAX = i\nprint(ans)', 'n = int(input())\nh = list(map(int, input().split()))\nans = 1\nMAX = s[0]\nfor i in s[1:]:\n if i >= MAX:\n ans += 1\n MAX = i\nprint(ans)', 'n = int(input())\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s602891667', 's602891667', 's602891667', 's602891667', 's930208846', 's930208846', 's930208846', 's930208846'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [138, 138, 138, 138, 138, 138, 138, 138] |
p03072 | u103902792 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\n\nmont = list(map(int,input().split()))\nconut = 0\nfor i in range(n):\n if mont[i] >= max(mont[:i]):\n count += 1\nprint(count)\n', 'n = int(input())\n\nmont = list(map(int,input().split()))\nconut = 0\nfor i in range(n):\n if mont[i] >= max(mont[:i]):\n count += 1\nprint(count)\n', 'n = in... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s732754229', 's732754229', 's780920375', 's780920375', 's732754229', 's732754229', 's780920375', 's780920375', 's692785698', 's692785698', 's692785698', 's692785698'] | [2940.0, 2940.0, 3056.0, 3056.0, 2940.0, 2940.0, 3056.0, 3056.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [184, 184, 144, 144, 184, 184, 144, 144, 159, 159, 159, 159] |
p03072 | u112318601 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int, input().split()))\n\n_count=1\nmax_height=H[0]\n\nfor i in range(1,N):\n if max_height <= H[i]:\n count +=1\n max_height = H[i]\nprint(_count)\n', 'N = int(input())\nH = list(map(int, input().split()))\n\n_count=1\nmax_height=H[0]\n\nfor i in range(1,N):\n if ma... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s466242979', 's466242979', 's466242979', 's466242979', 's914161800', 's914161800', 's914161800', 's914161800'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [186, 186, 186, 186, 187, 187, 187, 187] |
p03072 | u112766430 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\ndata = list(map(int,input().split()))\nh = 0\nans = 0\nfor i in range(n):\n\tif data[i]>h:\n\t\tans+=1\n\t\th = data[i]\nprint(ans);\n', 'n = int(input())\ndata = list(map(int,input().split()))\nh = 0\nans = 0\nfor i in range(n):\n\tif data[i]>h:\n\t\tans+=1\n\t\th = data[i]\nprint(ans);\n', 'n = in... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s282749985', 's282749985', 's348095156', 's348095156', 's282749985', 's282749985', 's348095156', 's348095156', 's655180441', 's655180441', 's655180441', 's655180441'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [138, 138, 119, 119, 138, 138, 119, 119, 138, 138, 138, 138] |
p03072 | u117541450 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ["N=int(input())\ndataH=[int(e) for e in input().split(' ')]\nHmax=max(dataH)\n\ndataH.reverse()\nprint(len(dataH)-dataH.index(Hmax))", "N=int(input())\ndataH=[int(e) for e in input().split(' ')]\nHmax=max(dataH)\n\ndataH.reverse()\nprint(len(dataH)-dataH.index(Hmax))", "N=int(input())\ndataH=[int(e) for e in input().s... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s429027497', 's429027497', 's467585915', 's467585915', 's429027497', 's429027497', 's467585915', 's467585915', 's439117198', 's439117198', 's439117198', 's439117198'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [126, 126, 126, 126, 126, 126, 126, 126, 138, 138, 138, 138] |
p03072 | u119495375 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nc = list(map(int, input().split())) \n \nn_pos = 0\nmax_c = 0\nfor i in c:\n if (i>=max_c):\n \tn_pos += 1\n max_c = i\n else:\n pass\nprint(n_pos)', 'n = int(input())\nc = list(map(int, input().split())) \n \nn_pos = 0\nmax_c = 0\nfor i in c:\n if (i>=max_c):\n \tn_pos += 1\n max_c = ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Erro... | ['s353464207', 's353464207', 's356332901', 's356332901', 's434569171', 's434569171', 's483370539', 's483370539', 's787345906', 's787345906', 's353464207', 's353464207', 's356332901', 's356332901', 's434569171', 's434569171', 's483370539', 's483370539', 's787345906', 's787345906', 's757050287', 's757050287', 's757050287... | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 19.0, 19.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 19.0, 19.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [162, 162, 160, 160, 151, 151, 155, 155, 157, 157, 162, 162, 160, 160, 151, 151, 155, 155, 157, 157, 176, 176, 176, 176] |
p03072 | u119821483 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['from sys import stdin\n\nH_list = stdin.readline().rstrip().split()\nH_list_int = list(map(lambda x: int(x), H_list)) \nprint(H_list_int)\n\nables = 1\nmax = H_list_int.pop(0)\n\nfor i in H_list_int:\n if max <= i:\n ables += 1\n max = i\n\nprint(ables)', 'from sys import stdin\n\nH_list = stdin.rea... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s751937072', 's751937072', 's751937072', 's751937072', 's622849710', 's622849710', 's622849710', 's622849710'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [289, 289, 289, 289, 301, 301, 301, 301] |
p03072 | u123745130 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nl=list(map(int,input().split()))\nmax_value=-999\ncnt=0\nfor i in range(n):\n if max_value<l[i]:\n cnt+=1\nprint(cnt)', 'n=int(input())\nl=list(map(int,input().split()))\nmax_value=-999\ncnt=0\nfor i in range(n):\n if max_value<l[i]:\n cnt+=1\nprint(cnt)', 'n=int(input())\nl=list(map(int,input... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wr... | ['s164955045', 's164955045', 's503673445', 's503673445', 's582545228', 's582545228', 's653366186', 's653366186', 's805245952', 's805245952', 's164955045', 's164955045', 's503673445', 's503673445', 's582545228', 's582545228', 's653366186', 's653366186', 's805245952', 's805245952', 's318367749', 's318367749', 's318367749... | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 20.0, 20.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 20.0, 20.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [130, 130, 147, 147, 130, 130, 165, 165, 132, 132, 130, 130, 147, 147, 130, 130, 165, 165, 132, 132, 165, 165, 165, 165] |
p03072 | u127499732 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int,input().split()))\nc=sum(max(h[:i])<=h[i] for i in range(n))\nprint(c)', 'n=int(input())\nh=list(map(int,input().split()))\nc=sum(max(h[:i])<=h[i] for i in range(n))\nprint(c)', 'n=int(input())\nh=list(map(int,input().split()))\nc=sum(max(h[:i])<=h[i] for i in range(n))\nprint(c)', 'n=i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s235626631', 's235626631', 's235626631', 's235626631', 's615594901', 's615594901', 's615594901', 's615594901'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [98, 98, 98, 98, 102, 102, 102, 102] |
p03072 | u131264627 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n if h[i:] = max(h[i:]):\n ans += 1\nprint(ans)\n', 'n = int(input())\nh = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n if h[i:] = max(h[i:]):\n ans += 1\nprint(ans)\n', 'n = int(input())\nh = ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s511452293', 's511452293', 's936080215', 's936080215', 's511452293', 's511452293', 's936080215', 's936080215', 's687166429', 's687166429', 's687166429', 's687166429'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [137, 137, 138, 138, 137, 137, 138, 138, 160, 160, 160, 160] |
p03072 | u131406572 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nc=list(map(int,input().split()))\ns=0\nfor i in range(n):\n for j in range(i):\n d=0\n if c[i]>=c[j]\n d+=0\n else: \n d+=1\n if d==0:\n s+=1\n else:\n s+=0\nprint(s)', 'n=int(input())\nc=list(map(int,input().split()))\ns=0\nfor i in ra... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s032747813', 's032747813', 's032747813', 's032747813', 's017801761', 's017801761', 's017801761', 's017801761'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [234, 234, 234, 234, 194, 194, 194, 194] |
p03072 | u135116520 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N=int(input())\nH=list(map(int,input().split()))\ns=0\nfor i in range(N):\n if H[i]>=max(H[0:i]):\n s+=1\nprint(s)', 'N=int(input())\nH=list(map(int,input().split()))\ns=0\nfor i in range(N):\n if H[i]>=max(H[0:i]):\n s+=1\nprint(s)', 'N=int(input())\nH=list(map(int,input().split()))\ns=0\nfor i in range(N):\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s229388377', 's229388377', 's229388377', 's229388377', 's768707447', 's768707447', 's768707447', 's768707447'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 19.0, 19.0, 19.0, 19.0] | [112, 112, 112, 112, 114, 114, 114, 114] |
p03072 | u139588974 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['c=int(input())\na=list(map(int,input().split()))\nb=0\ncount=0\nfor i in a:\n if a[i]>=b:\n count=count+1\n b=a[i]\nprint(count)', 'c=int(input())\na=list(map(int,input().split()))\nb=0\ncount=0\nfor i in a:\n if a[i]>=b:\n count=count+1\n b=a[i]\nprint(count)', 'a=list(map(int,input... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s258899129', 's258899129', 's707649511', 's707649511', 's258899129', 's258899129', 's707649511', 's707649511', 's145380896', 's145380896', 's145380896', 's145380896'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [137, 137, 136, 136, 137, 137, 136, 136, 146, 146, 146, 146] |
p03072 | u140697185 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int, input().split()))\n\ncnt = 0\nfor i in range(len(H)):\n if (max(H[0:i]) == H[i]):\n cnt += 1\n\nprint(cnt)', 'N = int(input())\nH = list(map(int, input().split()))\n\ncnt = 0\nfor i in range(len(H)):\n if (max(H[0:i]) == H[i]):\n cnt += 1\n\nprint(cnt)', 'N=int(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s037117107', 's037117107', 's312941972', 's312941972', 's950903198', 's950903198', 's037117107', 's037117107', 's312941972', 's312941972', 's950903198', 's950903198', 's025955374', 's025955374', 's025955374', 's025955374'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [144, 144, 135, 135, 134, 134, 144, 144, 135, 135, 134, 134, 146, 146, 146, 146] |
p03072 | u143596442 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nhlist = list(map(int,input().split()))\nkijun = hlist[0]\nans = 1\n\nfor x in range(1,n):\n if kijun <= hlist[x] and hlist[x]>=max(hlist):\n ans += 1\n \nprint(ans)', 'n = int(input())\nhlist = list(map(int,input().split()))\nkijun = hlist[0]\nans = 1\n\nfor x in range(1,n):\n if kijun <= hl... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s963186936', 's963186936', 's963186936', 's963186936', 's041097949', 's041097949', 's041097949', 's041097949'] | [9184.0, 9184.0, 9184.0, 9184.0, 8784.0, 8784.0, 8784.0, 8784.0] | [27.0, 27.0, 27.0, 27.0, 28.0, 28.0, 28.0, 28.0] | [180, 180, 180, 180, 204, 204, 204, 204] |
p03072 | u146597538 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\na = list(map(int, input().split()))\n\nres = 0\nfor indexa, valuea in enumerate(a):\n for indexb, valueb in enumerate(a):\n if valuea < valueb and indexa != indexb:\n break\n if indexa == indexb:\n res += 1\n if indexa >= indexb:\n break\n\nprint(res)', 'n = int(input())\na ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s154485137', 's154485137', 's412495889', 's412495889', 's602510969', 's602510969', 's846854396', 's846854396', 's154485137', 's154485137', 's412495889', 's412495889', 's602510969', 's602510969', 's846854396', 's846854396', 's822736277', 's822736277', 's822736277', 's822736277'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [281, 281, 260, 260, 260, 260, 261, 261, 281, 281, 260, 260, 260, 260, 261, 261, 244, 244, 244, 244] |
p03072 | u146803137 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = list(map(int,input().split()))\nans = 1\nfor i in range(1,n):\n if h[i-1] <= h[i]:\n ans += 1\n else:\n break\nprint(ans)\n', 'n = int(input())\nh = list(map(int,input().split()))\nans = 1\nfor i in range(1,n):\n if h[i-1] <= h[i]:\n ans += 1\n else:\n bre... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s163022837', 's163022837', 's163022837', 's163022837', 's787618591', 's787618591', 's787618591', 's787618591'] | [9072.0, 9072.0, 9072.0, 9072.0, 9072.0, 9072.0, 9072.0, 9072.0] | [32.0, 32.0, 32.0, 32.0, 26.0, 26.0, 26.0, 26.0] | [156, 156, 156, 156, 172, 172, 172, 172] |
p03072 | u150787983 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ["N = int(input())\nH_li = list(map(int, input().split(' ')))\n\ndef check(H):\n H_max = max(H_li)\n max_indexs = ([i for i, x in enumerate(H_li) if x == H_max])\n\n if len(max_indexs) > 1:\n max_index = max(max_indexs)\n min_index = min(max_indexs)\n\n return min_index + len(max_indexs)\n\n else:\n ret... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s122442181', 's122442181', 's122442181', 's122442181', 's952271642', 's952271642', 's952271642', 's952271642'] | [3060.0, 3060.0, 3060.0, 3060.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [358, 358, 358, 358, 447, 447, 447, 447] |
p03072 | u151625340 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int,input().split()))\nans = 1\nm = 0\nfor i in range(N):\n if m <= H[i]:\n ans += 1\n m = max(m,H[i])\nprint(ans)\n', 'N = int(input())\nH = list(map(int,input().split()))\nans = 1\nm = 0\nfor i in range(N):\n if m <= H[i]:\n ans += 1\n m = max(m,H[i])\nprint(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s091079942', 's091079942', 's091079942', 's091079942', 's737935687', 's737935687', 's737935687', 's737935687'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [151, 151, 151, 151, 150, 150, 150, 150] |
p03072 | u157887852 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['l = input().split()\n\n\nresult = 0\n\nfor i in range(len(l)):\n flg = 0\n\n if i == 0:\n result = 1\n else:\n for j in range(0, i):\n if int(l[i]) < int(l[j]):\n flg = 1\n\n if flg == 0:\n result = result + 1\n\nif len(l) <= 20:\n print(result)', ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s201867248', 's201867248', 's217989323', 's217989323', 's535382317', 's535382317', 's739791614', 's739791614', 's201867248', 's201867248', 's217989323', 's217989323', 's535382317', 's535382317', 's739791614', 's739791614', 's310614472', 's310614472', 's310614472', 's310614472'] | [3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [296, 296, 265, 265, 287, 287, 305, 305, 296, 296, 265, 265, 287, 287, 305, 305, 309, 309, 309, 309] |
p03072 | u161201983 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = [int(n) for n in input().split()]\n\na = 0\nb = 1\nans = 1\nwhile h[a]<h[b]:\n ans = ans + 1\n a = a + 1\n b = b + 1\n continue\n\nprint(ans)', 'n = int(input())\nh = [int(n) for n in input().split()]\n\na = 0\nb = 1\nans = 1\nwhile h[a]<h[b]:\n ans = ans + 1\n a = a + 1\n b... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wr... | ['s105335179', 's105335179', 's212425162', 's212425162', 's248061215', 's248061215', 's403096053', 's403096053', 's612370681', 's612370681', 's747876442', 's747876442', 's969828090', 's969828090', 's105335179', 's105335179', 's212425162', 's212425162', 's248061215', 's248061215', 's403096053', 's403096053', 's612370681... | [3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [163, 163, 145, 145, 146, 146, 211, 211, 172, 172, 172, 172, 161, 161, 163, 163, 145, 145, 146, 146, 211, 211, 172, 172, 172, 172, 161, 161, 146, 146, 146, 146] |
p03072 | u161442663 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N=int(input())\nH=input()\nListA=[]\nListA=H.split()\nfor i in range(0,len(ListA),1):\n a=ListA.pop(i)\n b=int(a)\n ListA.insert(i,b)\n\nc=0\nfor i in range(0,len(ListA),1):\n for j in range(0,i,1):\n ListB=ListA[:i+1]\n Num=ListA[j]\n if Num>=max(ListB):\n if j!=i:\n continue\n else:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s625951592', 's625951592', 's625951592', 's625951592', 's366248680', 's366248680', 's366248680', 's366248680'] | [3064.0, 3064.0, 3064.0, 3064.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [347, 347, 347, 347, 234, 234, 234, 234] |
p03072 | u166621202 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N=input()\nH=list(map(int,input().split()))\n\ncnt=0\n\nfor i in range(0,N):\n if max(H[0:i+1] <= H[i]:\n cnt+=1\nprint(cnt)\n', 'N=input()\nH=list(map(int,input().split()))\n\ncnt=0\n\nfor i in range(0,N):\n if max(H[0:i+1] <= H[i]:\n cnt+=1\nprint(cnt)\n', 'N=input()\nH=list(map(int,input().split()))\n\ncnt... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s510132321', 's510132321', 's924100658', 's924100658', 's510132321', 's510132321', 's924100658', 's924100658', 's580201816', 's580201816', 's580201816', 's580201816'] | [2940.0, 2940.0, 3316.0, 3316.0, 2940.0, 2940.0, 3316.0, 3316.0, 2940.0, 2940.0, 2940.0, 2940.0] | [16.0, 16.0, 19.0, 19.0, 16.0, 16.0, 19.0, 19.0, 17.0, 17.0, 17.0, 17.0] | [121, 121, 113, 113, 121, 121, 113, 113, 127, 127, 127, 127] |
p03072 | u167681750 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input().split())\nh = list(map(int, input(.split()))\nheight = h[0]\ncounter = 0\nfor i in h:\n if h[i] >= height:\n counter += 1\n height = h[i]\n\nprint(counter)', 'n = int(input().split())\nh = list(map(int, input(.split()))\nheight = h[0]\ncounter = 0\nfor i in h:\n if h[i] >= height:\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s376919557', 's376919557', 's611455430', 's611455430', 's376919557', 's376919557', 's611455430', 's611455430', 's559947612', 's559947612', 's559947612', 's559947612'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [179, 179, 181, 181, 179, 179, 181, 181, 180, 180, 180, 180] |
p03072 | u167908302 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['# coding:utf-8\nn = int(input())\nh = list(map(int, input().split()))\ncounter = 1\n\n\nif max(h) == h[0]:\n print(counter)\nelse:\n for i in range(n):\n if h[i] > h[0]:\n #print(h[i])\n counter += 1\n print(counter)\n', '# coding:utf-8\nn = int(input())\nh = list(map(int, input(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s054688393', 's054688393', 's255187008', 's255187008', 's412198098', 's412198098', 's054688393', 's054688393', 's255187008', 's255187008', 's412198098', 's412198098', 's466257570', 's466257570', 's466257570', 's466257570'] | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [303, 303, 379, 379, 380, 380, 303, 303, 379, 379, 380, 380, 247, 247, 247, 247] |
p03072 | u168825829 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int, input().split(" ")))\nfor i in range(N):\n if i==0:\n cnt+=1\n else:\n h=H[i]\n c=0\n for j in range(i):\n if H[j]>h:\n c=1\n if c==0:\n cnt+=1\nprint(cnt)\n', 'N = int(input())\nH = list(map(int, input()... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s054437026', 's054437026', 's054437026', 's054437026', 's419443103', 's419443103', 's419443103', 's419443103'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [257, 257, 257, 257, 263, 263, 263, 263] |
p03072 | u172569352 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['def check(N, H):\n max_mount = 0\n count = 0\n mountList = H\n \n for i in mountList:\n if i >= max_mount:\n count += 1\n max_mount = i\n print(count)\n\nN = int(input())\nH = [int(i) for i in input().split()]\nprint(check(N, H))', 'def check(N, H):\n max_mount = 0\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s376450078', 's376450078', 's376450078', 's376450078', 's925259049', 's925259049', 's925259049', 's925259049'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [263, 263, 263, 263, 256, 256, 256, 256] |
p03072 | u175590965 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = list(map(int,input().split()))\nc = 1\nfor i in range(n):\n if h[i] >= max(h[0:i]):\n c += 1\nprint(c)', 'n = int(input())\nh = list(map(int,input().split()))\nc = 1\nfor i in range(n):\n if h[i] >= max(h[0:i]):\n c += 1\nprint(c)', 'n = int(input())\nh = list(map(int,input()... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s959512226', 's959512226', 's959512226', 's959512226', 's947045873', 's947045873', 's947045873', 's947045873'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [128, 128, 128, 128, 129, 129, 129, 129] |
p03072 | u177645323 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nmountain = [ s for s in input().split(" ")]\nhighest = 0\nans = 0\n\nfor m in mountain:\n if m >= highest:\n ans += 1\n highest = m\n\nprint(ans)', 'n = int(input())\nmountain = [ s for s in input().split(" ")]\nhighest = 0\nans = 0\n\nfor m in mountain:\n if m >= highest:\n ans += 1\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s210222956', 's210222956', 's210222956', 's210222956', 's403453982', 's403453982', 's403453982', 's403453982'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [160, 160, 160, 160, 176, 176, 176, 176] |
p03072 | u178192749 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = input()\nl = list(input().split())\n \ncnt = 0\nmax_height = 0\nfor i in range(len(l)):\n if int(l[i]) > int(max_height):\n cnt +=1\n max_height = l[i]\n \nprint(cnt) ', 'n = input()\nl = list(input().split())\n \ncnt = 0\nmax_height = 0\nfor i in range(len(l)):\n if int(l[i]) > int(max_height):\n ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s543354650', 's543354650', 's611515726', 's611515726', 's543354650', 's543354650', 's611515726', 's611515726', 's082805334', 's082805334', 's082805334', 's082805334'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [173, 173, 163, 163, 173, 173, 163, 163, 174, 174, 174, 174] |
p03072 | u186967328 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nl = list(map(int,input().split()))\n\ncnt = max = 0\nfor i in range(N):\n if l[i] > max:\n max = l[i]\n cnt += 1\n\nprint(cnt)', 'N = int(input())\nl = list(map(int,input().split()))\n\ncnt = max = 0\nfor i in range(N):\n if l[i] > max:\n max = l[i]\n cnt += 1\n\npr... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s054775421', 's054775421', 's054775421', 's054775421', 's945071884', 's945071884', 's945071884', 's945071884'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [19.0, 19.0, 19.0, 19.0, 21.0, 21.0, 21.0, 21.0] | [152, 152, 152, 152, 153, 153, 153, 153] |
p03072 | u189479417 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int,input().split()))\nMAX = 0\ncnt = 0\nfor i in H:\n if i > MAX:\n i = MAX\n cnt += 1\nprint(cnt)', 'N = int(input())\nH = list(map(int,input().split()))\nMAX = 0\ncnt = 0\nfor i in H:\n if i > MAX:\n i = MAX\n cnt += 1\nprint(cnt)', 'N = int(input())... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s198225995', 's198225995', 's205354858', 's205354858', 's198225995', 's198225995', 's205354858', 's205354858', 's968739200', 's968739200', 's968739200', 's968739200'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 20.0, 20.0, 20.0, 20.0] | [139, 139, 140, 140, 139, 139, 140, 140, 140, 140, 140, 140] |
p03072 | u193598069 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int, input().split()))\n\nans = 1\nfor i in range(0, N):\n for j in range(0, i):\n if H[i] < H[j]:\n break\n if i == j:\n ans += 1\n \nprint (ans)\n', 'N = int(input())\nH = list(map(int, input().split()))\n\nans = 1\nfor i in range(0, N):\n for j in range(0, i):\n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s011038312', 's011038312', 's298137213', 's298137213', 's489296621', 's489296621', 's011038312', 's011038312', 's298137213', 's298137213', 's489296621', 's489296621', 's716852643', 's716852643', 's716852643', 's716852643'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 191, 191, 191, 191] |
p03072 | u198758525 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = [int(x) for x in input().split()]\n\nans = 1\nhmax = H[0]\n\nfor i in range(1, N):\n if hmax <= H[i]:\n hmax = H[i]\n else:\n ans += 1\n\nprint(ans)', 'N = int(input())\nH = [int(x) for x in input().split()]\n\nans = 1\nhmax = H[0]\n\nfor i in range(1, N):\n if hmax <= H[i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s016165018', 's016165018', 's016165018', 's016165018', 's937725674', 's937725674', 's937725674', 's937725674'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [178, 178, 178, 178, 168, 168, 168, 168] |
p03072 | u201382544 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nlist = []\nnum = 0\nflag = 1\nfor i in range(N-1):\n list.append(i)\n\n\nif flag == 1:\n for j in range(N-1):\n for k in range(N-1):\n if list[j] > list[k]: \n flag = 0 \n num += 1\n\nprint(num)', 'N = int(input())\nlist = []\nnum = 0\nflag = 1\nfor ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s041032260', 's041032260', 's479059152', 's479059152', 's606262878', 's606262878', 's041032260', 's041032260', 's479059152', 's479059152', 's606262878', 's606262878', 's175459321', 's175459321', 's175459321', 's175459321'] | [3060.0, 3060.0, 3064.0, 3064.0, 4336.0, 4336.0, 3060.0, 3060.0, 3064.0, 3064.0, 4336.0, 4336.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 33.0, 33.0, 17.0, 17.0, 17.0, 17.0, 33.0, 33.0, 17.0, 17.0, 17.0, 17.0] | [327, 327, 388, 388, 237, 237, 327, 327, 388, 388, 237, 237, 157, 157, 157, 157] |
p03072 | u201449687 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nheights = [input().split() for _ in range(N)]\n\n\ndef can_get_ocean_view(subheights):\n return 1 if max(subheights) == subheights[-1] else 0\n\n\ndef count_hotels_with_ocean_view(heights):\n hotels_with_ocean_view = [can_get_ocean_view(heights[:i]) for i in range(1, len(heights)+1)]\n retu... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Erro... | ['s143715895', 's143715895', 's206852487', 's206852487', 's253108200', 's253108200', 's727098874', 's727098874', 's835726394', 's835726394', 's143715895', 's143715895', 's206852487', 's206852487', 's253108200', 's253108200', 's727098874', 's727098874', 's835726394', 's835726394', 's186607371', 's186607371', 's186607371... | [3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 3056.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [386, 386, 386, 386, 376, 376, 376, 376, 386, 386, 386, 386, 386, 386, 376, 376, 376, 376, 386, 386, 382, 382, 382, 382] |
p03072 | u203843959 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nhl = list(map(int,input().split()))\n\nmax = 0\ncnt = 0\nfor i in range(n):\n if max < hl[i]:\n cnt += 1\n max = hl[i]\n\nprint(cnt)', 'n = int(input())\nhl = list(map(int,input().split()))\n\nmax = 0\ncnt = 0\nfor i in range(n):\n if max < hl[i]:\n cnt += 1\n max = hl[i]\n\nprint(cnt)... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s585830042', 's585830042', 's585830042', 's585830042', 's794290275', 's794290275', 's794290275', 's794290275'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [147, 147, 147, 147, 148, 148, 148, 148] |
p03072 | u206787454 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = [i for i in map(int, input().split())]\n\ncnt = 0\nfor i in range(i):\n if H[i] == max(H):\n cnt += 1\nprint(cnt)', 'N = int(input())\nH = [i for i in map(int, input().split())]\n\ncnt = 0\nfor i in range(i):\n if H[i] == max(H):\n cnt += 1\nprint(cnt)', 'N = int(input())\nH ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s795308680', 's795308680', 's795308680', 's795308680', 's910471367', 's910471367', 's910471367', 's910471367'] | [3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [138, 138, 138, 138, 144, 144, 144, 144] |
p03072 | u219503971 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = []*100\nH[:] = map(int, input().split())\nct = 1\nfor i in range(N-1):\n max = max(H[:i+1])\n if H[i+1] >= max:\n ct += 1\nprint(ct)', 'N = int(input())\nH = []*100\nH[:] = map(int, input().split())\nct = 1\nfor i in range(N-1):\n max = max(H[:i+1])\n if H[i+1] >= max:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s971630610', 's971630610', 's971630610', 's971630610', 's053584207', 's053584207', 's053584207', 's053584207'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [159, 159, 159, 159, 163, 163, 163, 163] |
p03072 | u220843654 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ["a = input()\nb = list(map(int, input().split(' ')))\nmae = 0\nres = 0\nfor hei in b:\n if hei >= mae:\n res = res + 1\n else:\n break\n mae = hei\nprint(res)\n", "a = input()\nb = list(map(int, input().split(' ')))\nmae = 0\nres = 0\nfor hei in b:\n if hei >= mae:\n res = res + 1\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s696100166', 's696100166', 's696100166', 's696100166', 's209295714', 's209295714', 's209295714', 's209295714'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [171, 171, 171, 171, 198, 198, 198, 198] |
p03072 | u222801992 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int, input().split()))\nans=1\nb=0\nfor i in range(1,n):\n b=max(h[j] for j in range(i))\n if b<=h[i]:\n ans+=1\nprint("57は素数")\nprint(ans)', 'n=int(input())\nh=list(map(int, input().split()))\nans=1\nb=0\nfor i in range(1,n):\n b=max(h[j] for j in range(i))\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s259587686', 's259587686', 's952213933', 's952213933', 's259587686', 's259587686', 's952213933', 's952213933', 's416666901', 's416666901', 's416666901', 's416666901'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [188, 188, 188, 188, 188, 188, 188, 188, 167, 167, 167, 167] |
p03072 | u223646582 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['input()\nH = list(map(int, input()))\n\nmax = 0\ncnt = 0\n\nfor h in H:\n if h >= max:\n cnt += 1\n max = h\n\nprint(cnt)', 'input()\nH = list(map(int, input()))\n\nmax = 0\ncnt = 0\n\nfor h in H:\n if h >= max:\n cnt += 1\n max = h\n\nprint(cnt)', 'input()\nH = list(map(int, input()))\n\nmax = 0\ncnt =... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s815225614', 's815225614', 's815225614', 's815225614', 's157089725', 's157089725', 's157089725', 's157089725'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [117, 117, 117, 117, 128, 128, 128, 128] |
p03072 | u225627575 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = input()\nN = int(N)\nstr = input().split()\nH = []\ni = 0\nj = 0\nfor i in range(N):\n H.append( int(str[i]) )\nflag\nans = 0\nfor i in range(N):\n for j in range(i):\n if H [i] < H[j]:\n flag = 1\n else:\n flag = 0\n if flag == 0:\n ans = ans+1\n\nprint(ans)', 'N = input()\nN = int(N)\nstr ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s050650117', 's050650117', 's183321696', 's183321696', 's201575703', 's201575703', 's987905642', 's987905642', 's050650117', 's050650117', 's183321696', 's183321696', 's201575703', 's201575703', 's987905642', 's987905642', 's500449444', 's500449444', 's500449444', 's500449444'] | [3064.0, 3064.0, 3060.0, 3060.0, 2940.0, 2940.0, 3064.0, 3064.0, 3064.0, 3064.0, 3060.0, 3060.0, 2940.0, 2940.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [266, 266, 276, 276, 257, 257, 266, 266, 266, 266, 276, 276, 257, 257, 266, 266, 294, 294, 294, 294] |
p03072 | u226912938 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int, input().split()))\n\nans = 1\n\nfor n in range(1,N):\n if H[n] >= H[n-1]:\n ans +=1\n else:\n break\n\nprint(ans)', 'N = int(input())\nH = list(map(int, input().split()))\n\nans = 1\n\nfor n in range(1,N):\n if H[n] >= H[n-1]:\n ans +=1\n else:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s090244771', 's090244771', 's090244771', 's090244771', 's171771902', 's171771902', 's171771902', 's171771902'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [158, 158, 158, 158, 138, 138, 138, 138] |
p03072 | u227082700 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n,h=int(input());list(map(int,input().split()));m,a=0,0\nfor i in range(n):\n if m<=h[i]:\n a+=1\n m=h[i]\nprint(a)', 'n,h=int(input());list(map(int,input().split()));m,a=0,0\nfor i in range(n):\n if m<=h[i]:\n a+=1\n m=h[i]\nprint(a)', 'n,h=int(input());list(map(int,input().split()));m,a=0,0\nfor i in ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s240556982', 's240556982', 's240556982', 's240556982', 's625961393', 's625961393', 's625961393', 's625961393'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [117, 117, 117, 117, 117, 117, 117, 117] |
p03072 | u229452810 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['import sys\n \nn=int(input())\nh=input().split()\ncount=0\nmax=int(h[0])\nfor i in range(n):\n if int(h[i])>=max:\n max=int(h[1])\n count+=1\nprint(count)', 'import sys\n \nn=int(input())\nh=input().split()\ncount=0\nmax=int(h[0])\nfor i in range(n):\n if int(h[i])>=max:\n max=int(h[1])\n count+=1\nprin... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Erro... | ['s080963920', 's080963920', 's428690406', 's428690406', 's631835816', 's631835816', 's700079922', 's700079922', 's931394080', 's931394080', 's080963920', 's080963920', 's428690406', 's428690406', 's631835816', 's631835816', 's700079922', 's700079922', 's931394080', 's931394080', 's902816973', 's902816973', 's902816973... | [3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [151, 151, 154, 154, 177, 177, 154, 154, 197, 197, 151, 151, 154, 154, 177, 177, 154, 154, 197, 197, 151, 151, 151, 151] |
p03072 | u236536206 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int,input().split()))\nh.insert(0,0)\nprint(h)\ncount=0\nfor i in range(n):\n if len(h[:i]):\n if h[i-1]<=h[i] and max(h[:i])<=h[i]:\n #print(h[i])\n count+=1\nprint(count)', 'n=int(input())\nh=list(map(int,input().split()))\nh.insert(0,0)\nprint(h)\ncount=0\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s274244082', 's274244082', 's282772993', 's282772993', 's274244082', 's274244082', 's282772993', 's282772993', 's616381580', 's616381580', 's616381580', 's616381580'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [221, 221, 222, 222, 221, 221, 222, 222, 224, 224, 224, 224] |
p03072 | u237316771 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = [int(x) for x in input().split()]\nans = 1\nm = h[0]\nfor i in range(1, n):\n if m < h[i]:\n ans += 1\n m = h[i]\n\nprint(ans)\n', 'n = int(input())\nh = [int(x) for x in input().split()]\nans = 1\nm = h[0]\nfor i in range(1, n):\n if m < h[i]:\n ans += 1\n m = h[i]\n\nprint(ans)\n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s411997333', 's411997333', 's965840096', 's965840096', 's411997333', 's411997333', 's965840096', 's965840096', 's520421079', 's520421079', 's520421079', 's520421079'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [147, 147, 147, 147, 147, 147, 147, 147, 148, 148, 148, 148] |
p03072 | u239528020 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = np.array(map(int, input().split()))\ntmp=[]\nfor i in range(len(H)-1):\n tmp.append(all([all(H[:i]<=[H[i]]), all([H[i]]<=H[i+1:])]))\n#print(sum(tmp))\nprint(1)', 'N = int(input())\nH = np.array(map(int, input().split()))\ntmp=[]\nfor i in range(len(H)-1):\n tmp.append(all([all(H[:i]<=[H[i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Erro... | ['s001044920', 's001044920', 's052388170', 's052388170', 's082369444', 's082369444', 's229200358', 's229200358', 's440622678', 's440622678', 's591790684', 's591790684', 's748612093', 's748612093', 's826551890', 's826551890', 's839727367', 's839727367', 's871874414', 's871874414', 's895015253', 's895015253', 's001044920... | [3060.0, 3060.0, 3064.0, 3064.0, 20768.0, 20768.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 14472.0, 14472.0, 3060.0, 3060.0, 3060.0, 3060.0, 12396.0, 12396.0, 3060.0, 3060.0, 3064.0, 3064.0, 20768.0, 20768.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 14472.0, 14472.0, 3060.... | [17.0, 17.0, 17.0, 17.0, 325.0, 325.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 147.0, 147.0, 17.0, 17.0, 17.0, 17.0, 148.0, 148.0, 17.0, 17.0, 17.0, 17.0, 325.0, 325.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 147.0, 147.0, 17.0, 17.0, 17.0, 17.0, 148.0, 148.0, 148.0, 148.0, 148.0, 148.0] | [179, 179, 183, 183, 163, 163, 176, 176, 177, 177, 189, 189, 169, 169, 147, 147, 159, 159, 195, 195, 153, 153, 179, 179, 183, 183, 163, 163, 176, 176, 177, 177, 189, 189, 169, 169, 147, 147, 159, 159, 195, 195, 153, 153, 168, 168, 168, 168] |
p03072 | u242295648 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int, input().split()))\nresult = 1\n \nfor i in range(N):\n dec = True\n for j in range(i-1):\n if H[i] <= H[j]:\n dec = False\n break\n if dec == True:\n result += 1\nprint(result)', 'N = int(input())\nH = list(map(int, input().split()))\nre... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s181331833', 's181331833', 's658192506', 's658192506', 's181331833', 's181331833', 's658192506', 's658192506', 's416176611', 's416176611', 's416176611', 's416176611'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [245, 245, 242, 242, 245, 245, 242, 242, 245, 245, 245, 245] |
p03072 | u244836567 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['a=int(input())\nb=[int(input()) for i in range(a)]\nc=0\nd=0\nfor i in range(a):\n if c<b[i]:\n c=b[i]\n d=d+1\nprint(d)', 'a=int(input())\nb=[int(input()) for i in range(a)]\nc=0\nd=0\nfor i in range(a):\n if c<b[i]:\n c=b[i]\n d=d+1\nprint(d)', 'a=int(input())\nb=list(map(int,input().split()))\nc=0\nd... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s102864776', 's102864776', 's335550514', 's335550514', 's102864776', 's102864776', 's335550514', 's335550514', 's080692793', 's080692793', 's080692793', 's080692793'] | [9164.0, 9164.0, 9164.0, 9164.0, 9164.0, 9164.0, 9164.0, 9164.0, 9164.0, 9164.0, 9164.0, 9164.0] | [27.0, 27.0, 28.0, 28.0, 27.0, 27.0, 28.0, 28.0, 31.0, 31.0, 31.0, 31.0] | [119, 119, 117, 117, 119, 119, 117, 117, 118, 118, 118, 118] |
p03072 | u265065462 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\na = list(map(int,input().split()))\n\nk = -1\nans = 0\nfor i in a :\n if (k <= i):\n ans += 1\n \nprint(ans)', 'n = int(input())\na = list(map(int,input().split()))\n\nk = -1\nans = 0\nfor i in a :\n if (k <= i):\n ans += 1\n \nprint(ans)', 'n = int(input())\na = list(map(int... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s111084133', 's111084133', 's111084133', 's111084133', 's215726876', 's215726876', 's215726876', 's215726876'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [129, 129, 129, 129, 140, 140, 140, 140] |
p03072 | u266171694 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh_list = map(int, input().split())\nhighest = max(h_list)\ncount = 1\n\nfor i in range(1, n):\n if highest <= h_list[i]:\n count += 1\n\nprint(count)\n', 'n = int(input())\nh_list = map(int, input().split())\nhighest = max(h_list)\ncount = 1\n\nfor i in range(1, n):\n if highest <= h_li... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s767322373', 's767322373', 's767322373', 's767322373', 's927204062', 's927204062', 's927204062', 's927204062'] | [2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [169, 169, 169, 169, 190, 190, 190, 190] |
p03072 | u269171164 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nA = [int(i) for i in range(N)]\nsum = 0\nmax = 0\nfor i in range(N):\n if A[i] >= max:\n sum += 1\n max = A[i]\n \nprint(sum)', 'N = int(input())\nA = [int(i) for i in range(N)]\nsum = 0\nmax = 0\nfor i in range(N):\n if A[i] >= max:\n sum += 1\n max = A[i]\n \npr... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s175682993', 's175682993', 's828740798', 's828740798', 's175682993', 's175682993', 's828740798', 's828740798', 's249821528', 's249821528', 's249821528', 's249821528'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [152, 152, 153, 153, 152, 152, 153, 153, 159, 159, 159, 159] |
p03072 | u278260778 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['mount_count = input()\nmount_heights = input()\nmount_heights_list = mount_heights.split()\ncount = 0\nmax_height = int(mount_heights_list[0])\nfor mount_height in mount_heights_list:\n if max_height <= int(mount_height):\n max_height = mount_height\n count += 1\nprint(count)', 'mount_count = input()... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s909854760', 's909854760', 's909854760', 's909854760', 's544736018', 's544736018', 's544736018', 's544736018'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [284, 284, 284, 284, 291, 291, 291, 291] |
p03072 | u285121325 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = list(map(int, input().split()))\ncnt = [h[0]]\ncnt += ([h[i + 1] for i in range(n-1) if h[0] <= h[i] if h[i+1] >= h[i]])\nprint(len(cnt))', 'n = int(input())\nh = list(map(int, input().split()))\ncnt = [h[0]]\ncnt += ([h[i + 1] for i in range(n-1) if h[0] <= h[i] if h[i+1] >= h[i]])\nprint(len(c... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s001127746', 's001127746', 's193973576', 's193973576', 's001127746', 's001127746', 's193973576', 's193973576', 's478738623', 's478738623', 's478738623', 's478738623'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 21.0, 21.0, 17.0, 17.0, 21.0, 21.0, 18.0, 18.0, 18.0, 18.0] | [155, 155, 150, 150, 155, 155, 150, 150, 159, 159, 159, 159] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.