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 | u286201019 | 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().split())\n\n"""\nSEA H_1 H_2 H_3 H_4 ... H_N\n"""\n\n\n# max(Hs[0:i+1])\n\nret = 0\nfor i in range(N):\n if Hs[i] == max(0:i+1):\n ret += 1\n\nprint(ret)', 'N = int(input())\nHs = map(int, input().split())\n\n"""\nSEA H_1 H_2 H_3 H_4 ... H_N\n"""\n\n\n# max(Hs[0:i+1])... | ['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'] | ['s065194299', 's065194299', 's083286663', 's083286663', 's110448743', 's110448743', 's065194299', 's065194299', 's083286663', 's083286663', 's110448743', 's110448743', 's711120390', 's711120390', 's711120390', 's711120390'] | [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, 20.0, 20.0, 17.0, 17.0, 17.0, 17.0, 20.0, 20.0, 18.0, 18.0, 18.0, 18.0] | [237, 237, 241, 241, 239, 239, 237, 237, 241, 241, 239, 239, 247, 247, 247, 247] |
p03072 | u287669475 | 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()]\nb = 1 # counter\nc = 1 # answer\nm = h_list[0] # max height\nwhile b != n:\n if h_list[b] > m:\n c += 1\n b += 1\nprint(c)', 'n=int(input())\nh_list=[int(i) for i in input().split()]\nb = 1 # counter\nc = 1 # answer\nm = h_list[0] # max heig... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s226120146', 's226120146', 's252316583', 's252316583', 's226120146', 's226120146', 's252316583', 's252316583', 's261015974', 's261015974', 's261015974', 's261015974'] | [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, 19.0, 19.0, 17.0, 17.0, 19.0, 19.0, 17.0, 17.0, 17.0, 17.0] | [187, 187, 193, 193, 187, 187, 193, 193, 210, 210, 210, 210] |
p03072 | u291543340 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = [int(x) for x in input().split()]\nc = 0\nfor i in range(n):\n if h[i] >= max(h[:i]):\n c += 1\nprint(c)\n', 'n = int(input())\nh = [int(x) for x in input().split()]\nc = 0\nfor i in range(n):\n if h[i] >= max(h[:i]):\n c += 1\nprint(c)\n', 'n = int(input())\nh = [int(x) for ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s836485359', 's836485359', 's836485359', 's836485359', 's413915391', 's413915391', 's413915391', 's413915391'] | [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] | [131, 131, 131, 131, 135, 135, 135, 135] |
p03072 | u294385082 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh =list(map(int,input().split()))\nc = 1\nfor i in range(1,n):\n for j in range(i):\n if h[j]>h[i]:\n break\n if j == i-1:\n c += 1\n \nprint(c) ', 'n = int(input())\nh =list(map(int,input().split()))\nc = 1\nfor i in range(1,n):\n for j in range(i):\n if h[j]>h[i]:\n b... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s807471197', 's807471197', 's807471197', 's807471197', 's542782030', 's542782030', 's542782030', 's542782030'] | [3064.0, 3064.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 19.0, 19.0, 19.0, 19.0] | [174, 174, 174, 174, 139, 139, 139, 139] |
p03072 | u296150111 | 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... | ['m=int(input())\na=list(map(int,input().split()))\nD=1\nn=1\n\nwhile n < m:\n if a[n] < max(a[0:n]):\n D=D\n else:\n D=D+1\n\nprint(D)', 'm=int(input())\na=list(map(int,input().split()))\nD=1\nn=1\n\nwhile n < m:\n if a[n] < max(a[0:n]):\n D=D\n else:\n D=D+1\n\nprint(D)', 'm=int(input())\na=list(map(int,input().s... | ['Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s522320629', 's522320629', 's522320629', 's522320629', 's644368462', 's644368462', 's644368462', 's644368462'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [2104.0, 2104.0, 2104.0, 2104.0, 18.0, 18.0, 18.0, 18.0] | [124, 124, 124, 124, 142, 142, 142, 142] |
p03072 | u298413997 | 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\nh = H[0]\n\nfor i in range(H):\n if h <= H[i]:\n count += 1\n h = H[i]\n\nprint(count)', 'N = int(input())\nH = list(map(int, input().split()))\n\ncount = 0\nh = H[0]\n\nfor i in range(H):\n if h <= H[i]:\n count += 1\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s904289471', 's904289471', 's904289471', 's904289471', 's649176730', 's649176730', 's649176730', 's649176730'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [160, 160, 160, 160, 160, 160, 160, 160] |
p03072 | u306070611 | 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()))\nmireru = []\nhighest = 0\nfor i in li:\n if li[i] >= highest:\n mireru.append(1)\n highest = li[i]\nprint(sum(mireru))', 'N = int(input())\nli = list(map(int, input().split()))\nmireru = []\nhighest = 0\nfor i in li:\n if li[i] >= highest:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s215808337', 's215808337', 's215808337', 's215808337', 's867047159', 's867047159', 's867047159', 's867047159'] | [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, 175, 175, 175, 175] |
p03072 | u306664745 | 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=0\nm=0\nfor _ in range(int(input())):\n\tn=int(input())\n\tif n>=m:\n\t\tc+=1\n\t\tm=n\nprint(c)', 'c=0\nm=0\nfor _ in range(int(input())):\n\tn=int(input())\n\tif n>=m:\n\t\tc+=1\n\t\tm=n\nprint(c)', 'c=0\nm=0\nfor _ in range(int(input())):\n\tn=int(input())\n\tif n>=m:\n\t\tc+=1\n\t\tm=n\nprint(c)', 'c=0\nm=0\nfo... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s838364869', 's838364869', 's838364869', 's838364869', 's523161498', 's523161498', 's523161498', 's523161498'] | [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] | [85, 85, 85, 85, 107, 107, 107, 107] |
p03072 | u317779196 | 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()]\na = 0\nfor i in range(len(h)):\n if h[i] >= max(h[0:i-1]):\n a += 1\nprint(a)', 'n = int(input())\nh = [int(i) for i in input().split()]\na = 0\nfor i in range(len(h)):\n if h[i] >= max(h[0:i-1]):\n a += 1\nprint(a)', 'n = int(input())\nh = ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s522765319', 's522765319', 's522765319', 's522765319', 's745326160', 's745326160', 's745326160', 's745326160'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [138, 138, 138, 138, 184, 184, 184, 184] |
p03072 | u319002530 | 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\na = 1\nb = list()\nfor i in range(N):\n try:\n if H[i] - H[i-1] > 0:\n a += 1\n else:\n break\n except:\n pass\nprint(a)', 'N = int(input())\nH = list(map(int,input().split()))\n\na = 1\nb = list()\nfor i in range... | ['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', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer',... | ['s151582127', 's151582127', 's249479249', 's249479249', 's327750398', 's327750398', 's553267045', 's553267045', 's646577602', 's646577602', 's726175642', 's726175642', 's741816374', 's741816374', 's151582127', 's151582127', 's249479249', 's249479249', 's327750398', 's327750398', 's553267045', 's553267045', 's646577602... | [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, 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] | [212, 212, 212, 212, 218, 218, 156, 156, 217, 217, 155, 155, 164, 164, 212, 212, 212, 212, 218, 218, 156, 156, 217, 217, 155, 155, 164, 164, 157, 157, 157, 157] |
p03072 | u319410662 | 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())\nm=0\nc=0\nfor h in H:\n c += 1 if h>m else 0\n m=max(m,h)\nprint(c)', 'N=int(input())\nH=map(int,input().split())\nm=0\nc=0\nfor h in H:\n c += 1 if h>m else 0\n m=max(m,h)\nprint(c)', 'N=int(input())\nH=map(int,input().split())\nm=0\nc=0\nfor h in H:\n c += 1 if h>m e... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s185733468', 's185733468', 's185733468', 's185733468', 's069412808', 's069412808', 's069412808', 's069412808'] | [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] | [106, 106, 106, 106, 107, 107, 107, 107] |
p03072 | u319690708 | 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 = map(int, input().split())\nH = list(H)\nprint(H)\n\nmax = H[0]\ncounter = 0\n\nfor i in H:\n if i >= max:\n max = i\n counter += 1\n\nprint(counter)\n ', 'N = int(input())\n\nH = map(int, input().split())\nH = list(H)\nprint(H)\n\nmax = H[0]\ncounter = 0\n\nfor i in H:\n if i >= max:\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s486862690', 's486862690', 's486862690', 's486862690', 's496377570', 's496377570', 's496377570', 's496377570'] | [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] | [168, 168, 168, 168, 159, 159, 159, 159] |
p03072 | u319957725 | 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 = list(map(int, H))\n\ncount = 1\n\nfor i in range(1, N):\n del H[0]\n if(max(H) == H[0]):\n count += 1\n\nprint(count)', 'N = int(input())\nH = input().split()\nH = list(map(int, H))\n\ncount = 1\n\nfor i in range(1, N):\n del H[0]\n if(max(H) == H[0]):\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s144171409', 's144171409', 's144171409', 's144171409', 's544864983', 's544864983', 's544864983', 's544864983'] | [2940.0, 2940.0, 2940.0, 2940.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] | [162, 162, 162, 162, 174, 174, 174, 174] |
p03072 | u328755070 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int, input().split()))\n\n\nfor i in range(N-1):\n if H[i] > H[i+1]:\n print(i+1)\n ', 'N = int(input())\nH = list(map(int, input().split()))\n\n\nfor i in range(N-1):\n if H[i] > H[i+1]:\n print(i+1)\n ', 'N = int(input())\nH = list(map(int, input().split()))\n\n\nfor i in ra... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s462708690', 's462708690', 's462708690', 's462708690', 's889850146', 's889850146', 's889850146', 's889850146'] | [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] | [113, 113, 113, 113, 165, 165, 165, 165] |
p03072 | u329058683 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nm=0\na=input().split()\na.insert(0,a[0])\nprint(a)\nfor i in range(n-1):\n if int(a[i+1])-int(a[i]) >=0 and int(a[i+1])-int(a[0])>=0:\n m=m+1\nprint(m)', 'n=int(input())\nm=0\na=input().split()\na.insert(0,a[0])\nprint(a)\nfor i in range(n-1):\n if int(a[i+1])-int(a[i]) >=0 and int(a[i+1])-int(a[... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s172600118', 's172600118', 's172600118', 's172600118', 's180539044', 's180539044', 's180539044', 's180539044'] | [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] | [163, 163, 163, 163, 137, 137, 137, 137] |
p03072 | u329731898 | 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\nfor i in range(N-1):\n for j in range(i):\n if(H[i]<H[j]):\n break:\n count+=1\nprint(count)', 'N=int(input())\nH=list(map(int,input().split()))\ncount=1\nfor i in range(N-1):\n for j in range(i):\n if(H[i]<H[j]):\n ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answ... | ['s075721614', 's075721614', 's157047303', 's157047303', 's377417002', 's377417002', 's422655706', 's422655706', 's706884253', 's706884253', 's075721614', 's075721614', 's157047303', 's157047303', 's377417002', 's377417002', 's422655706', 's422655706', 's706884253', 's706884253', 's480468409', 's480468409', 's480468409... | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 19.0, 19.0, 19.0, 19.0] | [171, 171, 167, 167, 220, 220, 150, 150, 151, 151, 171, 171, 167, 167, 220, 220, 150, 150, 151, 151, 220, 220, 220, 220] |
p03072 | u333404917 | 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(x) for x in input().split()]\nmax_h = l[0]\nresult = 1\nfor i in range(1,n):\n print(max_h, l[i])\n if max_h <= l[i]:\n result += 1\n max_h = l[i]\n else:\n continue\nprint(result)', 'n = int(input())\nl = [int(x) for x in input().split()]\nmax_h = l[0]\nresult... | ['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'] | ['s221590362', 's221590362', 's507481322', 's507481322', 's861805570', 's861805570', 's990154998', 's990154998', 's221590362', 's221590362', 's507481322', 's507481322', 's861805570', 's861805570', 's990154998', 's990154998', 's143563918', 's143563918', 's143563918', 's143563918'] | [3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 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, 17.0, 17.0, 17.0, 17.0] | [226, 226, 204, 204, 223, 223, 232, 232, 226, 226, 204, 204, 223, 223, 232, 232, 203, 203, 203, 203] |
p03072 | u335571733 | 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... | ['if __name__ == "__main__":\n a = int(input())\n ryokan= input().split(" ")\n total=1\n for x in range(1,a):\n flag=True\n for y in range(x-1):\n if int(ryokan[x])<=int(ryokan[y]):\n flag=False\n break\n if flag:\n print(x) \n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s212214820', 's212214820', 's610513226', 's610513226', 's611805460', 's611805460', 's212214820', 's212214820', 's610513226', 's610513226', 's611805460', 's611805460', 's903964913', 's903964913', 's903964913', 's903964913'] | [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] | [359, 359, 357, 357, 356, 356, 359, 359, 357, 357, 356, 356, 327, 327, 327, 327] |
p03072 | u335973735 | 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... | ["line_len = int(input())\ns = input().rstrip().split(' ')\ninns = []\nans = 1\nfor i in range(line_len):\n inns.append(s[i])\n\nfor i in range(1,line_len):\n for x in range(i+1):\n total = 1\n if inns[x] > inns[i]:\n total = 0\n ans = ans + total\nprint(ans)", "line_len = int(input())... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s550881006', 's550881006', 's550881006', 's550881006', 's624905366', 's624905366', 's624905366', 's624905366'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [278, 278, 278, 278, 298, 298, 298, 298] |
p03072 | u341626051 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = list(map(int, input().split()))\n\n\nn = 1\nh = [15, 42, 12]\n\nfor i, v in enumerate(h):\n if i == 0:\n continue\n elif v < h[i-1]:\n break\n\nprint(i)\n', 'n = int(input())\nh = list(map(int, input().split()))\n\n\nn = 1\nh = [15, 42, 12]\n\nfor i, v in enumerate(h):\n i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s164369519', 's164369519', 's164369519', 's164369519', 's892770827', 's892770827', 's892770827', 's892770827'] | [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] | [182, 182, 182, 182, 146, 146, 146, 146] |
p03072 | u342051078 | 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())\nmx = h[0]\nans = 1\nfor i in range(1,N):\n if h[i] >= mx:\n mx = h[i]\n ans += 1\nprint(ans)', 'N = int(input())\nh = map(int,input().split())\nmx = h[0]\nans = 1\nfor i in range(1,N):\n if h[i] >= mx:\n mx = h[i]\n ans += 1\nprint(ans)... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s557951039', 's557951039', 's557951039', 's557951039', 's550265727', 's550265727', 's550265727', 's550265727'] | [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] | [149, 149, 149, 149, 137, 137, 137, 137] |
p03072 | u344030307 | 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\nc = 0\n\nfor i in h:\n t = True\n for j in range(i):\n if h[j] >= h[i]:\n t = False\n break\n c += 1', 'n = int(input())\nh = list(map(int, input().split()))\n\nc = 0\n\nfor i in h:\n t = True\n for j in range(i):\n if h[j] >= h[i]:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s191679566', 's191679566', 's191679566', 's191679566', 's005487046', 's005487046', 's005487046', 's005487046'] | [8972.0, 8972.0, 8972.0, 8972.0, 9068.0, 9068.0, 9068.0, 9068.0] | [27.0, 27.0, 27.0, 27.0, 25.0, 25.0, 25.0, 25.0] | [163, 163, 163, 163, 206, 206, 206, 206] |
p03072 | u344888046 | 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... | ['hpi = input()\nk = list(map(int, input().split(" ")))\nfor c in range(int(hpi) - 1):\n jo = "yes"\n n = k[:c + 2]\n for co in range(len(n) - 1):\n if n[co] > k[c]:\n jo = "no"\n else:\n pass\n if jo == "yes":\n count += 1\nprint(count + 1)', 'hpi = input()\nk = list(map(int, input().split(" "))... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s377905033', 's377905033', 's979002433', 's979002433', 's377905033', 's377905033', 's979002433', 's979002433', 's163266172', 's163266172', 's163266172', 's163266172'] | [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, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [250, 250, 278, 278, 250, 250, 278, 278, 279, 279, 279, 279] |
p03072 | u346629192 | 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()\ns = input().split()\ncount = 0\nfor i in range(N):\n t = s[:i]\n if max(t) <= s[i]:\n count = count + 1\nprint(count)', 'N = input()\ns = input().split()\ncount = 0\nfor i in range(N):\n t = s[:i]\n if max(t) <= s[i]:\n count = count + 1\nprint(count)', 'N = input()\ns = input().split()\ncount ... | ['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'] | ['s280094574', 's280094574', 's302179159', 's302179159', 's366667524', 's366667524', 's863943354', 's863943354', 's280094574', 's280094574', 's302179159', 's302179159', 's366667524', 's366667524', 's863943354', 's863943354', 's005862886', 's005862886', 's005862886', 's005862886'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [128, 128, 133, 133, 176, 176, 171, 171, 128, 128, 133, 133, 176, 176, 171, 171, 174, 174, 174, 174] |
p03072 | u347912669 | 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... | ['# B - Great Ocean View\n\n\n\nn = int(input())\npoints = list(map(int, input().split()))\n\n\nans = 1\n\nif n == 1:\n pass\n\nelif n == 2:\n if points[1] >= points[0]:\n ans += 1\n \n# elif n >= 3:\n# need_height = max(points[0], points[1])\n\n# current = points[i]\n# \n# ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s058163619', 's058163619', 's924636812', 's924636812', 's058163619', 's058163619', 's924636812', 's924636812', 's496385869', 's496385869', 's496385869', 's496385869'] | [2940.0, 2940.0, 3064.0, 3064.0, 2940.0, 2940.0, 3064.0, 3064.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 19.0, 19.0, 19.0, 19.0] | [466, 466, 470, 470, 466, 466, 470, 470, 305, 305, 305, 305] |
p03072 | u349836672 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['Hs = list(map(int, input().split()))\n\ncount = 0\n\nhs_len = len(Hs)\nfor i, H in enumerate(Hs):\n flag = True\n if i == 0:\n pass\n else:\n for j in range(i, 0, -1):\n if Hs[j-1] > H:\n flag = False\n break\n if flag:\n count += 1\n\nprint(co... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s415120571', 's415120571', 's415120571', 's415120571', 's438841551', 's438841551', 's438841551', 's438841551'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [305, 305, 305, 305, 268, 268, 268, 268] |
p03072 | u353919145 | 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()))\nwhile len(H) < N:\n H.append(0)\nprint(H)\nsee = 1\nfor i in range(1, N):\n tall = True\n for j in range(i):\n if(H[j] > H[i]):\n tall = False\n break\n if tall:\n see += 1\nprint(see)\n', 'N = int(input())\nH = lis... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s132113935', 's132113935', 's132113935', 's132113935', 's517132702', 's517132702', 's517132702', 's517132702'] | [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] | [274, 274, 274, 274, 123, 123, 123, 123] |
p03072 | u354567428 | 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)\n\nans=1\nhighest=h[0]\nfor i in range(1,n):\n if h[i] >= highest:\n highest = h[i]\n ans += 1\nprint(ans)\n', 'n=int(input())\nh=list(map(int,input().split()))\nprint(h)\n\nans=1\nhighest=h[0]\nfor i in range(1,n):\n if h[i] >= highest:\n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s630167439', 's630167439', 's630167439', 's630167439', 's838697537', 's838697537', 's838697537', 's838697537'] | [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] | [173, 173, 173, 173, 159, 159, 159, 159] |
p03072 | u355649707 | 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 = list(map(int, input().split()))\n\nview = 0\ncnt = 0\nfor i in range(n):\n if hotels[i] > view:\n cnt += 1\n view = hotels[i]\n \nprint(cnt)', 'n = int(input())\nhotels = list(map(int, input().split()))\n\nview = 0\ncnt = 0\nfor i in range(n):\n if hotels[i] > view:\n cnt += 1... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s685247275', 's685247275', 's685247275', 's685247275', 's851974210', 's851974210', 's851974210', 's851974210'] | [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] | [167, 167, 167, 167, 168, 168, 168, 168] |
p03072 | u359557992 | 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\nmaximum = 0\n\nfor i in range(N):\n\tH[i] > maximum\n\tcount += 1\n\tmaximum = H[i]\t\t\n\nprint(count)\n\n\n', 'N = int(input())\nH = list(map(int, input().split()))\n\ncount = 0\nmaximum = 0\n\nfor i in range(N):\n\tH[i] > maximum\n\tcount += 1\n\t... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s251982848', 's251982848', 's990128923', 's990128923', 's251982848', 's251982848', 's990128923', 's990128923', 's839967792', 's839967792', 's839967792', 's839967792'] | [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] | [158, 158, 159, 159, 158, 158, 159, 159, 166, 166, 166, 166] |
p03072 | u363259080 | 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 calc(x): \n global mount\n global list\n count=0\n for y in range(1,x+1):\n if mount[x] >= mount[x-y]:\n count+=1\n if x == count:\n list.append(x)\n\nN=int(input()) \n\nmount=input().split()\nprint(mount)\n\nlist=[]\nfor z in range(1,len(mount)):\n calc(z)\n\nprint(1+le... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s142784080', 's142784080', 's184704338', 's184704338', 's142784080', 's142784080', 's184704338', 's184704338', 's710680278', 's710680278', 's710680278', 's710680278'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [421, 421, 304, 304, 421, 421, 304, 304, 200, 200, 200, 200] |
p03072 | u363407238 | 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\ninput = sys.stdin.readline\nn = int(input())\nh=list(map(int,input().split()))\nprint(h)\nans=1\nma=h[0]\nfor i in range(1,n):\n print(h[i])', 'import sys\ninput = sys.stdin.readline\nn = int(input())\nh=list(map(int,input().split()))\nprint(h)\nans=1\nma=h[0]\nfor i in range(1,n):\n print(h[i])', '... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s367512789', 's367512789', 's367512789', 's367512789', 's894819491', 's894819491', 's894819491', 's894819491'] | [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] | [147, 147, 147, 147, 185, 185, 185, 185] |
p03072 | u368016155 | 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... | ['h = int(input())\nmount = [int(_) for _ in input().split()]\ncount = 0\nfor i in range(len):\n if i = 0:\n count += 1\n else:\n if mount[i]>mount[i-1]:\n count += 1\nprint (count)', 'h = int(input())\nmount = [int(_) for _ in input().split()]\ncount = 0\nfor i in range(len):\n if i = 0:\n count += 1\... | ['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'] | ['s692795767', 's692795767', 's714552741', 's714552741', 's753071660', 's753071660', 's692795767', 's692795767', 's714552741', 's714552741', 's753071660', 's753071660', 's085251422', 's085251422', 's085251422', 's085251422'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [183, 183, 181, 181, 228, 228, 183, 183, 181, 181, 228, 228, 229, 229, 229, 229] |
p03072 | u373703188 | 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\nh = list(map(int, input().split()))\n\nfor i in range(1,n):\n if h[0] <= h[i] and h[i-1] <= h[i]:\n x += 1\nprint(x)', 'n = int(input())\nx = 0\nh = list(map(int, input().split()))\n\nfor i in range(1,n):\n if h[0] <= h[i] and h[i-1] <= h[i]:\n x += 1\nprint(x)', 'n = int(... | ['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', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer',... | ['s169123173', 's169123173', 's272417857', 's272417857', 's343933559', 's343933559', 's455610418', 's455610418', 's558255934', 's558255934', 's881500083', 's881500083', 's169123173', 's169123173', 's272417857', 's272417857', 's343933559', 's343933559', 's455610418', 's455610418', 's558255934', 's558255934', 's881500083... | [2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0, 3064.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, 18.0, 18.0, 19.0, 19.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 19.0, 19.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [144, 144, 147, 147, 129, 129, 144, 144, 144, 144, 170, 170, 144, 144, 147, 147, 129, 129, 144, 144, 144, 144, 170, 170, 151, 151, 151, 151] |
p03072 | u374240707 | 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()))\nsum = 0\nfor i in range(N):\n h = [H[j] for j in range(i+1)]\n if i == 0:\n sum += 1\n continue\n if H[i] == max(h):\n sum += 1\n print(h, H[i])\nprint(sum)', 'N = int(input())\nH = list(map(int, input().split()))\nsum = 0\nfor i ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s964866362', 's964866362', 's964866362', 's964866362', 's012566901', 's012566901', 's012566901', 's012566901'] | [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] | [233, 233, 233, 233, 214, 214, 214, 214] |
p03072 | u374802266 | 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()))\nb=0\nfor i in range(n):\n if a[i]>=max(a[0:i]):\n b+=1\nprint(b)', 'n=int(input())\na=list(map(int,input().split()))\nb=0\nfor i in range(n):\n if a[i]>=max(a[0:i]):\n b+=1\nprint(b)', 'n=int(input())\na=list(map(int,input().split()))\nb=0\nfor i i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s192280071', 's192280071', 's192280071', 's192280071', 's344764400', 's344764400', 's344764400', 's344764400'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [118, 118, 118, 118, 124, 124, 124, 124] |
p03072 | u375282392 | 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\nc = 0\nhighest = 0\nfor i in range(n):\n\tif highest <= h[i]:\n\t\tc += 1\n highest = h[i]\n\nprint(c)', 'n = int(input())\nh = list(map(int,input().split()))\n\nc = 0\nhighest = 0\nfor i in range(n):\n\tif highest <= h[i]:\n\t\tc += 1\n highest = ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s791093754', 's791093754', 's791093754', 's791093754', 's941166341', 's941166341', 's941166341', 's941166341'] | [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] | [152, 152, 152, 152, 146, 146, 146, 146] |
p03072 | u377158682 | 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 B():\n N = input()\n H = [int(i) for i in input().split()]\n max_high = max(H)\n max_index = H.index(max_high)\n\n count = 0\n count += H.count(max_high)\n\n pmax = H[0]\n for i in range(max_index):\n if pmax <= H[i]:\n pmax = H[i]\n count += 1\n \n p... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s633721771', 's633721771', 's633721771', 's633721771', 's491232049', 's491232049', 's491232049', 's491232049'] | [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] | [363, 363, 363, 363, 400, 400, 400, 400] |
p03072 | u382431597 | 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()))\ncount=0\nmax=0\nfor i in range(n-1):\n if h[i]>=max:\n max=h[i]\n count+=1\nprint(count)', 'import sys\nn=int(input())\nh=list(map(int, input().split()))\ncount=0\nmax=0\nfor i in range(n-1):\n if h[i]>=max:\n max=h[i]\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s395419057', 's395419057', 's395419057', 's395419057', 's377705736', 's377705736', 's377705736', 's377705736'] | [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] | [159, 159, 159, 159, 157, 157, 157, 157] |
p03072 | u385244248 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N,*H = map(int,open(0).read().split())\nt = 0\nh = 0\nfor i in H:\n if i >= h:\n t += 1\n else:\n h = i \nprint(t)', 'N,*H = map(int,open(0).read().split())\nt = 0\nh = 0\nfor i in H:\n if i >= h:\n t += 1\n else:\n h = i \nprint(t)', 'N,*H = map(int,open(0).read(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s058805045', 's058805045', 's425535475', 's425535475', 's058805045', 's058805045', 's425535475', 's425535475', 's322184699', 's322184699', 's322184699', 's322184699'] | [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, 148, 148, 133, 133, 148, 148, 128, 128, 128, 128] |
p03072 | u392938961 | 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... | ['5\n4 5 3 5 4', '5\n4 5 3 5 4', '5\n4 5 3 5 4', '5\n4 5 3 5 4', 'n = int(input())\nm = list(map(int, input().split()))\nmaxH = m[0]\nnumH = 0\nfor i in range(n):\n if m[i] >= maxH:\n maxH = m[i]\n numH += 1\nprint(numH)', 'n = int(input())\nm = list(map(int, input().split()))\nmaxH = m[0]\nnumH = 0\nf... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s457005724', 's457005724', 's457005724', 's457005724', 's989326105', 's989326105', 's989326105', 's989326105'] | [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] | [11, 11, 11, 11, 163, 163, 163, 163] |
p03072 | u393881437 | 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\nfor i in range(n):\n if h[i] == max(h[:i+1]) :\n ans = ans + 1\nprint(count)\n', 'n = int(input())\nh = list(map(int,input().split()))\n\ncount = 0\n\nfor i in range(n):\n if h[i] == max(h[:i+1]) :\n ans = ans + 1\nprint(count)\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s983486905', 's983486905', 's983486905', 's983486905', 's147584776', 's147584776', 's147584776', 's147584776'] | [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] | [148, 148, 148, 148, 152, 152, 152, 152] |
p03072 | u399721252 | 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())\nnum_list = [ int(v) for v in range(n)]\ns = 0\nfor i in range(n):\n\tif max(num_list[:i+1]) <= i:\n\t\ts += 1\nprint(s)', 'n = int(input())\nnum_list = [ int(v) for v in range(n)]\ns = 0\nfor i in range(n):\n\tif max(num_list[:i+1]) <= i:\n\t\ts += 1\nprint(s)', 'n = int(input())\nnum_list = [ int(v... | ['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'] | ['s234266647', 's234266647', 's256595475', 's256595475', 's556816201', 's556816201', 's234266647', 's234266647', 's256595475', 's256595475', 's556816201', 's556816201', 's686592501', 's686592501', 's686592501', 's686592501'] | [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] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [128, 128, 130, 130, 138, 138, 128, 128, 130, 130, 138, 138, 149, 149, 149, 149] |
p03072 | u405353249 | 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\ndef problem():\n N = int(input())\n H = list(map(int, input().split()))\n print(H)\n print(algorithm(N,H))\n\n\ndef algorithm(N: int, H):\n currentMax = H[0]\n counter = 1\n for i in range(1, N):\n if currentMax <= H[i]:\n counter += 1\n currentMax = H[i]\n \n return counter\n\npro... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s604965187', 's604965187', 's636423639', 's636423639', 's604965187', 's604965187', 's636423639', 's636423639', 's464093697', 's464093697', 's464093697', 's464093697'] | [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] | [305, 305, 284, 284, 305, 305, 284, 284, 292, 292, 292, 292] |
p03072 | u409795088 | 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()))\nc = 1\n\nbean = True\nfor i in range(1, n):\n bean = True\n for j in range(i, 0, i-1):\n if l[j-1] > l[i]:\n bean = False\n if bean:\n c += 1\n\nprint(c)\n', 'n = int(input())\nl = list(map(int, input().split()))\nc = 1\n\nbean = True\nfor i in rang... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s666900891', 's666900891', 's666900891', 's666900891', 's909008049', 's909008049', 's909008049', 's909008049'] | [3060.0, 3060.0, 3060.0, 3060.0, 3068.0, 3068.0, 3068.0, 3068.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 18.0, 18.0] | [210, 210, 210, 210, 211, 211, 211, 211] |
p03072 | u410118019 | 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()))\nc=1\nsm=s[0]\nfor i in range(n-1):\n if sm < s[i+1]:\n sm = s[i+1]\n c += 1\nprint(c)', 'n=int(input())\ns=list(map(int,input().split()))\nc=1\nsm=s[0]\nfor i in range(n-1):\n if sm < s[i+1]:\n sm = s[i+1]\n c += 1\nprint(c)', 'n=int(input())\ns=list(map... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s530702378', 's530702378', 's530702378', 's530702378', 's134673352', 's134673352', 's134673352', 's134673352'] | [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] | [134, 134, 134, 134, 135, 135, 135, 135] |
p03072 | u416758623 | 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())\nlistNum = [int(x) for x in input().split()]\nanswer = []\nfor i in range(n-1):\n if(listNum[0] <= listNum[i]):\n answer.append(i)\nprint(len(answer))', 'n = int(input())\nlistNum = [int(x) for x in input().split()]\nanswer = []\nfor i in range(n-1):\n if(listNum[0] <= listNum[i]):\n ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s080202459', 's080202459', 's487022289', 's487022289', 's080202459', 's080202459', 's487022289', 's487022289', 's308058348', 's308058348', 's308058348', 's308058348'] | [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] | [171, 171, 167, 167, 171, 171, 167, 167, 172, 172, 172, 172] |
p03072 | u420194640 | 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())\narr = input().split()\nnum = 1\ntmp = arr[0]\n\nfor i in range(N-1):\n\tif arr[i+1] > tmp:\n\t\tnum += 1\n\t\ttmp = arr[i+1]\n\nprint(num)\n', 'N = int(input())\narr = input().split()\nnum = 1\ntmp = arr[0]\n\nfor i in range(N-1):\n\tif arr[i+1] > tmp:\n\t\tnum += 1\n\t\ttmp = arr[i+1]\n\nprint(num)... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s863143278', 's863143278', 's863143278', 's863143278', 's615855201', 's615855201', 's615855201', 's615855201'] | [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, 142, 142, 142, 142] |
p03072 | u427984570 | 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())\nl = list(map(int, input().split()))\nmin = 0\ncnt = 0\nfor i in range(a):\n if min < l[i]:\n cnt += 1\n min = l[i]\nprint(cnt)', 'a = int(input())\nl = list(map(int, input().split()))\nmin = 0\ncnt = 0\nfor i in range(a):\n if min < l[i]:\n cnt += 1\n min = l[i]\nprint(cnt)', 'a = int(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s305559600', 's305559600', 's305559600', 's305559600', 's981585371', 's981585371', 's981585371', 's981585371'] | [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] | [143, 143, 143, 143, 145, 145, 145, 145] |
p03072 | u430223993 | 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(i) for i in input().split()]\nh = a[1:]\nnum = 1\nfor i in range(1,len(h)):\n if h[i] >= max(h[:i]):\n num += 1\n\nprint(num)', 'a = [int(i) for i in input().split()]\nh = a[1:]\nnum = 1\nfor i in range(1,len(h)):\n if h[i] >= max(h[:i]):\n num += 1\n\nprint(num)', 'a = [int(i) for i in i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s519539971', 's519539971', 's519539971', 's519539971', 's420154623', 's420154623', 's420154623', 's420154623'] | [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] | [137, 137, 137, 137, 145, 145, 145, 145] |
p03072 | u430483125 | 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()))\ncount = 1\n\n\nfor i in range(int(n)):\n if i!=0:\n for j in range(i):\n ok = 0\n if h[j]<=h[i]:\n ok +=1\n if ok == i:\n count +=1\n\nprint(count)\n', 'n = input()\nh = list(map(int, input().spl... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s153036849', 's153036849', 's153036849', 's153036849', 's690743779', 's690743779', 's690743779', 's690743779'] | [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] | [257, 257, 257, 257, 250, 250, 250, 250] |
p03072 | u430937688 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['input()\nlis = list(map(int, input().split()))\nprint(len([n for i, n in enumerate(lis[1:]) if n >= max(lis[:i + 1])]) + 1', 'input()\nlis = list(map(int, input().split()))\nprint(len([n for i, n in enumerate(lis[1:]) if n >= max(lis[:i + 1])]) + 1', 'input()\nlis = list(map(int, input().split()))\nprint(len([n for i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s143231629', 's143231629', 's143231629', 's143231629', 's128038230', 's128038230', 's128038230', 's128038230'] | [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] | [120, 120, 120, 120, 121, 121, 121, 121] |
p03072 | u439392790 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N=int(input())\nH=[int(x) for x in input().split()]\ncnt=1\ntall=H[0]\nfor i in range(1,n):\n if tall<=H[i]:\n tall=H[i]\n cnt+=1\nprint(cnt)\n', 'N=int(input())\nH=[int(x) for x in input().split()]\ncnt=1\ntall=H[0]\nfor i in range(1,n):\n if tall<=H[i]:\n tall=H[i]\n cnt+=1\nprint(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s971868322', 's971868322', 's971868322', 's971868322', 's136232157', 's136232157', 's136232157', 's136232157'] | [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] | [151, 151, 151, 151, 151, 151, 151, 151] |
p03072 | u441246928 | 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()))\nmaxi = 0\ncnt = 0\nfor H[i] in range( N ) :\n if H[i] >= maxi :\n cnt += 1\n maxi = H[i]\nprint( cnt )\n \n', 'N = int(input())\nH = list(map(int,input().split()))\nmaxi = 0\ncnt = 0\nfor H[i] in range( N ) :\n if H[i] >= maxi :\n cnt... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s146912254', 's146912254', 's146912254', 's146912254', 's077250246', 's077250246', 's077250246', 's077250246'] | [2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 20.0, 20.0, 20.0, 20.0] | [171, 171, 171, 171, 168, 168, 168, 168] |
p03072 | u444722572 | 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(1,N):\n for j in range(i):\n if H[i]<=H[j]:\n break\n count+=1\nprint(count+1)', 'N=int(input())\nH=list(map(int,input().split()))\ncount=0\nfor i in range(1,N):\n for j in range(i):\n if H[i]<=H[j]:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s247398914', 's247398914', 's247398914', 's247398914', 's306375551', 's306375551', 's306375551', 's306375551'] | [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] | [172, 172, 172, 172, 146, 146, 146, 146] |
p03072 | u448655578 | 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 = list(map(int, input().split()))\ncount = 0\nfor i in range(1, N):\n for j in range(0, i):\n if all(hotel[i] >= hotel[j]):\n count += 1\nprint(count+1)\n', 'N = int(input())\nhotel = list(map(int, input().split()))\ncount = 0\nfor i in range(1, N):\n for j in range(0, i):\n if al... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s321109263', 's321109263', 's875673517', 's875673517', 's321109263', 's321109263', 's875673517', 's875673517', 's296712723', 's296712723', 's296712723', 's296712723'] | [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] | [179, 179, 176, 176, 179, 179, 176, 176, 247, 247, 247, 247] |
p03072 | u455957070 | 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(n):\n if(H[0] <= H[i] and H[1] <= H[i] and H[i-1] <= H[i]):\n ans += 1\nprint(ans)\n', 'n = int(input())\nH = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n if(H[0] <= H[i] and H[1] <= H[i] and H[i-1] <= H[i]):\n an... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s734651881', 's734651881', 's734651881', 's734651881', 's217758682', 's217758682', 's217758682', 's217758682'] | [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] | [160, 160, 160, 160, 145, 145, 145, 145] |
p03072 | u456595418 | 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 = []\nn = int(input())\nl = [int(i) for i in input().split()] \nok = 0\n\nprint(l)\nfor i in range(1,n):\n\tfor j in range(i):\n\t\tif l[i] >= l[j]:\n\t\t\tif i -1 == j:\n\t\t\t\tok += 1\n\t\t\t\n\t\telse:\n\t\t\tbreak\n\nprint(ok + 1)', 'l = []\nn = int(input())\nl = [int(i) for i in input().split()] \nok = 0\n\np... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s508418168', 's508418168', 's508418168', 's508418168', 's582410437', 's582410437', 's582410437', 's582410437'] | [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] | [204, 204, 204, 204, 195, 195, 195, 195] |
p03072 | u463168630 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N=int(input())\nH=[int(x) for x in input().split()]\ncan_watch = 0\nfor i in range(N):\n if H[i] >= max(H[:i]):\n can_watch = can_watch + 1\n else:\n pass\nprint(can_watch)', 'N=int(input())\nH=[int(x) for x in input().split()]\ncan_watch = 0\nfor i in range(N):\n if H[i] >= max(H[:i]):\n can_watch = can_... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s866958356', 's866958356', 's866958356', 's866958356', 's786765963', 's786765963', 's786765963', 's786765963'] | [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] | [172, 172, 172, 172, 230, 230, 230, 230] |
p03072 | u471181540 | 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())\nlst = list(map(int, input().split()))\ncnt = 0\nfor i, e in enumerate(lst):\n flag = True\n ci = 0\n while ci < i:\n if e < lst[ci]:\n flag = False\n break\n ci += 1\n ci = 0\n if flag:\n print(e)\n cnt += 1\nprint(cnt)', 'n = int(inpu... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s170153005', 's170153005', 's170153005', 's170153005', 's525710439', 's525710439', 's525710439', 's525710439'] | [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] | [287, 287, 287, 287, 167, 167, 167, 167] |
p03072 | u474579514 | 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 = [int(n) for n in input().split()]\n\n maxHeight = max(H)\n counter = 1\n for i, v in enumerate(H):\n if i == 0:\n continue\n if v < maxHeight:\n counter += 1\n elif v == maxHeight:\n break\n\n for i, v in enum... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s549143849', 's549143849', 's582303827', 's582303827', 's549143849', 's549143849', 's582303827', 's582303827', 's756464106', 's756464106', 's756464106', 's756464106'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [466, 466, 386, 386, 466, 466, 386, 386, 334, 334, 334, 334] |
p03072 | u477977638 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int,input().split()))\na=0\ncnt=1\nfor i in range(1,n):\n if h[i]>=a:\n cnt+=1\n a=max(a,h[i-1])\nprint(cnt)', 'n=int(input())\nh=list(map(int,input().split()))\na=0\ncnt=1\nfor i in range(1,n):\n if h[i]>=a:\n cnt+=1\n a=max(a,h[i-1])\nprint(cnt)', 'n=int(input())\nh=list(map(int... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s718544331', 's718544331', 's718544331', 's718544331', 's916143526', 's916143526', 's916143526', 's916143526'] | [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] | [132, 132, 132, 132, 133, 133, 133, 133] |
p03072 | u482019060 | 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 = 1\n\nfor i in range(1, N):\n if H[i] >= max(H[:i]:\n cnt += 1\n\nprint(cnt)\n', 'N = int(input())\nH = list(map(int, input().split()))\n\ncnt = 1\n\nfor i in range(1, N):\n if H[i] >= max(H[:i]:\n cnt += 1\n\nprint(cnt)\n', 'N = int(in... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s992702747', 's992702747', 's992702747', 's992702747', 's997955740', 's997955740', 's997955740', 's997955740'] | [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 | u483304397 | 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()\nHlist = list(map(int, input().split()))\nimport numpy\na = numpy.argsort(Hlist)\ncount=0\nwhile True:\n if a[-1]==0:\n count+=1\n break\n else:\n m = a.pop(-1)\n a = [i for i in a if a[-1] >= i]\n count+=1\nprint(count)', 'N = input()\nHlist = list(map(int, input(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s773760431', 's773760431', 's773760431', 's773760431', 's510897813', 's510897813', 's510897813', 's510897813'] | [12468.0, 12468.0, 12468.0, 12468.0, 2940.0, 2940.0, 2940.0, 2940.0] | [149.0, 149.0, 149.0, 149.0, 17.0, 17.0, 17.0, 17.0] | [260, 260, 260, 260, 205, 205, 205, 205] |
p03072 | u483885886 | 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\nsum = 1\nfor i in range(1,n):\n for s in range(i-1,-1,-1):\n if h[i]>=h[s]:\n count+=1\n if count==i:\n sum+=1\nprint(sum)', 'n = int(input())\nh = list(map(int,input().split()))\ncount = 0\nsum = 1\nfor i in range(1,n):\n for s in rang... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Run... | ['s047669854', 's047669854', 's131481848', 's131481848', 's153069637', 's153069637', 's312954921', 's312954921', 's325837020', 's325837020', 's542407247', 's542407247', 's569288744', 's569288744', 's683464782', 's683464782', 's721011869', 's721011869', 's779142758', 's779142758', 's800876012', 's800876012', 's821118619... | [3060.0, 3060.0, 3064.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.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, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3064.0, 3064.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, 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, 1... | [193, 193, 189, 189, 197, 197, 198, 198, 188, 188, 194, 194, 195, 195, 188, 188, 188, 188, 195, 195, 192, 192, 193, 193, 189, 189, 194, 194, 192, 192, 193, 193, 189, 189, 197, 197, 198, 198, 188, 188, 194, 194, 195, 195, 188, 188, 188, 188, 195, 195, 192, 192, 193, 193, 189, 189, 194, 194, 192, 192, 126, 126, 126, 126] |
p03072 | u483896240 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['# -*- coding: utf-8 -*-\nN = int(input())\nlst = list(map(int,input().split()))\n\nans = 0\nfor i in range(N):\n flag = True\n for j in range(N-1):\n if lst[j] > lst[i]:\n flag = False \n if flag:\n ans = ans + 1\n\nprint(sum)', '# -*- coding: utf-8 -*-\nN = int(input())\nlst = list(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s998852106', 's998852106', 's998852106', 's998852106', 's427443187', 's427443187', 's427443187', 's427443187'] | [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] | [247, 247, 247, 247, 190, 190, 190, 190] |
p03072 | u489124637 | 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())\nh = [int(s) for s in H]\nn = 1\nfor i in range(1, N):\n if h[i] == h[0:i+1]:\n n = n+1\nprint(n)', 'N = int(input())\nH = list(input().split())\nh = [int(s) for s in H]\nn = 1\nfor i in range(1, N):\n if h[i] == h[0:i+1]:\n n = n+1\nprint(n)', 'N = int(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s252568722', 's252568722', 's252568722', 's252568722', 's278305530', 's278305530', 's278305530', 's278305530'] | [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, 149, 149, 149, 149] |
p03072 | u500589232 | 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(item) for item in input().split()]\n \nc = 0 #count\n \nfor i in range(n):\n flag=0\n if i==0:\n c+=1\n else:\n for j in range(i-1):\n if h[j] > h[i]:\n flag=1\n break\n if flag == 0:\n \tc+=1\nprint(c)', 'n = int(input())\nh = [int(item) for item in in... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s557751591', 's557751591', 's557751591', 's557751591', 's422135017', 's422135017', 's422135017', 's422135017'] | [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] | [250, 250, 250, 250, 241, 241, 241, 241] |
p03072 | u503111914 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['N = int(input())\nH = list(map(int,input().split()))\nresult = 1\nfor i in range(1,len(H)):\n if H[i] < H[i+1]:\n result += 1\n else:\n break\nprint(result)', 'N = int(input())\nH = list(map(int,input().split()))\nresult = 1\nfor i in range(1,len(H)):\n if H[i] < H[i+1]:\n result += 1\n else:\n break\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s909531650', 's909531650', 's909531650', 's909531650', 's327285837', 's327285837', 's327285837', 's327285837'] | [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] | [156, 156, 156, 156, 172, 172, 172, 172] |
p03072 | u505830998 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['# -*- coding: utf-8 -*-\n\nimport sys\ninput = sys.stdin.readline\n\ndef io_generator():\n\treturn input()\n\n#+++++++++++++++++++\n\ndef main(io):\n\tn=int(io())\n\ths = list(map(int, io().split()))\n\tmax_h=0\n\tfor i, h in enumerate(hs):\n\t\tif h < max_h:\n\t\t\treturn i\n\t\t\n\t\tmax_h=max(max_h, h)\n\treturn n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s987286804', 's987286804', 's987286804', 's987286804', 's283699189', 's283699189', 's283699189', 's283699189'] | [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] | [382, 382, 382, 382, 373, 373, 373, 373] |
p03072 | u509405951 | 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 = [0]\nfor i in range(N):\n h = list.append(int(input()))\nmax = 0\nfor i in range(n):\n if max <= h[i]:\n max = h[i]\n count += 1\nprint(count)', 'N = int(input())\nh = [0]\nfor i in range(N):\n h = list.append(int(input()))\nmax = 0\nfor i in range(n):\n if max <= h[i]:... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Erro... | ['s566619948', 's566619948', 's604905640', 's604905640', 's648279407', 's648279407', 's734002166', 's734002166', 's738142109', 's738142109', 's809263264', 's809263264', 's837883195', 's837883195', 's839452779', 's839452779', 's566619948', 's566619948', 's604905640', 's604905640', 's648279407', 's648279407', 's734002166... | [3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 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, 18.0, 18.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, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [175, 175, 177, 177, 167, 167, 177, 177, 144, 144, 155, 155, 148, 148, 149, 149, 175, 175, 177, 177, 167, 167, 177, 177, 144, 144, 155, 155, 148, 148, 149, 149, 160, 160, 160, 160] |
p03072 | u509516894 | 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()]\nx = 1\nif n==1:\n\tprint(x)\nelse:\n\tif h[1] >= h[0]:\n\t\tx += 1\n\t\n\tfor i in range(2, n):\n\t\thh=h[0:i-1]\n \tif h[i] >= max(hh):\n \tx += 1\n\tprint(x)', 'n = int(input())\nh = [int(i) for i in input().split()]\nx = 1\nif n==1:\n\tprint(x)\nel... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s342336957', 's342336957', 's342336957', 's342336957', 's862462304', 's862462304', 's862462304', 's862462304'] | [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] | [202, 202, 202, 202, 245, 245, 245, 245] |
p03072 | u514299323 | 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("H").split(" ")))\n\nm=0\nnum = 0\nfor h in H:\n if h>=m:\n num +=1\n m=h\n\nprint(num)\n', 'N=int(input("N"))\nH = list(map(int, input("H").split(" ")))\n\nm=0\nnum = 0\nfor h in H:\n if h>=m:\n num +=1\n m=h\n\nprint(num)\n', 'N=int(input(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s855841839', 's855841839', 's855841839', 's855841839', 's190651015', 's190651015', 's190651015', 's190651015'] | [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, 132, 132, 132, 132] |
p03072 | u515364861 | 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=[]\nc=1\nfor i in range(n):\n h=int(input())\n a.append(h)\nfor b in range(n-1):\n if a[b] <= a[b+1]:\n c+=1\nprint(c)', 'n= int(input())\na=[]\nc=1\nfor i in range(n):\n h=int(input())\n a.append(h)\nfor b in range(n-1):\n if a[b] <= a[b+1]:\n c+=1\nprint(c)', 'n= i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s133641037', 's133641037', 's777640831', 's777640831', 's133641037', 's133641037', 's777640831', 's777640831', 's834234575', 's834234575', 's834234575', 's834234575'] | [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] | [144, 144, 167, 167, 144, 144, 167, 167, 139, 139, 139, 139] |
p03072 | u516272298 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = list(map(int,input().split()))\na = 0\nfor i in range(len(h)):\n if h[0] < h[i]:\n a += 1\nprint(a+1)\n ', 'n = int(input())\nh = list(map(int,input().split()))\na = 0\nfor i in range(len(h)):\n if h[0] < h[i]:\n a += 1\nprint(a+1)\n ', 'n = int(input())\nh = list(map(i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s919609934', 's919609934', 's919609934', 's919609934', 's560382238', 's560382238', 's560382238', 's560382238'] | [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] | [132, 132, 132, 132, 136, 136, 136, 136] |
p03072 | u519130434 | 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())\nnums = list(map(int, gen.__next__().split()))\n\nmaxx = 0\ncount = 0\nfor n in nums:\n if n>=maxx:\n maxx = n\n count += 1\n\nprint(count)', '\nN = int(input())\nnums = list(map(int, gen.__next__().split()))\n\nmaxx = 0\ncount = 0\nfor n in nums:\n if n>=maxx:\n maxx = n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s601936791', 's601936791', 's601936791', 's601936791', 's218574256', 's218574256', 's218574256', 's218574256'] | [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] | [164, 164, 164, 164, 158, 158, 158, 158] |
p03072 | u525404340 | 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\nfirst = H[0]\nfor i, h in enumerate(H[1:]):\n if first > h:\n break\n first = h\nprint(i+1)', 'N = int(input())\nH = list(map(int, input().split()))\n\nfirst = H[0]\nfor i, h in enumerate(H[1:]):\n if first > h:\n break\n first = h\npr... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s229278445', 's229278445', 's229278445', 's229278445', 's174852169', 's174852169', 's174852169', 's174852169'] | [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] | [153, 153, 153, 153, 252, 252, 252, 252] |
p03072 | u527261492 | 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\nif n==1:\n print(1)\nelse:\n for i in range(1,n):\n if all(h[i]>=h[j] for j in range(i-1)):\n cnt+=1\n print(cnt)\n', 'n=int(input())\nh=list(map(int,input().split()))\ncnt=1\nif n==1:\n print(1)\nelse:\n for i in range(1,n):\n if all(h[i]>=h[j] for j... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s507663941', 's507663941', 's878814142', 's878814142', 's507663941', 's507663941', 's878814142', 's878814142', 's137195431', 's137195431', 's137195431', 's137195431'] | [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] | [169, 169, 138, 138, 169, 169, 138, 138, 171, 171, 171, 171] |
p03072 | u531258707 | 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()\nmaxH = H[0]\nlook = 1\nfor i in range(N-1):\n\tif N == 1:\n \tprint(1)\n\telif H[i+1] >= maxH:\n \tlook = look + 1\n \tmaxH = H[i+1]\n \telse:\n \tmaxH = maxH\nprint(look)', 'N = int(input())\nH = input().split()\nmaxH = H[0]\nlook = 1\nfor i in range(N-1):\n\tif N ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s336430413', 's336430413', 's336430413', 's336430413', 's752932659', 's752932659', 's752932659', 's752932659'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [204, 204, 204, 204, 176, 176, 176, 176] |
p03072 | u531813438 | 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\nk= 1\nfor i in range(1,N):\n if sorted(H[0:i])[-1]<H[i]:\n k=k+1\n else:\n k=k\nprint(k)', 'N = int(input())\nH = list(map(int, input().split())) \n\nk= 1\nfor i in range(1,N):\n if sorted(H[0:i])[-1]<H[i]:\n k=k+1\n else:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s336385791', 's336385791', 's336385791', 's336385791', 's509931445', 's509931445', 's509931445', 's509931445'] | [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] | [157, 157, 157, 157, 159, 159, 159, 159] |
p03072 | u534308356 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\ndata = list(map(int, input().split()))\n\nans = 1\nmax_ = data[0]\nfor i in range(1, n-1):\n if max_ <= data[i]:\n max_ = data[i]\n ans += 1\n\nprint(ans)\n', 'n = int(input())\ndata = list(map(int, input().split()))\n\nans = 1\nmax_ = data[0]\nfor i in range(1, n-1):\n if max_ <... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s976942756', 's976942756', 's976942756', 's976942756', 's098930100', 's098930100', 's098930100', 's098930100'] | [9024.0, 9024.0, 9024.0, 9024.0, 9176.0, 9176.0, 9176.0, 9176.0] | [24.0, 24.0, 24.0, 24.0, 23.0, 23.0, 23.0, 23.0] | [180, 180, 180, 180, 178, 178, 178, 178] |
p03072 | u536242462 | 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()))\ncount = 0\nmax = 0\nfor h in H:\n if max<=h:\n count++\n max=h\n \nprint(count)', 'N = input()\nH = list(map(int,input().split()))\ncount = 0\nmax = 0\nfor h in H:\n if max<=h:\n count++\n max=h\n \nprint(count)', 'N = input()\nH = list(map(int,inpu... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s263638210', 's263638210', 's263638210', 's263638210', 's868626394', 's868626394', 's868626394', 's868626394'] | [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] | [129, 129, 129, 129, 130, 130, 130, 130] |
p03072 | u537234062 | 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 = list(map(int, input().split()))\n\nanswer = 0\nfor i, hi in enumerate(hs)[1:]:\n if max(hs[:i]) <= hs[i]:\n answer += 1\n\nprint(answer)', 'n = int(input())\nhs = list(map(int, input().split()))\n\nanswer = 0\nfor i, hi in enumerate(hs)[1:]:\n if max(hs[:i]) <= hs[i]:\n answer += 1\n\np... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s535139425', 's535139425', 's535139425', 's535139425', 's609782889', 's609782889', 's609782889', 's609782889'] | [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] | [155, 155, 155, 155, 147, 147, 147, 147] |
p03072 | u539517139 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input())\nh=list(map(int,input().split()))\nc=1\nfor i in range(1,n):\n if h[i]>=max(h[0:i-1]):\n c+=1\nprint(c)', 'n=int(input())\nh=list(map(int,input().split()))\nc=1\nfor i in range(1,n):\n if h[i]>=max(h[0:i-1]):\n c+=1\nprint(c)', 'n=int(input())\nh=list(map(int,input().split()))\nc=1\nfor i in ra... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s846472923', 's846472923', 's846472923', 's846472923', 's286453975', 's286453975', 's286453975', 's286453975'] | [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] | [116, 116, 116, 116, 122, 122, 122, 122] |
p03072 | u542605091 | 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\nlevel = 0\nfor i in range(0, N):\n if H[i] > level:\n level = H[i]\n count += 1\nreturn count', 'N = int(input())\nH = list(map(int,input().split))\ncount = 0\nlevel = 0\nfor i in range(0, N):\n if H[i] > level:\n level = H[i]\n... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s567387001', 's567387001', 's690736328', 's690736328', 's567387001', 's567387001', 's690736328', 's690736328', 's558598138', 's558598138', 's558598138', 's558598138'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [165, 165, 151, 151, 165, 165, 151, 151, 152, 152, 152, 152] |
p03072 | u544324732 | 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_str = input().split()\nH_list_int = list(map(int,H_list_str))\n\nM = max(H_list_int)\nH_Count = 0\nfor i in range(N):\n if H_list_int[i] == M:\n H_Count += 1\n\nprint(H_Count)', 'N = int(input())\n\nH_list_str = input().split()\nH_list_int = list(map(int,H_list_str))\n\nM = max(H_... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s037181854', 's037181854', 's037181854', 's037181854', 's764322545', 's764322545', 's764322545', 's764322545'] | [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] | [201, 201, 201, 201, 332, 332, 332, 332] |
p03072 | u549757728 | 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)]\nresult = 1\n\nfor i in range(1,n):\n if h[i] >= h[i-1]:\n \tresult = result + 1\n \nprint(result)', 'n = int(input())\nh = [int(input()) for i in range(n)]\nresult = 1\n\nfor i in range(1,n):\n if h[i] >= h[i-1]:\n \tresult = result + 1\n \npri... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s870888871', 's870888871', 's907585146', 's907585146', 's870888871', 's870888871', 's907585146', 's907585146', 's307460358', 's307460358', 's307460358', 's307460358'] | [3056.0, 3056.0, 3060.0, 3060.0, 3056.0, 3056.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, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [153, 153, 194, 194, 153, 153, 194, 194, 189, 189, 189, 189] |
p03072 | u552209394 | 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... | ['li = list(map(int,input().split()))\ni=0\nc=0\na=0\nfor n in li:\n while c<i:\n if li[c]>n:\n break\n else:\n a+=1\n c+=1\n i+=1\nprint(a)\n ', 'li = list(map(int,input().split()))\ni=0\nc=0\na=0\nfor n in li:\n while c<i:\n if li[c]>n:\n break\n else:\n a+=1\n c+=1\n i+=1... | ['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'] | ['s064068361', 's064068361', 's651244911', 's651244911', 's778553204', 's778553204', 's064068361', 's064068361', 's651244911', 's651244911', 's778553204', 's778553204', 's730646016', 's730646016', 's730646016', 's730646016'] | [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] | [152, 152, 177, 177, 178, 178, 152, 152, 177, 177, 178, 178, 178, 178, 178, 178] |
p03072 | u554954744 | 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]>=max(H[1:i-1]):\n ans+=1\nprint(ans+1)', 'N=int(input())\nH=list(map(int,input().split()))\nans=0\nfor i in range(1,N):\n if H[i]>=max(H[1:i-1]):\n ans+=1\nprint(ans+1)', 'N=int(input())\nH=list(map(int,input()... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s065168478', 's065168478', 's932704435', 's932704435', 's065168478', 's065168478', 's932704435', 's932704435', 's219723977', 's219723977', 's219723977', 's219723977'] | [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, 19.0, 19.0, 19.0, 19.0] | [130, 130, 125, 125, 130, 130, 125, 125, 127, 127, 127, 127] |
p03072 | u556225812 | 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())\ncnt=1\nH=list(map(int,input().split()))\nfor i in range(N):\n for j in range(i):\n if j-1 > 0:\n if H[i] >= H[j-1]:\n cnt+=1\nprint(cnt)\n ', 'N=int(input())\ncnt=1\nH=list(map(int,input().split()))\nfor i in range(N):\n for j in range(i):\n if ... | ['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'] | ['s221027681', 's221027681', 's526993160', 's526993160', 's886916481', 's886916481', 's221027681', 's221027681', 's526993160', 's526993160', 's886916481', 's886916481', 's336778142', 's336778142', 's336778142', 's336778142'] | [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] | [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] | [193, 193, 191, 191, 220, 220, 193, 193, 191, 191, 220, 220, 168, 168, 168, 168] |
p03072 | u559416752 | 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())\ncount = 0\nview = 0\nfor i in range(1, n):\n for con in h:\n if con <= h[i]:\n count += 1\n if n == count:\n view += 1\nprint(view)', 'n = int(input())\nh = map(int, input().split())\ncount = 0\nview = 0\nfor i in range(1, n):\n for co... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s158341827', 's158341827', 's158341827', 's158341827', 's362238988', 's362238988', 's362238988', 's362238988'] | [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] | [201, 201, 201, 201, 139, 139, 139, 139] |
p03072 | u560889512 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n=int(input().split())\narr=list(map(int,input().split()))\nres=[arr[0]]\nfor i in range(1,n):\n if arr[i]>=res[-1]:\n res.append(arr[i])\nprint(len(res))', 'n=int(input().split())\narr=list(map(int,input().split()))\nres=[arr[0]]\nfor i in range(1,n):\n if arr[i]>=res[-1]:\n res.append(arr[i])\nprint(len(res... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s268701313', 's268701313', 's268701313', 's268701313', 's826023414', 's826023414', 's826023414', 's826023414'] | [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] | [152, 152, 152, 152, 112, 112, 112, 112] |
p03072 | u560988566 | 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()\n\nans = 1\nm = n - 1\nhigh = int(h[0])\n\nfor i in range(m):\n if int(h[i+1]) >= high:\n ans += 1\n high = int(h[i+1])\n else:\n continue\n\nprint(ans)', 'n = int(input())\nh = input().split()\n\nans = 1\nm = n - 1\nhigh = int(h[0])\n\nfor i in range(m):\n if int(h[... | ['Runtime Error', 'Runtime Error', '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'... | ['s040846145', 's040846145', 's091322947', 's091322947', 's293659047', 's293659047', 's357764118', 's357764118', 's438572399', 's438572399', 's720194055', 's720194055', 's997520950', 's997520950', 's040846145', 's040846145', 's091322947', 's091322947', 's293659047', 's293659047', 's357764118', 's357764118', 's438572399... | [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, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 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] | [188, 188, 234, 234, 208, 208, 471, 471, 236, 236, 207, 207, 153, 153, 188, 188, 234, 234, 208, 208, 471, 471, 236, 236, 207, 207, 153, 153, 213, 213, 213, 213] |
p03072 | u562550538 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh=[int(x) for x in input().split()]\ncount=0\nmax=h[0]\nfor i in range(n-1):\n if max < h[i+1]:\n max=h[i]\n count+=1\nprint(count)', 'n = int(input())\nh=[int(x) for x in input().split()]\ncount=0\nmax=h[0]\nfor i in range(n-1):\n if max < h[i+1]:\n max=h[i]\n coun... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s126511321', 's126511321', 's126511321', 's126511321', 's429335343', 's429335343', 's429335343', 's429335343'] | [2940.0, 2940.0, 2940.0, 2940.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] | [158, 158, 158, 158, 161, 161, 161, 161] |
p03072 | u563002343 | 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... | ['count = int(input())\nl = []\nm = 0\nc = 0\nfor i in range(count):\n val = int(input())\n m = max(m, val)\n if val >= m:\n c = c + 1\nprint(c)\n ', 'count = int(input())\nl = []\nm = 0\nc = 0\nfor i in range(count):\n val = int(input())\n m = max(m, val)\n if val >= m:\n c = c + 1\nprint(c)\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s996854914', 's996854914', 's996854914', 's996854914', 's316111381', 's316111381', 's316111381', 's316111381'] | [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] | [151, 151, 151, 151, 144, 144, 144, 144] |
p03072 | u567124995 | 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\na = 0\nb = 0\n\nfor i in range(n):\n for j in range(0, i-1):\n if h[j] >= h[i]:\n break\n else:\n a = a + 1\n a = 0\n if a == i:\n b = b + 1\n\nprint(b)', 'n = int(input())\nh = list(map(int, input().split()))\n\na = 0\nb = 0\n\nfor i in r... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s702203948', 's702203948', 's702203948', 's702203948', 's526167048', 's526167048', 's526167048', 's526167048'] | [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] | [215, 215, 215, 215, 128, 128, 128, 128] |
p03072 | u571028333 | 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, B = map(int, input().split())\n\npattern1 = A+A-1\npattern2 = A+B\npattern3 = B+B-1\n\nprint(max(pattern1, pattern2, pattern3))', 'A, B = map(int, input().split())\n\npattern1 = A+A-1\npattern2 = A+B\npattern3 = B+B-1\n\nprint(max(pattern1, pattern2, pattern3))', 'A, B = map(int, input().split())\n\npattern1 = A+A... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s068787495', 's068787495', 's068787495', 's068787495', 's832612976', 's832612976', 's832612976', 's832612976'] | [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] | [124, 124, 124, 124, 175, 175, 175, 175] |
p03072 | u577189232 | 2,000 | 1,048,576 | There are N mountains ranging from east to west, and an ocean to the west. At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns. The height of the i-th mountain from the west is H_i. You can certainly see the ocean from the inn at the top of the westmost mountain. F... | ['n = int(input())\nh = list(map(int, input().split()))\nhigh = h[0]\nans = 1\nfor i in range(n):\n if high <= h[i]:\n ans += 1\n high = h[i]\n\nprint(ans)', 'n = int(input())\nh = list(map(int, input().split()))\nhigh = h[0]\nans = 1\nfor i in range(n):\n if high <= h[i]:\n ans += 1\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s123513800', 's123513800', 's123513800', 's123513800', 's728108739', 's728108739', 's728108739', 's728108739'] | [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] | [161, 161, 161, 161, 163, 163, 163, 163] |
p03072 | u577658696 | 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 = input()\n s = input()\n raw_list = list(map(int, raw_list))\n\n max = raw_list[0]\n count = 1\n\n for i in range(1,len(raw_list)):\n if raw_list[i] >= max:\n count += 1\n max = raw_list[i]\n print (count)\n\nif __name__ == "__main__":\n main()', '... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s436023346', 's436023346', 's436023346', 's436023346', 's944819306', 's944819306', 's944819306', 's944819306'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0, 18.0, 20.0, 20.0, 20.0, 20.0] | [299, 299, 299, 299, 300, 300, 300, 300] |
p03072 | u580362735 | 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 flag = 0\n for j in range(i):\n if H[i]<H[j]:\n flag=1\n if flag == 0:\n ans+=1\nprint(ans)\n', 'N = int(input())\nH = list(map(int,input().split()))\nans = 1\nfor i in range(1,N-1):\n flag = 0\n for j in range(i):... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted', 'Accepted', 'Accepted', 'Accepted'] | ['s654464547', 's654464547', 's978186437', 's978186437', 's654464547', 's654464547', 's978186437', 's978186437', 's526252551', 's526252551', 's526252551', 's526252551'] | [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] | [184, 184, 198, 198, 184, 184, 198, 198, 182, 182, 182, 182] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.