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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03072 | u582396808 | 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\ncount = 0\nmax_h = 0\n\nfor h in H:\n if h > max_h:\n count += 1\n max_h = h\n \nprint(count)', 'N = int(input())\nH = list(map(int, input().split()))\n\ncount = 0\nmax_h = 0\n\nfor h in H:\n if h > max_h:\n count += 1\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s179906342', 's179906342', 's179906342', 's179906342', 's734523396', 's734523396', 's734523396', 's734523396'] | [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] | [163, 163, 163, 163, 164, 164, 164, 164] |
p03072 | u583014768 | 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 = 5\nH = [9,5,6,8,4]\n\nc = 1\nfor i in range(1,N-1):\n for j in range(0,i-1):\n if H[j] - H[i] > 0:\n break\n else:\n c += 1\nprint(c)', 'N = 5\nH = [9,5,6,8,4]\n\nc = 1\nfor i in range(1,N-1):\n for j in range(0,i-1):\n if H[j] - H[i] > 0:\n break\n else:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s864971782', 's864971782', 's864971782', 's864971782', 's600028551', 's600028551', 's600028551', 's600028551'] | [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] | [158, 158, 158, 158, 152, 152, 152, 152] |
p03072 | u588633699 | 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\n\nfor i in range(1,N):\n\tif H[i] >= H[i-1]:\n\t\tcnt += 1\nprint(str(cnt)+'\\n')", "N = int(input())\nH = list(map(int, input().split()))\ncnt = 1\n\nfor i in range(1,N):\n\tif H[i] >= H[i-1]:\n\t\tcnt += 1\nprint(str(cnt)+'\\n')", "N = int(input())\nH ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s510745077', 's510745077', 's510745077', 's510745077', 's648240345', 's648240345', 's648240345', 's648240345'] | [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] | [134, 134, 134, 134, 145, 145, 145, 145] |
p03072 | u600717568 | 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=list(map(int,input().split()))\ncount=1\nW=0\nfor i in range(1,N):\n for j in range(i):\n if List[j]>List[i]:\n W+=1\n if W==0: \n count+=1\nprint(count)\n \n ', 'N=int(input())\nList=list(map(int,input().split()))\ncount=1\nW=0\nfor i in range(1,N):\n for ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s127345576', 's127345576', 's342078050', 's342078050', 's127345576', 's127345576', 's342078050', 's342078050', 's083132554', 's083132554', 's083132554', 's083132554'] | [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] | [205, 205, 214, 214, 205, 205, 214, 214, 210, 210, 210, 210] |
p03072 | u602677143 | 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()))\nls = []\nd = 1\nfor i in range(n-1):\n ls.append(h[i])\n print(ls)\n c = 0\n for j in range(len(ls)):\n if ls[j] <= h[i+1]:\n c += 1\n if c == len(ls):\n d += 1\n \nprint(d)', 'n = int(input())\nh = list(map(i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s127317135', 's127317135', 's127317135', 's127317135', 's152202726', 's152202726', 's152202726', 's152202726'] | [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] | [268, 268, 268, 268, 254, 254, 254, 254] |
p03072 | u603324902 | 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\nL = list(int,input().split())\n\nmountain = int(1)\nfor i in range(1,n):\n for j in range(i):\n if int(L[j]) >= int(L[i]):\n \t\t\tbreak\n else:\n mountain += 1\n \nprint(mountain)\n', 'n = int(input())\n\nL = list(int,input().spl... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s058643689', 's058643689', 's267816367', 's267816367', 's279575318', 's279575318', 's540097090', 's540097090', 's058643689', 's058643689', 's267816367', 's267816367', 's279575318', 's279575318', 's540097090', 's540097090', 's233058969', 's233058969', 's233058969', 's233058969'] | [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, 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, 18.0, 18.0, 18.0, 18.0] | [254, 254, 255, 255, 225, 225, 245, 245, 254, 254, 255, 255, 225, 225, 245, 245, 334, 334, 334, 334] |
p03072 | u610473220 | 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()))\nflag = True\ncou = 1\nwhile flag:\n MaxH = max(H)\n if H.index(MaxH) == 0:\n flag = False\n else:\n H = H[:MaxH]\n cou += 1\n\nprint(cou)', 'N = int(input())\nH = list(map(int, input().split()))\nflag = True\ncou = 1\nwhile flag:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s150955633', 's150955633', 's150955633', 's150955633', 's864081513', 's864081513', 's864081513', 's864081513'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [2104.0, 2104.0, 2104.0, 2104.0, 17.0, 17.0, 17.0, 17.0] | [210, 210, 210, 210, 170, 170, 170, 170] |
p03072 | u616117610 | 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\nfor i in range(2,n+1):\n if h[n-i] < h[n-i+1]:\n ans = i - 1\n break\nprint(ans)', 'n = int(input())\nh = list(map(int, input().split()))\n\nfor i in range(2,n+1):\n if h[n-i] < h[n-i+1]:\n ans = i - 1\n break\nprint(ans)', 'n ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong ... | ['s074993044', 's074993044', 's094386251', 's094386251', 's186689657', 's186689657', 's226541775', 's226541775', 's230955093', 's230955093', 's278813232', 's278813232', 's391928960', 's391928960', 's484035655', 's484035655', 's507166647', 's507166647', 's718485334', 's718485334', 's761533950', 's761533950', 's074993044... | [3060.0, 3060.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, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.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, 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, 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, 17.0, 17.0, 17.0, 17.0] | [147, 147, 153, 153, 161, 161, 153, 153, 135, 135, 120, 120, 149, 149, 155, 155, 159, 159, 149, 149, 155, 155, 147, 147, 153, 153, 161, 161, 153, 153, 135, 135, 120, 120, 149, 149, 155, 155, 159, 159, 149, 149, 155, 155, 160, 160, 160, 160] |
p03072 | u616542081 | 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 i in range(N-1):\n if H[i] < H[i+1]:\n ans += 1\n break\n\nprint(ans)', 'N = int(input())\nH = list(map(int, input().split()))\n\nans = 1\n\nfor i in range(N-1):\n if H[i] < H[i+1]:\n ans += 1\n break\n\nprint(ans)', 'N = 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'] | ['s390517218', 's390517218', 's425454704', 's425454704', 's672569550', 's672569550', 's390517218', 's390517218', 's425454704', 's425454704', 's672569550', 's672569550', 's001394726', 's001394726', 's001394726', 's001394726'] | [9108.0, 9108.0, 9056.0, 9056.0, 9128.0, 9128.0, 9108.0, 9108.0, 9056.0, 9056.0, 9128.0, 9128.0, 9064.0, 9064.0, 9064.0, 9064.0] | [27.0, 27.0, 25.0, 25.0, 28.0, 28.0, 27.0, 27.0, 25.0, 25.0, 28.0, 28.0, 30.0, 30.0, 30.0, 30.0] | [138, 138, 156, 156, 156, 156, 138, 138, 156, 156, 156, 156, 157, 157, 157, 157] |
p03072 | u617640347 | 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 -*-\nh = list(map(int, input().split()))\nprint(len([i for i, x in enumerate(h) if (i == 0) or ((i == 1) and (h[0] <= h[i])) or ((i > 1) and (max(h[:i]) <= h[i]))]))\n', '# -*- coding: utf-8 -*-\nh = list(map(int, input().split()))\nprint(len([i for i, x in enumerate(h) if (i == 0) or ((i == 1) an... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s907672745', 's907672745', 's907672745', 's907672745', 's420800981', 's420800981', 's420800981', 's420800981'] | [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] | [184, 184, 184, 184, 139, 139, 139, 139] |
p03072 | u619458041 | 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 \ndef main():\n input = sys.stdin.readline\n N = int(input())\n A = list(map(int, input().split()))\n \n ans = 0\n H = A[0]\n for a in A:\n if a >= H:\n ans += 1\n \n H = max(H, a)', 'import sys\n \ndef main():\n input = sys.stdin.readline\n N = int(input(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s385167642', 's385167642', 's385167642', 's385167642', 's375463464', 's375463464', 's375463464', 's375463464'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0, 18.0, 18.0, 18.0, 18.0, 18.0] | [223, 223, 223, 223, 289, 289, 289, 289] |
p03072 | u623065116 | 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\ncount = 0\n\nHigh = H[0]\n\nfor i in range(N):\n\tprint(i)\n\tif H[i] >= High:\n\t\tcount += 1\n\t\tHigh = H[i]\n\t\t\n\nprint(count)\n', 'N = int(input())\nH = list(map(int, input().split()))\n\ncount = 0\n\nHigh = H[0]\n\nfor i in range(N):\n\tprint(i)\n\tif ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s154142612', 's154142612', 's154142612', 's154142612', 's062765386', 's062765386', 's062765386', 's062765386'] | [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] | [169, 169, 169, 169, 159, 159, 159, 159] |
p03072 | u623687794 | 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... | ['s = int(input())\na = list(map(int,input().split()))\ncnt = 0\nb = 0\nfor i in range(s):\n if a[i] >= b:\n b = a[i]\n cnt += 1\nprint(b)\n', 's = int(input())\na = list(map(int,input().split()))\ncnt = 0\nb = 0\nfor i in range(s):\n if a[i] >= b:\n b = a[i]\n cnt += 1\nprint(b)\n', 's = 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', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s152419089', 's152419089', 's432161291', 's432161291', 's610891000', 's610891000', 's152419089', 's152419089', 's432161291', 's432161291', 's610891000', 's610891000', 's858148070', 's858148070', 's858148070', 's858148070'] | [2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.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, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [136, 136, 137, 137, 134, 134, 136, 136, 137, 137, 134, 134, 138, 138, 138, 138] |
p03072 | u627655207 | 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 sub():\n N, Hs = [input() for _ in range(2)]\n Hs = [int(e) for e in Hs.split(" ")]\n count = 1\n maxH = Hs[0]\n for i in range(1, N):\n h = Hs[i]\n if h >= maxH:\n count = count + 1\n maxH = h\n\n\n print("{}".format(count))\n\nsub()\n\n', 'def sub():\n N,... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s086969942', 's086969942', 's086969942', 's086969942', 's420224923', 's420224923', 's420224923', 's420224923'] | [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] | [280, 280, 280, 280, 285, 285, 285, 285] |
p03072 | u633355062 | 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())\nmaxHeight = 0\ncnt = 0\nfor _ in range(n):\n mt = list(map(int, input().split()))\nfor i in range(n):\n if mt[i] >= maxHeight:\n maxHeight = mt[i]\n cnt += 1\nprint(cnt)', 'n = int(input())\nmaxHeight = 0\ncnt = 0\nfor _ in range(n):\n mt = list(map(int, input().split()))\nfor i in range(n)... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s966395208', 's966395208', 's966395208', 's966395208', 's249094887', 's249094887', 's249094887', 's249094887'] | [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, 166, 166, 166, 166] |
p03072 | u635949425 | 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 input().split()]\nb = a[0]\nc = 0\nans = 0\nfor i in range(N-1):\n c += 1\n if b < a[c] and a[c - 1] <a[c] :\n ans += 1\nprint(ans + 1) ', 'N = int(input())\na = [int(i) for i in input().split()]\nb = a[0]\nc = 0\nans = 0\nfor i in range(N-1):\n c += 1\n if b < a[c] and ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s256276588', 's256276588', 's358531709', 's358531709', 's256276588', 's256276588', 's358531709', 's358531709', 's703785591', 's703785591', 's703785591', 's703785591'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.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, 17.0, 17.0, 17.0, 17.0] | [172, 172, 170, 170, 172, 172, 170, 170, 166, 166, 166, 166] |
p03072 | u636162168 | 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=0\ntmp=h[0]\nfor i in range(len(h)-1):\n if tmp<=h[i]:\n ans+=1\n tmp=h[i]\nprint(ans)', 'n=int(input())\nh=list(map(int,input().split()))\nans=0\ntmp=h[0]\nfor i in range(len(h)-1):\n if tmp<=h[i]:\n ans+=1\n tmp=h[i]\nprint(ans)... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s168830877', 's168830877', 's168830877', 's168830877', 's530743294', 's530743294', 's530743294', 's530743294'] | [3060.0, 3060.0, 3060.0, 3060.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] | [149, 149, 149, 149, 147, 147, 147, 147] |
p03072 | u640319601 | 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 = 0\nif N > 1:\n for i in range(1, N):\n if H[i] >= H[i - 1]:\n ans += 1\n else:\n break\nprint(ans + 1)', 'N = int(input())\nH = list(map(int, input().split()))\n\nans = 0\nif N > 1:\n for i in range(1, N):\n if H[i] >= H[i - 1]:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s266229790', 's266229790', 's266229790', 's266229790', 's365508819', 's365508819', 's365508819', 's365508819'] | [2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [172, 172, 172, 172, 148, 148, 148, 148] |
p03072 | u645538982 | 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.append(0)\n\nX=1\nfor i in range(N):\n if H[i] < H[i+1]:\n X+=1\n H[i+1]=H[i]\nprint(X)\n', 'N=int(input())\nH=list(map(int,input().split()))\nH.append(0)\n\nX=1\nfor i in range(N):\n if H[i] < H[i+1]:\n X+=1\n H[i+1]=H[i]\nprint(X)\n', 'N=... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s233952761', 's233952761', 's233952761', 's233952761', 's994422148', 's994422148', 's994422148', 's994422148'] | [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] | [144, 144, 144, 144, 168, 168, 168, 168] |
p03072 | u649202997 | 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 = [int(i) for i in input().split()]\nwhole_list = [h_list[0:i] for i in range(1, n+1)]\ncount = sum(max(i) == whole_list[-1] for i in whole_list)\nprint(count)', 'n = int(input())\nh_list = [int(i) for i in input().split()]\nwhole_list = [h_list[0:i] for i in range(1, n+1)]\ncount = sum(max(i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s825000415', 's825000415', 's825000415', 's825000415', 's848712163', 's848712163', 's848712163', 's848712163'] | [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] | [180, 180, 180, 180, 147, 147, 147, 147] |
p03072 | u655048024 | 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 = 1\nma = H[0]\nfor i in range(N):\n if H[i]>ma:\n ma = H[i]\n count+=1\nprint(count)', 'N = int(input())\nH = list(map(int,input().split()))\ncount = 1\nma = H[0]\nfor i in range(N):\n if H[i]>ma:\n ma = H[i]\n count+=1\nprint(count)', 'N = in... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s166843287', 's166843287', 's492367042', 's492367042', 's565047742', 's565047742', 's730546592', 's730546592', 's166843287', 's166843287', 's492367042', 's492367042', 's565047742', 's565047742', 's730546592', 's730546592', 's633366456', 's633366456', 's633366456', 's633366456'] | [3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.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] | [144, 144, 228, 228, 294, 294, 145, 145, 144, 144, 228, 228, 294, 294, 145, 145, 145, 145, 145, 145] |
p03072 | u657913472 | 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()))\nprint(sum(max(h[:i])<=h[i]for i in range(n)))', 'n=int(input())\nh=list(map(int,input().split()))\nprint(sum(max(h[:i])<=h[i]for i in range(n)))', 'n=int(input())\nh=list(map(int,input().split()))\nprint(count(max(h[:i]+[0])<=h[i]for i in range(n)))', 'n=int(input())\... | ['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'] | ['s238125196', 's238125196', 's456433199', 's456433199', 's839615441', 's839615441', 's238125196', 's238125196', 's456433199', 's456433199', 's839615441', 's839615441', 's818273016', 's818273016', 's818273016', 's818273016'] | [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] | [18.0, 18.0, 18.0, 18.0, 19.0, 19.0, 18.0, 18.0, 18.0, 18.0, 19.0, 19.0, 18.0, 18.0, 18.0, 18.0] | [93, 93, 99, 99, 95, 95, 93, 93, 99, 99, 95, 95, 97, 97, 97, 97] |
p03072 | u661439250 | 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()))\nprint(h)\na = 1\nflag = False\nfor j in range(1, n):\n for i in range(0, j):\n if h[i] <= h[j]:\n flag = True\n else:\n flag=False\n break\n if flag:\n a = a + 1\n\nprint(a)', 'n = int(input())\nh = list... | ['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'] | ['s283627794', 's283627794', 's478263759', 's478263759', 's700075218', 's700075218', 's760144915', 's760144915', 's283627794', 's283627794', 's478263759', 's478263759', 's700075218', 's700075218', 's760144915', 's760144915', 's132458563', 's132458563', 's132458563', 's132458563'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 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, 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, 17.0, 17.0] | [273, 273, 277, 277, 278, 278, 261, 261, 273, 273, 277, 277, 278, 278, 261, 261, 268, 268, 268, 268] |
p03072 | u661576386 | 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())\nList=list(map(int,input().split()))\nc =1\ni =1\nwhile i < a:\n if i-1 == 0:\n if List[i-1] < List[i]:\n c +=1\n i +=1\nprint(c)', 'a=int(input())\nList=list(map(int,input().split()))\nc =1\ni =1\nwhile i < a:\n if i-1 == 0:\n if List[i-1] < List[i]:\n ... | ['Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s372452956', 's372452956', 's419994361', 's419994361', 's372452956', 's372452956', 's419994361', 's419994361', 's549719559', 's549719559', 's549719559', 's549719559'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [2104.0, 2104.0, 2104.0, 2104.0, 2104.0, 2104.0, 2104.0, 2104.0, 17.0, 17.0, 17.0, 17.0] | [167, 167, 167, 167, 167, 167, 167, 167, 134, 134, 134, 134] |
p03072 | u663014688 | 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(input())\nmost_highest_data = 0\nans = 0\n\nfor i in range(N):\n if int(L[i]) > most_highest_data:\n most_higest_data = L[i]\n if most_highest_data <= int(L[i+1]):\n ans += 1\n\nprint(ans)\n', 'N = int(input())\nL = list(input())\nmost_highest_data = 0\nans = 0\n\nfo... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s571148182', 's571148182', 's571148182', 's571148182', 's300066125', 's300066125', 's300066125', 's300066125'] | [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] | [229, 229, 229, 229, 193, 193, 193, 193] |
p03072 | u664610890 | 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\nmax_H = H[0]\nL = [1 for i in range(N)]\nfor i in range(1, N):\n if H[i] > max_H:\n L[i] = 1\n else:\n L[i] = 0\n max_H = max(H[i], max_H)\n\nprint(sum(L))\n', 'N = int(input())\nH = list(map(int, input().split()))\n\nmax_H = H[0]\nL = [1... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s543059284', 's543059284', 's543059284', 's543059284', 's426225810', 's426225810', 's426225810', 's426225810'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [19.0, 19.0, 19.0, 19.0, 19.0, 19.0, 19.0, 19.0] | [224, 224, 224, 224, 225, 225, 225, 225] |
p03072 | u669173971 | 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()))\ncount=1\nfor i in range(n-1):\n if c[i]<c[i+1]:\n count+=1\n else:\n c[i], c[i+1] = c[i+1], c[i]\nprint(count)', 'n=int(input())\nc=list(map(int, input().split()))\ncount=1\nfor i in range(n-1):\n if c[i]<c[i+1]:\n count+=1\n else:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s257774725', 's257774725', 's257774725', 's257774725', 's586641670', 's586641670', 's586641670', 's586641670'] | [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] | [173, 173, 173, 173, 174, 174, 174, 174] |
p03072 | u672316981 | 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\n\nfor i in range(1,n):\n\n if h[i] > max(h[:i]):\n cnt += 1\n\nprint(cnt)', 'n = int(input())\nh = list(map(int, input().split()))\ncnt = 1\n\nfor i in range(1,n):\n\n if h[i] > max(h[:i]):\n cnt += 1\n\nprint(cnt)', 'n = int(input())... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s668677794', 's668677794', 's668677794', 's668677794', 's548435023', 's548435023', 's548435023', 's548435023'] | [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] | [138, 138, 138, 138, 139, 139, 139, 139] |
p03072 | u677400065 | 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(input())for i in range(n)]\nans=0\nfor i in range(n):\n flag = True\n for j in range(i):\n if h[i]<h[j]:\n flag = False\n break\n if(flag):\n ans+=1\nprint(ans)', 'n = int(input())\nh=[int(input())for i in range(n)]\nans=0\nfor i in range(n):\n flag = True\n for j in rang... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s196859283', 's196859283', 's196859283', 's196859283', 's145957765', 's145957765', 's145957765', 's145957765'] | [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] | [193, 193, 193, 193, 192, 192, 192, 192] |
p03072 | u681110193 | 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\ncount=1\nl=H[0]\nfor i in range(N-1):\n if H[i+1]-l>0:\n count +=1\n l=H[i+1]\nprint(count)', 'N=int(input())\nH=list(map(int,input().split()))\n\ncount=1\nl=H[0]\nfor i in range(N-1):\n if H[i+1]-l>0:\n count +=1\n l=H[i+1]\nprint(count)', 'N=int(inpu... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s325763204', 's325763204', 's325763204', 's325763204', 's585393434', 's585393434', 's585393434', 's585393434'] | [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] | [141, 141, 141, 141, 143, 143, 143, 143] |
p03072 | u681444474 | 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().split()\nh = [int(k) for k in H]\nl = []\nans = 1\nfor i in range(len(H)-1):\n l.append(h[i])\n \n if h[i+1] > max(l):\n ans += 1\n \nprint(ans)', 'N = int(input())\nH = input().split()\nh = [int(k) for k in H]\nl = []\nans = 1\nfor i in range(len(H)-1):\n l.append(h[i])\n \n i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s770971208', 's770971208', 's770971208', 's770971208', 's581334806', 's581334806', 's581334806', 's581334806'] | [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] | [170, 170, 170, 170, 171, 171, 171, 171] |
p03072 | u682467216 | 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())\nheight = list(map(int,input().split()))\n\nno_ocean = 0\n\nfor i in range(1,n):\n for k in range(1,i):\n if height[k-1] > height[i]:\n \tno_ocean += 1\n \tbreak\n else:\n continue\n \nprint(n - no_ocean)\n ', 'n = int(input())\nheight = list(map(int,input().split())... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s395083539', 's395083539', 's395083539', 's395083539', 's215542781', 's215542781', 's215542781', 's215542781'] | [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] | [242, 242, 242, 242, 238, 238, 238, 238] |
p03072 | u686036872 | 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\nheight = H[0]\nfor i in range(1, N+1):\n if H[i] >= height:\n ans += 1\n height = H[i]\n\nprint(ans)', 'N = int(input())\nH = list(map(int, input().split())\nans = 1\nheight = H[0]\nfor i in range(1, N+1):\n if H[i] >= height:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s457678686', 's457678686', 's723831497', 's723831497', 's457678686', 's457678686', 's723831497', 's723831497', 's395261272', 's395261272', 's395261272', 's395261272'] | [3064.0, 3064.0, 3060.0, 3060.0, 3064.0, 3064.0, 3060.0, 3060.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] | [171, 171, 172, 172, 171, 171, 172, 172, 170, 170, 170, 170] |
p03072 | u691018832 | 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 = sorted([int(x) for x in input().split()])\n\nans = 0\nb = 0\nfor i in range(N):\n if H[i] >= b:\n ans += 1\n b = H[i]\nprint(ans)', 'N = int(input())\nH = sorted([int(x) for x in input().split()])\n\nans = 0\nb = 0\nfor i in range(N):\n if H[i] >= b:\n ans += 1\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s044438260', 's044438260', 's454677341', 's454677341', 's044438260', 's044438260', 's454677341', 's454677341', 's028194980', 's028194980', 's028194980', 's028194980'] | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.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] | [159, 159, 159, 159, 159, 159, 159, 159, 150, 150, 150, 150] |
p03072 | u691896522 | 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\nfor i in range(n):\n if max(h[0:i]) =< h[i]:\n count += 1\nprint(count)', 'n = int(input())\nh = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n if max(h[0:i]) =< h[i]:\n count += 1\nprint(count)', 'n = int(input())... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s978051946', 's978051946', 's978051946', 's978051946', 's802041359', 's802041359', 's802041359', 's802041359'] | [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] | [141, 141, 141, 141, 145, 145, 145, 145] |
p03072 | u693723949 | 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_vals = input().split(' ')\nhmax = -1\ncount = 0\nfor h in h_vals:\n if hmax <= h\n \thmax = h\n \tcount+=1\nprint(count)", "N = int(input())\nh_vals = input().split(' ')\nhmax = -1\ncount = 0\nfor h in h_vals:\n if hmax <= h\n \thmax = h\n \tcount+=1\nprint(count)", "N = int(input())\nh_vals... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s679423775', 's679423775', 's854106675', 's854106675', 's679423775', 's679423775', 's854106675', 's854106675', 's354504695', 's354504695', 's354504695', 's354504695'] | [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] | [133, 133, 135, 135, 133, 133, 135, 135, 169, 169, 169, 169] |
p03072 | u693933222 | 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 j in range(1,n):\n if(h[j]>=h[0]:\n ans+=1\nprint(ans)', 'n = int(input())\nh = list(map(int,input().split()))\nans=1\nfor j in range(1,n):\n if(h[j]>=h[0]:\n ans+=1\nprint(ans)', 'n = int(input())\nh = [int(input()) for i in range(n)]... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s320610332', 's320610332', 's479786144', 's479786144', 's320610332', 's320610332', 's479786144', 's479786144', 's195154836', 's195154836', 's195154836', 's195154836'] | [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] | [122, 122, 124, 124, 122, 122, 124, 124, 147, 147, 147, 147] |
p03072 | u700499791 | 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()))\nout = 0\nfor i in range(len(a)):\n if max([i for i, x in enumerate(a) if x == max(a[:i+1])]) == i:\n out += 1\nprint(out)', 'n=int(input())\na=list(map(int,input().split()))\nout = 0\nfor i in range(len(a)):\n if max([i for i, x in enumerate(a) if x == max(a[:i+1... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runti... | ['s035651742', 's035651742', 's038088494', 's038088494', 's153671313', 's153671313', 's518150718', 's518150718', 's793971066', 's793971066', 's894929022', 's894929022', 's983979160', 's983979160', 's035651742', 's035651742', 's038088494', 's038088494', 's153671313', 's153671313', 's518150718', 's518150718', 's793971066... | [3060.0, 3060.0, 3060.0, 3060.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, 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, 18.0, 18.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, 18.0, 18.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] | [169, 169, 172, 172, 180, 180, 173, 173, 136, 136, 180, 180, 177, 177, 169, 169, 172, 172, 180, 180, 173, 173, 136, 136, 180, 180, 177, 177, 209, 209, 209, 209] |
p03072 | u702364978 | 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())\nhs = map(int, input().strip().split())\n\nprint(hs)\nmax = 0\nans = 0\nfor i in range(n):\n if hs[i] >= max:\n ans +=1\n max = hs[i]\n\nprint(ans)', 'n = int(input())\nhs = map(int, input().strip().split())\n\nprint(hs)\nmax = 0\nans = 0\nfor i in range(n):\n if hs[i] >= max:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s118917406', 's118917406', 's679000991', 's679000991', 's118917406', 's118917406', 's679000991', 's679000991', 's260578051', 's260578051', 's260578051', 's260578051'] | [3060.0, 3060.0, 2940.0, 2940.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, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [170, 170, 172, 172, 170, 170, 172, 172, 180, 180, 180, 180] |
p03072 | u703890795 | 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 = 0\nc = 0\nfor h in H:\n if h>=highest:\n c+=1\n else:\n highest=h\nprint(h)', 'N = int(input())\nH = list(map(int, input().split()))\nhighest = 0\nc = 0\nfor h in H:\n if h>=highest:\n c+=1\n else:\n highest=h\nprint(h)', 'N = int(input(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s411630003', 's411630003', 's411630003', 's411630003', 's848151613', 's848151613', 's848151613', 's848151613'] | [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] | [139, 139, 139, 139, 133, 133, 133, 133] |
p03072 | u705418271 | 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=0\nm=-1000\nfor i in range(n):\n if m<=H[i]:\n m=H[i]\n ans+=1\nprint(ans)\n', 'n=int(input())\nH=list(map(int,input()))\nans=0\nm=-1000\nfor i in range(n):\n if m<=H[i]:\n m=H[i]\n ans+=1\nprint(ans)\n', 'n=int(input())\nH=list(map(int,input()))\nans=0\nm=-... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s930437432', 's930437432', 's930437432', 's930437432', 's313832769', 's313832769', 's313832769', 's313832769'] | [9124.0, 9124.0, 9124.0, 9124.0, 9140.0, 9140.0, 9140.0, 9140.0] | [27.0, 27.0, 27.0, 27.0, 26.0, 26.0, 26.0, 26.0] | [120, 120, 120, 120, 127, 127, 127, 127] |
p03072 | u708088118 | 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()))\ncount = 1\nmax = l[0]\nfor i in range(N):\n if l[i] >= max:\n \tcount += 1\n max = l[i]\n \nprint(count)', 'N = int(input())\nl = list(map(int,input().split()))\ncount = 1\nmax = l[0]\nfor i in range(N):\n if l[i] >= max:\n \tcount += 1\n max = l[i]... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error'... | ['s164052295', 's164052295', 's262459010', 's262459010', 's505611384', 's505611384', 's589911047', 's589911047', 's693762473', 's693762473', 's759985638', 's759985638', 's881906733', 's881906733', 's979924013', 's979924013', 's164052295', 's164052295', 's262459010', 's262459010', 's505611384', 's505611384', 's589911047... | [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, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 19.0, 19.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, 19.0, 19.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 19.0, 19.0, 19.0, 19.0] | [157, 157, 153, 153, 160, 160, 157, 157, 145, 145, 157, 157, 152, 152, 157, 157, 157, 157, 153, 153, 160, 160, 157, 157, 145, 145, 157, 157, 152, 152, 157, 157, 157, 157, 157, 157] |
p03072 | u713465512 | 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())\nhotels = [int(i) for i in input().split()]\ncount = 0\nmax_height = 0\nfor i in range(len(hotels)):\n if i == 0:\n count += 1\n max_height = hotels[0]\n else:\n if hotels[i] > max_height:\n count += 1\n max_height = hotels[0]\nprint(count)\n', 'N = in... | ['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'] | ['s658418294', 's658418294', 's660816579', 's660816579', 's841001821', 's841001821', 's658418294', 's658418294', 's660816579', 's660816579', 's841001821', 's841001821', 's213898598', 's213898598', 's213898598', 's213898598'] | [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, 18.0, 18.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] | [295, 295, 260, 260, 295, 295, 295, 295, 260, 260, 295, 295, 296, 296, 296, 296] |
p03072 | u713505166 | 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())\nn=list(map(int, input().split()))\n\nans = 1\nfor i in n:\n if n[0] < i:\n ans += 1\nprint(ans)', 'c=int(input())\nn=list(map(int, input().split()))\n\nans = 1\nfor i in n:\n if n[0] < i:\n ans += 1\nprint(ans)', 'c=int(input())\nn=list(map(int, input().split()))\n\nans = 1\nfor i in n:\n if ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s607451132', 's607451132', 's607451132', 's607451132', 's989005922', 's989005922', 's989005922', 's989005922'] | [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] | [108, 108, 108, 108, 131, 131, 131, 131] |
p03072 | u716345599 | 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=map(int,input().split())\nminn=0\nans=0\nfor i in a:\n if i>=minn:\n ans+=1\n minn=ans\nprint(ans)', 'n=int(input())\na=map(int,input().split())\nminn=0\nans=0\nfor i in a:\n if i>=minn:\n ans+=1\n minn=ans\nprint(ans)', 'n=int(input())\na=map(int,input().split())\nminn=0\nans=0\nfor i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s013237444', 's013237444', 's013237444', 's013237444', 's443978167', 's443978167', 's443978167', 's443978167'] | [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] | [115, 115, 115, 115, 114, 114, 114, 114] |
p03072 | u717265305 | 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-1):\n isOK = True\n for j in range(i):\n if H[j] > H[i]: isOK = False\n if isOK: ans+=1\nprint(ans)', 'N = int(input())\nH = list(map(int, input().split()))\nans = 1\nfor i in range(1, N-1):\n isOK = True\n for j in range(i):\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s190371845', 's190371845', 's190371845', 's190371845', 's847618577', 's847618577', 's847618577', 's847618577'] | [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] | [181, 181, 181, 181, 197, 197, 197, 197] |
p03072 | u724687935 | 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\nhi = 0\ncnt = 0\nfor h in H:\n if h <= hi:\n cnt += 1\n else:\n hi = h\n\nprint(cnt)\n', 'N = int(input())\nH = map(int, input().split())\n\nhi = 0\ncnt = 0\nfor h in H:\n if h <= hi:\n cnt += 1\n else:\n hi = h\n\nprint(cnt)\n', 'N = int(input())\nH ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s692349457', 's692349457', 's692349457', 's692349457', 's045045946', 's045045946', 's045045946', 's045045946'] | [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] | [133, 133, 133, 133, 141, 141, 141, 141] |
p03072 | u725661271 | 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(intput())\nH = list(map(int, input().split()))\n\nans = 0\nmax_H = 0\nfor h in H:\n if h >= max_H:\n h = max_H\n ans += 1\n\nprint(ans)', 'N = int(intput())\nH = list(map(int, input().split()))\n\nans = 0\nmax_H = 0\nfor h in H:\n if h >= max_H:\n h = max_H\n ans += 1\n\nprint(ans)', 'N = int(in... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s492154647', 's492154647', 's657581693', 's657581693', 's492154647', 's492154647', 's657581693', 's657581693', 's893920482', 's893920482', 's893920482', 's893920482'] | [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] | [140, 140, 139, 139, 140, 140, 139, 139, 139, 139, 139, 139] |
p03072 | u728615412 | 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 = map[int,input().split()]\n\nans = 1\nfor i in L\n\tif L(:i)>L(i):\n\t\tcontinue\n else:\n\t\tans = ans+1', 'N = int(input())\nL = map[int,input().split()]\n\nans = 1\nfor i in L\n\tif L(:i)>L(i):\n\t\tcontinue\n else:\n\t\tans = ans+1', 'N = int(input())\nL = [int(input().split())]\n \na... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s082958085', 's082958085', 's118069454', 's118069454', 's082958085', 's082958085', 's118069454', 's118069454', 's365515569', 's365515569', 's365515569', 's365515569'] | [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] | [117, 117, 139, 139, 117, 117, 139, 139, 162, 162, 162, 162] |
p03072 | u734876600 | 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... | ['li1 = []\nc = 0\nn = int(input())\nfor i in range(n):\n h = int(input())\n if i == 0:\n c += 1\n else:\n if h >= max(li1):\n c += 1\n li1.append(h)\nprint(c)', 'li1 = []\nc = 0\nn = int(input())\nfor i in range(n):\n h = int(input())\n if i == 0:\n c += 1\n else:\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s001722277', 's001722277', 's001722277', 's001722277', 's578779552', 's578779552', 's578779552', 's578779552'] | [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] | [183, 183, 183, 183, 148, 148, 148, 148] |
p03072 | u734936991 | 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 main():\n n = int(input())\n h_n = [int(s) for s in input().split()]\n\n for idx in range(1, n):\n diff = [h_n[idx] - h_n[i] for i in range(0, idx-1)]\n print(diff)\n diff = filter(lambda x: x >= 0, diff)\n\n print(len(list(diff)) + 1)\n \nmain()', 'def main():\n n = int(inp... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s024245922', 's024245922', 's351470274', 's351470274', 's024245922', 's024245922', 's351470274', 's351470274', 's718097272', 's718097272', 's718097272', 's718097272'] | [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] | [275, 275, 277, 277, 275, 275, 277, 277, 278, 278, 278, 278] |
p03072 | u739959951 | 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=[int(input().split()) for _ in range(n)]\n\nans=1\na=l[0]\nfor i in range(n-1):\n if a<=l[i+1]:\n ans+=1\n a=max(a,l[i])\n\nprint(ans)', 'n=int(input())\nl=[int(input().split()) for _ in range(n)]\n\nans=1\na=l[0]\nfor i in range(n-1):\n if a<=l[i+1]:\n ans+=1\n a=max(a,l[i])\n\nprint(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s651881938', 's651881938', 's651881938', 's651881938', 's714346675', 's714346675', 's714346675', 's714346675'] | [3060.0, 3060.0, 3060.0, 3060.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] | [149, 149, 149, 149, 134, 134, 134, 134] |
p03072 | u740767776 | 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())\ns = list(map(int,input().split()))\ncnt = 1\nfor i in range(n-1,0,-1):\n result = True\n for j in range(i-2,-1,-1):\n if s[j] > s[i]:\n result = False\n break\n if result:\n cnt +=1\nprint(cnt)', 'n = int(input())\ns = list(map(int,input().split()))\ncnt ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s516429130', 's516429130', 's516429130', 's516429130', 's010147223', 's010147223', 's010147223', 's010147223'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [20.0, 20.0, 20.0, 20.0, 17.0, 17.0, 17.0, 17.0] | [245, 245, 245, 245, 245, 245, 245, 245] |
p03072 | u742569919 | 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())\nListH = list(map(int,input().split()))\nresult = 1\nfor i in range(N):\n for k in range(i):\n out = False\n if k >= 0:\n print(ListH[k],ListH[i])\n if ListH[k] < ListH[i]:\n out = True\n if not out :\n result += 1\nprint(result)', 'N = ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s529674715', 's529674715', 's623414097', 's623414097', 's825553305', 's825553305', 's529674715', 's529674715', 's623414097', 's623414097', 's825553305', 's825553305', 's578248136', 's578248136', 's578248136', 's578248136'] | [3060.0, 3060.0, 3060.0, 3060.0, 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, 17.0, 17.0, 17.0, 17.0] | [298, 298, 257, 257, 318, 318, 298, 298, 257, 257, 318, 318, 257, 257, 257, 257] |
p03072 | u744758583 | 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(" ")))\nm = float(\'-inf\')\ncount = 1\nfor i in range(N-2,-1,-1):\n m = max(m,A[i+1])\n if A[i]>=m: count += 1\nprint(count)', 'N = int(input())\nA = list(map(int,input().split(" ")))\nm = float(\'-inf\')\ncount = 1\nfor i in range(N-2,-1,-1):\n m = max(m,A[i... | ['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'] | ['s619109330', 's619109330', 's623521569', 's623521569', 's631956297', 's631956297', 's619109330', 's619109330', 's623521569', 's623521569', 's631956297', 's631956297', 's860893119', 's860893119', 's860893119', 's860893119'] | [3060.0, 3060.0, 3060.0, 3060.0, 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, 17.0, 17.0, 17.0, 17.0] | [171, 171, 171, 171, 159, 159, 171, 171, 171, 171, 159, 159, 165, 165, 165, 165] |
p03072 | u748311048 | 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()))\nHi=0;a=0\nfor i in range(N):\n if H[i]>Hi:\n Hi=H[i]\n a+=1\n elif H[i]=Hi:\n a+=1\nprint(a)', 'n=input()\nH=list(map(int, input().split()))\nHi=0;a=0\nfor i in range(N):\n if H[i]>Hi:\n Hi=H[i]\n a+=1\n elif H[i]=Hi:\n a+=1\nprint(a)', 'n=input()\nH... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s553126250', 's553126250', 's784187528', 's784187528', 's866718101', 's866718101', 's888190894', 's888190894', 's553126250', 's553126250', 's784187528', 's784187528', 's866718101', 's866718101', 's888190894', 's888190894', 's620546835', 's620546835', 's620546835', 's620546835'] | [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] | [140, 140, 156, 156, 156, 156, 52, 52, 140, 140, 156, 156, 156, 156, 52, 52, 161, 161, 161, 161] |
p03072 | u749608932 | 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 = 0\nmax = H[1]\nfor i in range(N-1):\n if H[i+1] >= max:\n ans += 1\n max = H[i+1]\nprint(ans+1)', 'N = int(input())\nH = list(map(int, input().split()))\nans = 0\nmax = H[1]\nfor i in range(N-1):\n if H[i+1] >= max:\n ans += 1\n max = H[i+1]\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s104472265', 's104472265', 's104472265', 's104472265', 's196545527', 's196545527', 's196545527', 's196545527'] | [3060.0, 3060.0, 3060.0, 3060.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] | [155, 155, 155, 155, 155, 155, 155, 155] |
p03072 | u757014735 | 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()))\na=[a[i]-a[0] for i in a]\ncnt=0\nfor i in range(len(a)):\n if a[i]>=0:\n cnt+=1\n a=[a[j]-a[i] for j in a]\nprint(cnt)', 'N=int(input())\na=list(map(int,input().split()))\na=[a[i]-a[0] for i in a]\ncnt=0\nfor i in range(len(a)):\n if a[i]>=0:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s217242846', 's217242846', 's900837258', 's900837258', 's217242846', 's217242846', 's900837258', 's900837258', 's248437818', 's248437818', 's248437818', 's248437818'] | [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] | [173, 173, 144, 144, 173, 173, 144, 144, 122, 122, 122, 122] |
p03072 | u757274384 | 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-2):\n if max(H[0:i+1]) <= H[i+1]:\n ans += 1\n \nprint(ans)', 'n = int(input())\nH = list(map(int, input().split()))\n\nans = 1\nfor i in range(0,n-2):\n if max(H[0:i+1]) <= H[i+1]:\n ans += 1\n \nprint(ans)', 'n = int(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s543029774', 's543029774', 's543029774', 's543029774', 's399650083', 's399650083', 's399650083', 's399650083'] | [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] | [143, 143, 143, 143, 144, 144, 144, 144] |
p03072 | u760171369 | 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 k in range(N-1):\n if H[k+1] >= H[k]:\n cnt += 1\n else:\n break\nprint(cnt)', 'N = int(input())\nH = list( map( int, input().split() ) )\ncnt = 1\nfor k in range(N-1):\n if H[k+1] >= H[k]:\n cnt += 1\n else:\n break\nprint(cnt)',... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s621984295', 's621984295', 's621984295', 's621984295', 's998029939', 's998029939', 's998029939', 's998029939'] | [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] | [148, 148, 148, 148, 166, 166, 166, 166] |
p03072 | u761087127 | 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()]\nans = 1\nt = H[0]\nfor h in H[1:]:\n if t <= h:\n ans += 1\n t = h\n else:\n break\nprint(ans)\n', 'N = int(input())\nH = [int(n) for n in input().split()]\nans = 1\nt = H[0]\nfor h in H[1:]:\n if t <= h:\n ans += 1\n t = h\n else:\n break... | ['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'] | ['s211397095', 's211397095', 's301594160', 's301594160', 's977009238', 's977009238', 's211397095', 's211397095', 's301594160', 's301594160', 's977009238', 's977009238', 's968707411', 's968707411', 's968707411', 's968707411'] | [9156.0, 9156.0, 9128.0, 9128.0, 9168.0, 9168.0, 9156.0, 9156.0, 9128.0, 9128.0, 9168.0, 9168.0, 9092.0, 9092.0, 9092.0, 9092.0] | [26.0, 26.0, 23.0, 23.0, 27.0, 27.0, 26.0, 26.0, 23.0, 23.0, 27.0, 27.0, 30.0, 30.0, 30.0, 30.0] | [153, 153, 143, 143, 140, 140, 153, 153, 143, 143, 140, 140, 141, 141, 141, 141] |
p03072 | u762420987 | 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()))\nans = 0\nmax_h = 0\nfor H in Hlist:\n if H >= max_h:\n ans += 1\n max_h = max(H, max_h)\nprint(max_h)\n', 'N = int(input())\nHlist = list(map(int, input().split()))\nans = 0\nmax_h = 0\nfor H in Hlist:\n if H >= max_h:\n ans += 1\n m... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s636625224', 's636625224', 's636625224', 's636625224', 's281117696', 's281117696', 's281117696', 's281117696'] | [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] | [166, 166, 166, 166, 164, 164, 164, 164] |
p03072 | u766566560 | 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 = 0\n\nfor i in range(N-1):\n if H[0] <= H[i]:\n cnt += 1\n\nprint(cnt)', 'N = int(input())\nH = list(map(int, input().split()))\ncnt = 0\n\nfor i in range(N-1):\n if H[0] <= H[i]:\n cnt += 1\n\nprint(cnt)', "N = 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', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s213236423', 's213236423', 's757078055', 's757078055', 's772527840', 's772527840', 's894801714', 's894801714', 's213236423', 's213236423', 's757078055', 's757078055', 's772527840', 's772527840', 's894801714', 's894801714', 's567264249', 's567264249', 's567264249', 's567264249'] | [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, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0, 18.0, 20.0, 20.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 20.0, 20.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [126, 126, 272, 272, 228, 228, 254, 254, 126, 126, 272, 272, 228, 228, 254, 254, 254, 254, 254, 254] |
p03072 | u771167374 | 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()))\nl = [h[0]]\nans = 1\nfor i in h[1:]:\n for j in l:\n if i>=j:\n l.append(i)\nprint(len(i))\n', 'n = int(input())\nh = list(map(int, input().split()))\nl = [h[0]]\nans = 1\nfor i in h[1:]:\n for j in l:\n if i>=j:\n l.appe... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s480967469', 's480967469', 's830336595', 's830336595', 's480967469', 's480967469', 's830336595', 's830336595', 's761250270', 's761250270', 's761250270', 's761250270'] | [136980.0, 136980.0, 2940.0, 2940.0, 136980.0, 136980.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [2111.0, 2111.0, 17.0, 17.0, 2111.0, 2111.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [159, 159, 155, 155, 159, 159, 155, 155, 179, 179, 179, 179] |
p03072 | u777207626 | 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()]\nmaxh,c = 0,0\nfor i in h:\n if i >= maxh:\n c += 1\nprint(c)\n \n\n', 'n = int(input())\nh = [int(i) for i in input().split()]\nmaxh,c = 0,0\nfor i in h:\n if i >= maxh:\n c += 1\nprint(c)\n \n\n', 'n = int(input())\nh = [int(i) for i in input().s... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s137911177', 's137911177', 's137911177', 's137911177', 's692799192', 's692799192', 's692799192', 's692799192'] | [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] | [122, 122, 122, 122, 143, 143, 143, 143] |
p03072 | u777394984 | 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(input().split())\nnum = 0\nfor A in range(N):\n tf = 1\n if A == 1:\n num+= 1\n continue\n for B in range(A + 1):\n if (H[A]) < (H[B]):\n tf = 0\n if tf:\n num += 1\nprint(num)\n', 'N = int(input())\nH = list(input().split())\nnum = 0\nfor A in range(N):\n tf = 1\n if... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s323646111', 's323646111', 's327784218', 's327784218', 's323646111', 's323646111', 's327784218', 's327784218', 's077311476', 's077311476', 's077311476', 's077311476'] | [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] | [212, 212, 225, 225, 212, 212, 225, 225, 231, 231, 231, 231] |
p03072 | u778878014 | 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()) \nhotel = [int(input()) for i in range(N)] \nview = 1\n\nfor i in range (1, N, 1):\n judge = 1\n for j in range (0, i, 1):\n if hotel[i] >= hotel[j]:\n pass\n else:\n judge = 0\n break\n if judge == 1:\n view += 1\n\nprint (view)\n', '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'] | ['s029027962', 's029027962', 's476648763', 's476648763', 's959128109', 's959128109', 's029027962', 's029027962', 's476648763', 's476648763', 's959128109', 's959128109', 's714327120', 's714327120', 's714327120', 's714327120'] | [3056.0, 3056.0, 2940.0, 2940.0, 3060.0, 3060.0, 3056.0, 3056.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [336, 336, 333, 333, 331, 331, 336, 336, 333, 333, 331, 331, 346, 346, 346, 346] |
p03072 | u779602548 | 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# -*- coding: utf-8 -*-\n\nn = int(input())\nh = list(map(int,input().split()))\n\ncurrent=0\ncnt=0\nfor i in h:\n if i >= current:\n current = i\n cunt += 1\n\nprint(cnt)', '\n# -*- coding: utf-8 -*-\n\nn = int(input())\nh = list(map(int,input().split()))\n\ncurrent=0\ncnt=0\nfor i in h:\n if i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s489189515', 's489189515', 's489189515', 's489189515', 's419334242', 's419334242', 's419334242', 's419334242'] | [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] | [212, 212, 212, 212, 211, 211, 211, 211] |
p03072 | u785578220 | 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())\nx = list(map(int,input().split()))\nm = x[0]\ns = 0\nfor i in range(1,a):\n if m < x[i]:\n m = x[i]\n s+=1\nprint(s+1)', 'a = int(input())\nx = list(map(int,input().split()))\nm = x[0]\ns = 0\nfor i in range(1,a):\n if m < x[i]:\n m = x[i]\n s+=1\nprint(s+1)', 'a = int(input())\nx = li... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s558262246', 's558262246', 's558262246', 's558262246', 's942011894', 's942011894', 's942011894', 's942011894'] | [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] | [135, 135, 135, 135, 137, 137, 137, 137] |
p03072 | u791527495 | 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())\nheight = []\ncount = 0\nfor i in range(N):\n x = int(input())\n height.append(x)\n if x == max(height):\n count += 1\n\nprint(count)', 'N = int(input())\nheight = []\ncount = 0\nfor i in range(N):\n x = int(input())\n height.append(x)\n if x == max(height):\n count += 1\n\nprint(count)',... | ['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'] | ['s092916949', 's092916949', 's158206227', 's158206227', 's219953876', 's219953876', 's595439609', 's595439609', 's092916949', 's092916949', 's158206227', 's158206227', 's219953876', 's219953876', 's595439609', 's595439609', 's885437054', 's885437054', 's885437054', 's885437054'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.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, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [147, 147, 168, 168, 155, 155, 155, 155, 147, 147, 168, 168, 155, 155, 155, 155, 155, 155, 155, 155] |
p03072 | u796789068 | 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=0\nfor i in range(len(H)):\n if i==1:\n ans+=1\n elif max(H[1:i-1])<=H[i]:\n ans+=1\nprint(ans)', 'N=int(input())\nH=list(map(int,input().split()))\nans=0\nfor i in range(len(H)):\n if i==1:\n ans+=1\n elif max(H[1:i-1])<=H[i]:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s936401832', 's936401832', 's936401832', 's936401832', 's162621784', 's162621784', 's162621784', 's162621784'] | [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] | [161, 161, 161, 161, 159, 159, 159, 159] |
p03072 | u798647946 | 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\narr = list(map(int, input().strip().split()))\n\nma = arr[0]\ncnt = 1\n\nfor i in range(1,n):\n \tif arr[i] >= ma:\n \tcnt += 1\n\tma = max(ma, arr[i])\n \nprint (ans)\n', 'n = int(input())\n\narr = list(map(int, input().strip().split()))\n\nma = arr[0]\ncnt = 1\n\nfor i in range(1,n):\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s234377491', 's234377491', 's234377491', 's234377491', 's481457651', 's481457651', 's481457651', 's481457651'] | [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] | [182, 182, 182, 182, 171, 171, 171, 171] |
p03072 | u799000757 | 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()))\nsum=1\ntemp=a[0]\nfor i in range(n-1):\n if temp<a[i+1]:\n temp=a[i+1]\n sum+=1\nprint(sum)', 'n=int(input())\na=list(map(int,input().split()))\nsum=1\ntemp=a[0]\nfor i in range(n-1):\n if temp<a[i+1]:\n temp=a[i+1]\n sum+=1\nprint(sum)', 'n=int(input())... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s585277450', 's585277450', 's585277450', 's585277450', 's552873830', 's552873830', 's552873830', 's552873830'] | [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] | [140, 140, 140, 140, 141, 141, 141, 141] |
p03072 | u799428010 | 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\nn=int(input())\nh=list(map(int, input().split()))\nx=1\nans=h[0]\nfor i in range(1,n):\n if h[0]>=h[1] and h[0]>=h[2]:\n x=0\n print(1)\n sys.exit()\n if h[i]>=h[i-1]:\n x=x+1 \nprint(x)', 'import sys\nn=int(input())\nh=list(map(int, input().split()))\nx=1\nans=h[0]\nfor ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s988245447', 's988245447', 's988245447', 's988245447', 's901427690', 's901427690', 's901427690', 's901427690'] | [9192.0, 9192.0, 9192.0, 9192.0, 9172.0, 9172.0, 9172.0, 9172.0] | [27.0, 27.0, 27.0, 27.0, 27.0, 27.0, 27.0, 27.0] | [220, 220, 220, 220, 141, 141, 141, 141] |
p03072 | u800058906 | 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\nhighest=H[0]\n\nfor i in range(1,N):\n if highest<=H[i]:\n cnt+=1\n highest=H[i]\n\nprint(cnt)', 'N=int(input())\nH=list(map(int,input().split()))\n\ncnt=0\nhighest=H[0]\n\nfor i in range(1,N):\n if highest<=H[i]:\n cnt+=1\n highest=H[i]\n\nprin... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s202566051', 's202566051', 's202566051', 's202566051', 's621185473', 's621185473', 's621185473', 's621185473'] | [9124.0, 9124.0, 9124.0, 9124.0, 9112.0, 9112.0, 9112.0, 9112.0] | [29.0, 29.0, 29.0, 29.0, 24.0, 24.0, 24.0, 24.0] | [149, 149, 149, 149, 148, 148, 148, 148] |
p03072 | u809457879 | 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())\nl1=list(map(int,input().split()))\nans=0\nh=0\nfor i in range(N):\n if h<=l[i]:\n ans+=1\n h=max(h,l[i])\nprint(ans)', 'N=int(input())\nl1=list(map(int,input().split()))\nans=0\nh=0\nfor i in range(N):\n if h<=l[i]:\n ans+=1\n h=max(h,l[i])\nprint(ans)', 'N=int(input())\nl1=list(map(int,... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s005788323', 's005788323', 's005788323', 's005788323', 's436618057', 's436618057', 's436618057', 's436618057'] | [3060.0, 3060.0, 3060.0, 3060.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] | [131, 131, 131, 131, 133, 133, 133, 133] |
p03072 | u809819902 | 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()))\nres =1\nfor i in range(1,n):\n if h[i-1]<=h[i]:res+=1\n else:break\nprint(res)', 'n=int(input())\nh=list(map(int, input().split()))\nres =1\nfor i in range(1,n):\n if h[i-1]<=h[i]:res+=1\n else:break\nprint(res)', 'n=int(input())\nh=list(map(int, input().... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s093700963', 's093700963', 's093700963', 's093700963', 's771673874', 's771673874', 's771673874', 's771673874'] | [9056.0, 9056.0, 9056.0, 9056.0, 9032.0, 9032.0, 9032.0, 9032.0] | [29.0, 29.0, 29.0, 29.0, 30.0, 30.0, 30.0, 30.0] | [129, 129, 129, 129, 141, 141, 141, 141] |
p03072 | u811169796 | 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()))\nk = h[0]\nans = 0\nfor i in range(1,n):\n if(h[i] >= k):\n k = h[i]\n ans += 1\nprint(ans)', 'n = int(input())\nh = list(map(int,input().split()))\nk = h[0]\nans = 0\nfor i in range(1,n):\n if(h[i] >= k):\n k = h[i]\n ans += 1\npr... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s841783431', 's841783431', 's841783431', 's841783431', 's247420201', 's247420201', 's247420201', 's247420201'] | [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] | [153, 153, 153, 153, 153, 153, 153, 153] |
p03072 | u812867074 | 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())\nli=list(map(int,input().split()))\ncount=0\nfor i in range(1,n):\n if li[i] >= max(li[0:i])\n count +=1\nprint(count+1)', 'n=int(input())\nli=list(map(int,input().split()))\ncount=0\nfor i in range(1,n):\n if li[i] >= max(li[0:i])\n count +=1\nprint(count+1)', 'n=int(input())\nli=list(map(int,... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s184029762', 's184029762', 's968041594', 's968041594', 's184029762', 's184029762', 's968041594', 's968041594', 's455033420', 's455033420', 's455033420', 's455033420'] | [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] | [133, 133, 147, 147, 133, 133, 147, 147, 134, 134, 134, 134] |
p03072 | u813286880 | 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\nfor i in range(len(tmp)):\n H.append(int(tmp[i]))\n\nans = 0\nfor i in range(len(H)):\n chkflg = True\n if i >= 1:\n for j in range(i): \n if H[j] > H[i]:\n chkflg = False\n break\n\n if chkflg: ans += 1\n\nprint(ans) \n\n', 'N = int... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s147389482', 's147389482', 's147389482', 's147389482', 's652850829', 's652850829', 's652850829', 's652850829'] | [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] | [288, 288, 288, 288, 237, 237, 237, 237] |
p03072 | u820052258 | 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\nNH = 1\nfor i in range(N-1):\n if H[i+1]=>max(H[0:i+1]):\n NH = NH + 1\n else:\n NH = NH\n\nprint(NH)', 'N = int(input())\nH = list(map(int,input().split()))\n\nNH = 1\nfor i in range(N-1):\n if H[i+1]=>max(H[0:i+1]):\n NH = NH + 1\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s945664376', 's945664376', 's945664376', 's945664376', 's385251183', 's385251183', 's385251183', 's385251183'] | [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] | [167, 167, 167, 167, 169, 169, 169, 169] |
p03072 | u821432765 | 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 = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(N):\n l = H[:+1]\n if max(l) == H[i]:\n ans += 1\n\n\nprint(ans)', '\nN = int(input())\nH = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(N):\n l = H[:+1]\n if max(l) == H[i]:\n ans += 1\n\n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s102268331', 's102268331', 's102268331', 's102268331', 's520246275', 's520246275', 's520246275', 's520246275'] | [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] | [226, 226, 226, 226, 132, 132, 132, 132] |
p03072 | u822044226 | 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\nN = int(input())\nH = [int(x) for x in stdin.readline().rstrip().split()]\n\n#print(list(reversed(range(1,N))))\n\nc = 1\nfor i in reversed(range(1,N)):\n print(i,c,max(H[:i+1]))\n if H[i] - H[i-1] > 0 and H[i] == max(H[:i+1]):\n c += 1\n\nprint(c)\n', 'from sys import stdin\n\nN = int(i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s406618555', 's406618555', 's406618555', 's406618555', 's747944106', 's747944106', 's747944106', 's747944106'] | [3060.0, 3060.0, 3060.0, 3060.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] | [266, 266, 266, 266, 207, 207, 207, 207] |
p03072 | u829249049 | 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()\nlist1=[int(i) for i in input().split()]\nlist2=[x - list1[0] for (x) in list1] \nlist3=[x - list1[0] for (x) in list1] \nlist2.insert(0,list1[0])\nlist3.append(0)\nlist4= [x - y for (x, y) in zip(list3,list2)]\nprint(len([i for i in list4 if i >=0]))', 'N=input()\nlist1=[int(i) for i in input().split()]\nl... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s522545177', 's522545177', 's845497211', 's845497211', 's522545177', 's522545177', 's845497211', 's845497211', 's175537901', 's175537901', 's175537901', 's175537901'] | [3064.0, 3064.0, 3064.0, 3064.0, 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, 17.0, 17.0, 17.0, 17.0] | [254, 254, 247, 247, 254, 254, 247, 247, 136, 136, 136, 136] |
p03072 | u830054172 | 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 i in range(n):\n if (max(h[0:i+1]) <= h[i]):\n ans += 1\n\nprint(ans)', 'n = int(input())\nh = list(map(int, input().split()))\n\nans = 1\n\nfor i in range(n):\n if (max(h[0:i+1]) <= h[i]):\n ans += 1\n\nprint(ans)', 'n = int(... | ['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'] | ['s072366009', 's072366009', 's195803965', 's195803965', 's297752267', 's297752267', 's072366009', 's072366009', 's195803965', 's195803965', 's297752267', 's297752267', 's253208451', 's253208451', 's253208451', 's253208451'] | [2940.0, 2940.0, 3056.0, 3056.0, 3064.0, 3064.0, 2940.0, 2940.0, 3056.0, 3056.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 19.0, 19.0, 18.0, 18.0, 17.0, 17.0, 19.0, 19.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [142, 142, 151, 151, 141, 141, 142, 142, 151, 151, 141, 141, 146, 146, 146, 146] |
p03072 | u830742419 | 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 countInn(n, L):\n numInn = 1\n mainHurdle = L[0]\n hurdle = L[1]\n for i in range(1, n):\n currentH = L[i]\n if currentH < mainHurdle or currentH < hurdle:\n continue\n numInn += 1\n hurdle = currentH\n print(numInn)\n \nn = int(input())\na = list(map(int, input().split()))\n \n '... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s873802305', 's873802305', 's966264240', 's966264240', 's873802305', 's873802305', 's966264240', 's966264240', 's090603230', 's090603230', 's090603230', 's090603230'] | [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, 21.0, 21.0, 17.0, 17.0, 21.0, 21.0, 17.0, 17.0, 17.0, 17.0] | [302, 302, 403, 403, 302, 302, 403, 403, 310, 310, 310, 310] |
p03072 | u835482198 | 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())\ntotal = 1\nmax_value = h[0]\nfor i in range(1, n):\n if max_value <= h[i]:\n total += 1\n max_value = max(max_value, h[i])\nprint(total)\n', 'n = int(input())\nh = map(int, input().split())\ntotal = 1\nmax_value = h[0]\nfor i in range(1, n):\n if max_va... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s924267077', 's924267077', 's924267077', 's924267077', 's107463915', 's107463915', 's107463915', 's107463915'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [19.0, 19.0, 19.0, 19.0, 17.0, 17.0, 17.0, 17.0] | [191, 191, 191, 191, 176, 176, 176, 176] |
p03072 | u840807329 | 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 = [int(input()) for h in range(n)]\n\ncount = 0\nlast_h = 0\nfor index,h in enumerate(h_list):\n\tif last_h <= h:\n\t\tcount += 1\n\t\n\tif last_h < h:\n\t\tlast_h = h\n\nprint(count)\n\t\t\n\t\n\t', 'n = int(input())\nh_list = [int(input()) for h in range(n)]\n\ncount = 0\nlast_h = 0\nfor in... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s930029963', 's930029963', 's930029963', 's930029963', 's742064002', 's742064002', 's742064002', 's742064002'] | [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] | [196, 196, 196, 196, 215, 215, 215, 215] |
p03072 | u842388336 | 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\n\nN = int(input())\nH_list = list(map(int,input().split()))\n\ncnt = 0\nfor i in range(N):\n temp_H_list = H_list[i:]\n if np.argmax(temp_H_list)==len(temp_H_list)-1:\n cnt+=1\n \nprint(cnt)', 'import numpy as np\n\nN = int(input())\nH_list = list(map(int,input().split()))\n\ncnt = 0\nfor ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s546069167', 's546069167', 's657872708', 's657872708', 's546069167', 's546069167', 's657872708', 's657872708', 's282728684', 's282728684', 's282728684', 's282728684'] | [21152.0, 21152.0, 12580.0, 12580.0, 21152.0, 21152.0, 12580.0, 12580.0, 12508.0, 12508.0, 12508.0, 12508.0] | [367.0, 367.0, 151.0, 151.0, 367.0, 367.0, 151.0, 151.0, 153.0, 153.0, 153.0, 153.0] | [207, 207, 228, 228, 207, 207, 228, 228, 218, 218, 218, 218] |
p03072 | u842878495 | 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()]\nans = 0\nfor i in range(1, N+1):\n t = max(H[:i])\n if t <= H[i]:\n ans += 1\nprint(ans)\n', 'N = int(input())\nH = [int(n) for n in input().split()]\nans = 0\nfor i in range(1, N+1):\n t = max(H[:i])\n if t <= H[i]:\n ans += 1\nprint(ans)\n', 'N = in... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s695464464', 's695464464', 's780514006', 's780514006', 's695464464', 's695464464', 's780514006', 's780514006', 's453299325', 's453299325', 's453299325', 's453299325'] | [9092.0, 9092.0, 9152.0, 9152.0, 9092.0, 9092.0, 9152.0, 9152.0, 8980.0, 8980.0, 8980.0, 8980.0] | [26.0, 26.0, 27.0, 27.0, 26.0, 26.0, 27.0, 27.0, 27.0, 27.0, 27.0, 27.0] | [144, 144, 139, 139, 144, 144, 139, 139, 141, 141, 141, 141] |
p03072 | u845937249 | 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\nh = list(map(int,input().split()))\n\nans = 1\n\nfor i in range(1,n):\n\tif max(h[0:i]) <= h[i]:\n\t\tprint(i)\n\t\tans = ans + 1\n\nprint(ans)\n', 'n = int(input())\n\nh = list(map(int,input().split()))\n\nans = 1\n\nfor i in range(1,n):\n\tif max(h[0:i]) <= h[i]:\n\t\tprint(i)\n\t\tans = ans + 1... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s281312942', 's281312942', 's281312942', 's281312942', 's615037439', 's615037439', 's615037439', 's615037439'] | [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] | [148, 148, 148, 148, 149, 149, 149, 149] |
p03072 | u847605090 | 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())\nx=0\nview=0\ns=list(map(int,input().split()))\nfor i in range(N): \n if s[i]>x:\n view+=1\n x=s[i]\nprint(view) \n \n', 'N=int(input())\nx=0\nview=0\ns=list(map(int,input().split()))\nfor i in range(N): \n if s[i]>x:\n view+=1\n x=s[i]\nprint(view) \n \n',... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s943109987', 's943109987', 's943109987', 's943109987', 's873370048', 's873370048', 's873370048', 's873370048'] | [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] | [146, 146, 146, 146, 148, 148, 148, 148] |
p03072 | u848654125 | 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 = 0\nmax = 0\nfor i in h:\n if i > max:\n max = i\n ans += 1\n\nprint(ans)', 'N = int(input())\nh = list(map(int, input().split()))\n\nans = 0\nmax = 0\nfor i in h:\n if i > max:\n max = i\n ans += 1\n\nprint(ans)', 'N = in... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s419926660', 's419926660', 's419926660', 's419926660', 's772768239', 's772768239', 's772768239', 's772768239'] | [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] | [142, 142, 142, 142, 143, 143, 143, 143] |
p03072 | u855376994 | 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()))\ncounter=0\nfor i in range(N):\n if max(l[:i+1])==l[i]\n counter += 1\nprint(counter)', 'N = int(input())\nl = list(map(int, input().split()))\ncounter=0\nfor i in range(N):\n if max(l[:i+1])==l[i]\n counter += 1\nprint(counter)', 'N = int(input())\nl = list... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s944960832', 's944960832', 's944960832', 's944960832', 's394240403', 's394240403', 's394240403', 's394240403'] | [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] | [136, 136, 136, 136, 137, 137, 137, 137] |
p03072 | u855866205 | 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 = int(input())\nc = 1\nb4most = 0\nanswer = 0\nryokan = list(map(int, input().split()))\nprint(ryokan)\nfor data in ryokan:\n if b4most <= data:\n answer += 1\n b4most = data\nprint(answer)\n', 'l = int(input())\nc = 1\nb4most = 0\nanswer = 0\nryokan = list(map(int, input().split()))\nprint(ryokan)... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s145249464', 's145249464', 's145249464', 's145249464', 's652555315', 's652555315', 's652555315', 's652555315'] | [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] | [199, 199, 199, 199, 185, 185, 185, 185] |
p03072 | u858748695 | 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=0\nfor i in range(1,n):\n if h[i-1]<h[i]:break\n ans+=1\nprint(ans)\n ', 'n=int(input())\nh=list(map(int,input().split()))\nans=0\nfor i in range(1,n):\n if h[i-1]<h[i]:break\n ans+=1\nprint(ans)\n ', 'n=int(input())\nh=list(map(int,input().split()))\nans=1\... | ['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'] | ['s329664836', 's329664836', 's420836055', 's420836055', 's605050685', 's605050685', 's329664836', 's329664836', 's420836055', 's420836055', 's605050685', 's605050685', 's687404560', 's687404560', 's687404560', 's687404560'] | [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] | [18.0, 18.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] | [120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 120, 139, 139, 139, 139] |
p03072 | u859448927 | 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())\nfor i in range(a):\n k = list(map(int,input().split()))\nl =1\nfor i in range(1,a):\n for j in range(i):\n if k[i] >= k[j]:\n l += 1\nprint(l)', 'a=int(input())\nfor i in range(a):\n k = list(map(int,input().split()))\nl =1\nfor i in range(1,a):\n for j in range(i):\n if k[i] >= k[j]:\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'] | ['s418508583', 's418508583', 's538551881', 's538551881', 's995768081', 's995768081', 's418508583', 's418508583', 's538551881', 's538551881', 's995768081', 's995768081', 's514615769', 's514615769', 's514615769', 's514615769'] | [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] | [160, 160, 153, 153, 139, 139, 160, 160, 153, 153, 139, 139, 159, 159, 159, 159] |
p03072 | u864650257 | 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... | ['it = int(input())\nlists = list(map(int,input().split()))\nx = 0\ni = it - 1\n\nfor j in range(i):\n listo = lists[:j+1]\n if max(listo) == lists[j]:\n x += 1\n else:\n continue\n\nprint(x)', 'it = int(input())\nlists = list(map(int,input().split()))\nx = 0\ni = it - 1\n\nfor j in range(i):\n listo = lists[... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s083763101', 's083763101', 's083763101', 's083763101', 's534020815', 's534020815', 's534020815', 's534020815'] | [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] | [186, 186, 186, 186, 183, 183, 183, 183] |
p03072 | u867736259 | 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 = map(int,input().split())\nb = list(b)\nk = 1\nfor i in range(a-1):\n maxim = max(a[:i+1])\n if maxim <= a[i+1]:\n k += 1\nprint(k)', 'a = int(input())\nb = map(int,input().split())\nb = list(b)\nk = 1\nfor i in range(a-1):\n maxim = max(a[:i+1])\n if maxim <= a[i+1]:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s849227887', 's849227887', 's849227887', 's849227887', 's951009885', 's951009885', 's951009885', 's951009885'] | [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] | [157, 157, 157, 157, 157, 157, 157, 157] |
p03072 | u868237899 | 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 = H[0]\nans = 1\n\nfor i in range(1, N-1):\n if highest <= H[i]:\n ans += 1\n highest = H[i]\n\nprint(ans)', 'N = int(input())\nH = list(map(int, input().split()))\nhighest = H[0]\nans = 1\n\nfor i in range(1, N-1):\n if highest <= H[i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s693964308', 's693964308', 's693964308', 's693964308', 's871098422', 's871098422', 's871098422', 's871098422'] | [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] | [176, 176, 176, 176, 174, 174, 174, 174] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.