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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02556 | u367319568 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N = int(input())\n\nXmax = -2*10**9\nYmax = -2*10**9\nXmin = 2*10**9\nYmin = 2*10**9\n\n\nfor i in range(N):\n x, y = map(int, input().split())\n if (x + y >= Xmax):\n Xmax = x + y\n if (x + y =< Xmin):\n Xmin = x + y\n if (x - y >= Ymax):\n Ymax = x - y\n if (x - y =< Ymin):\n Ymin = x - y\n\nprint(max(Xmax - Xmin, Ymax - Ymin))', 'N = int(input())\n\nXmax = -2*10**9\nYmax = -2*10**9\nXmin = 2*10**9\nYmin = 2*10**9\n\n\nfor i in range(N):\n x, y = map(int, input().split())\n if (x + y >= Xmax):\n Xmax = x + y\n if (x + y <= Xmin):\n Xmin = x + y\n if (x - y >= Ymax):\n Ymax = x - y\n if (x - y <= Ymin):\n Ymin = x - y\n\nprint(max(Xmax - Xmin, Ymax - Ymin))'] | ['Runtime Error', 'Accepted'] | ['s488331960', 's809714749'] | [8960.0, 9216.0] | [26.0, 468.0] | [355, 355] |
p02556 | u377989038 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['n = int(input())\nxy = [list(map(int, input().split())) for _ in range(n)]\nyx = [[y, x] for x, y in xy]\nxy.sort()\nyx.sort()\nyx = [[x, y] for y, x in yx]\n\nans = 0\ntmp = [xy[0], xy[-1], yx[0], yx[-1]]\nprint(yx)\nfor x, y in tmp:\n for x1, y1 in tmp:\n ans = max(ans, abs(x - x1) + abs(y - y1))\nprint(ans)', 'n = int(input())\nxy = [list(map(int, input().split())) for _ in range(n)]\n\nf0 = [x - y for x, y in xy]\nf1 = [x + y for x, y in xy]\n\nf0.sort()\nf1.sort()\n\nans = max((f0[-1] - f0[0]), (f1[-1] - f1[0]))\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s695424296', 's161956576'] | [85584.0, 61952.0] | [1707.0, 615.0] | [308, 210] |
p02556 | u380791283 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['n = int(input())\nhidarisita=2*10**9\nmigiue=0\nmigisita=2*10**9\nhidariue=-10**9\nx=[]\nfor i in range(0,n):\n x.append(list(map(int, input().split())))\n \nfor i in range(0,n):\n minlocal=x[i][0]+x[i][1]\n if minlocal<hidarisita:\n hidarisita=minlocal\nfor i in range(0,n):\n maxlocal=x[i][0]+x[i][1]\n if maxlocal>migiue:\n migiue=maxlocal\nfor i in range(0,n):\n minlocal=-x[i][0]+x[i][1]\n if minlocal<migisita:\n migsita=minlocal\nfor i in range(0,n):\n local=-x[i][0]+x[i][1]\n if maxlocal>hidariue:\n hidariue=maxlocal\naa=migiue-hidarisita\nbb=hidariue-migsita\nprint(max(aa,bb))', 'n = int(input())\nhidarisita=2*10**9\nmigiue=0\nmigisita=2*10**9\nhidariue=0\nx=[]\nfor i in range(0,n):\n x.append(list(map(int, input().split())))\n \nfor i in range(0,n):\n minlocal=x[i][0]+x[i][1]\n if minlocal<hidarisita:\n hidarisita=minlocal\nfor i in range(0,n):\n maxlocal=x[i][0]+x[i][1]\n if maxlocal>migiue:\n migiue=maxlocal\nfor i in range(0,n):\n minlocal=-x[i][0]+x[i][1]\n if minlocal<migisita:\n migsita=minlocal\nfor i in range(0,n):\n local=-x[i][0]+x[i][1]\n if maxlocal>hidariue:\n hidariue=maxlocal\naa=migiue-hidarisita\nbb=hidariue-migsita\nprint(max(aa,bb))', 'n = int(input())\nhidarisita=2*10**9\nmigiue=0\nmigisita=2*10**9\nhidariue=-10**9\nx=[]\nfor i in range(0,n):\n x.append(list(map(int, input().split())))\n \nfor i in range(0,n):\n minlocal=x[i][0]+x[i][1]\n if minlocal<hidarisita:\n hidarisita=minlocal\n if minlocal==hidarisita:\n hidarisita2=minlocal\nfor i in range(0,n):\n maxlocal=x[i][0]+x[i][1]\n if maxlocal>migiue:\n migiue=maxlocal\n if maxlocal==migiue:\n migiue2=maxlocal\nfor i in range(0,n):\n minlocal=-x[i][0]+x[i][1]\n if minlocal<migisita:\n migisita=minlocal\n if minlocal==migisita:\n migisita2=minlocal\nfor i in range(0,n):\n maxlocal=-x[i][0]+x[i][1]\n if maxlocal>hidariue:\n hidariue=maxlocal\n if maxlocal==hidariue:\n hidariue2=maxlocal\naa=migiue-hidarisita\nab=migiue-hidarisita2\nba=migiue2-hidarisita\nbb=migiue2-hidarisita2\ncc=hidariue-migisita\ncd=hidariue-migisita2\ndc=hidariue2-migisita\ndd=hidariue2-migisita2\nprint(max(aa,ab,ba,bb,cc,cd,dc,dd))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s296731071', 's703957037', 's632147277'] | [45352.0, 45380.0, 45360.0] | [626.0, 620.0, 634.0] | [647, 642, 1020] |
p02556 | u395313349 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['def main():\n n = int(input())\n a_li , b_li = [] , []\n for _ in range(n):\n x , y = int(input())\n a_li.append(x + y)\n b_li.append(x - y)\n print(max(max(a_li) - min(a_li), max(b_li) - min(b_li)))\n\nif __name__ == "__main__":\n main()', 'def main():\n n = int(input())\n a_li , b_li = [] , []\n for _ in range(n):\n x , y = map(int,input().split())\n a_li.append(x + y)\n b_li.append(x - y)\n print(max(max(a_li) - min(a_li), max(b_li) - min(b_li)))\n \nif __name__ == "__main__":\n main()'] | ['Runtime Error', 'Accepted'] | ['s615034853', 's583845169'] | [9044.0, 24556.0] | [26.0, 382.0] | [244, 255] |
p02556 | u401481862 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N = int(input())\nx = [] * N\ny = [] * N\nfor i in range(N):\n a, b = list(map(int, input().split()))\n x.append(a)\n y.append(b)\nd = 0\nma = x[0] + y[0]\nima = 0\nmi = x[0] + y[0]\nimi = 0\nfor i in range(N):\n if x[i] + y[i] < mi:\n mi = x[i] + y[i]\n imi = i\n if x[i] + y[i] > ma:\n ma = x[i] + y[i]\n ima = i\nprint (ima, imi)\nd = abs(x[ima] - x[imi]) + abs(y[ima] - y[imi])\nprint(d)', 'N = int(input())\nx = [] * N\ny = [] * N\nfor i in range(N):\n a, b = list(map(int, input().split()))\n x.append(a)\n y.append(b)\nd = 0\nma = x[0] + y[0]\nima = 0\nmi = x[0] + y[0]\nimi = 0\nfor i in range(N):\n if x[i] + y[i] < mi:\n mi = x[i] + y[i]\n imi = i\n if x[i] + y[i] > ma:\n ma = x[i] + y[i]\n ima = i\nd1 = abs(x[ima] - x[imi]) + abs(y[ima] - y[imi])\nma = - x[0] + y[0]\nima2 = 0\nmi = - x[0] + y[0]\nimi2 = 0\nfor i in range(N):\n if -x[i] + y[i] < mi:\n mi = -x[i] + y[i]\n imi2 = i\n if -x[i] + y[i] > ma:\n ma = -x[i] + y[i]\n ima2 = i\nd2 = abs(x[ima2] - x[imi2]) + abs(y[ima2] - y[imi2])\nif d1 > d2:\n print(d1)\nelse:\n print(d2)'] | ['Wrong Answer', 'Accepted'] | ['s123587569', 's612295320'] | [25012.0, 24888.0] | [474.0, 530.0] | [413, 700] |
p02556 | u408325839 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N = int(input())\nv = [list(map(input().split)) for i in range(N)]\nv.sort(key = lambda x:abs(x[0]) + abs(x[1]))\nd = abs(v[0][0] - v[N-1][0]) + abs(v[0][1] - v[N-1][1])\nprint(d)\n', 'N = int(input())\nv = [list(map(int, input().split())) for i in range(N)]\nminx = min([v[i][0] for i in range(N)])\nminy = min([v[i][1] for i in range(N)])\nv.sort(key = lambda x:x[0] - minx + x[1] - miny)\nd = abs(v[0][0] - v[N-1][0]) + abs(v[0][1] - v[N-1][1])\nresult = d\nv.sort(key = lambda x:x[0] - minx - (x[1] - miny))\nd = abs(v[0][0] - v[N-1][0]) + abs(v[0][1] - v[N-1][1])\nprint(max(d, result))'] | ['Runtime Error', 'Accepted'] | ['s002583287', 's356632057'] | [9040.0, 54836.0] | [27.0, 755.0] | [176, 397] |
p02556 | u416011173 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['# -*- coding: utf-8 -*-\n\nimport math\n\n\ndef get_input() -> int:\n \n S = int(input())\n\n return S\n\n\ndef combinations_count(n: int, r: int) -> int:\n \n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n\n\ndef main(S: int) -> None:\n \n \n a = S // 3\n b = S % 3\n ans = 0\n while a > 0:\n ans += combinations_count(b + a - 1, b)\n a -= 1\n b += 3\n ans %= 10**9 + 7\n\n \n print(ans)\n\n\nif __name__ == "__main__":\n \n S = get_input()\n\n \n main(S)\n', '# -*- coding: utf-8 -*-\n\nimport sys\n\n\ndef get_input() -> tuple:\n \n N = int(input())\n x, y = [], []\n for i in range(N):\n x_i, y_i = list(map(int, input().split()))\n x.append(x_i)\n y.append(y_i)\n\n return N, x, y\n\n\ndef main(N: int, x: list, y: list) -> None:\n \n \n max_z = -sys.maxsize\n min_z = sys.maxsize\n max_w = -sys.maxsize\n min_w = sys.maxsize\n for x_i, y_i in zip(x, y):\n z_i = x_i + y_i\n max_z = max(max_z, z_i)\n min_z = min(min_z, z_i)\n w_i = x_i - y_i\n max_w = max(max_w, w_i)\n min_w = min(min_w, w_i)\n ans = max(max_z - min_z, max_w - min_w)\n\n \n print(ans)\n\n\nif __name__ == "__main__":\n \n N, x, y = get_input()\n\n \n main(N, x, y)\n'] | ['Wrong Answer', 'Accepted'] | ['s996807898', 's093705048'] | [9972.0, 24880.0] | [2206.0, 499.0] | [974, 1130] |
p02556 | u437215432 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['def manhattan(n, x, y):\n x2 = [0] * n\n y2 = [0] * n\n for i in range(n):\n x0, y0 = xy[i]\n x2[i] = x0 - y0\n y2[i] = x0 + y0\n print(max(max(x2) - min(x2), max(y2) - min(y2)))\n\nn = int(input())\nx = [0] * n\ny = [0] * n\nfor i in range(n):\n x[i] , y[i] = map(int, input().split())\nmanhattan(n, x, y)\n', 'def manhattan(n, x, y):\n x2 = [0] * n\n y2 = [0] * n\n for i in range(n):\n x2[i] = x[i] - y[i]\n y2[i] = x[i] + y[i]\n print(max(max(x2) - min(x2), max(y2) - min(y2)))\n\nn = int(input())\nx = [0] * n\ny = [0] * n\nfor i in range(n):\n x[i] , y[i] = map(int, input().split())\nmanhattan(n, x, y)\n'] | ['Runtime Error', 'Accepted'] | ['s888512452', 's463577602'] | [27860.0, 40408.0] | [372.0, 434.0] | [329, 314] |
p02556 | u453623947 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['n = int(input())\nxy = [list(map(int,input().split())) for i in range(n)]\ncheby = []\nfor i in range(n):\n l = [xy[i][0]-xy[i][1],xy[i][0]+xy[i][1]]\n cheby.append(l)\n\nxmax = 0\nxmin = 10**10\nymax = 0\nymin = 10**10\nfor i in range(n):\n if cheby[i][0] >= xmax :\n xmax = cheby[i][0]\n xa = i\n if cheby[i][0] =< xmin :\n xmin = cheby[i][0]\n xi = i\n if cheby[i][1] >= ymax :\n ymax = cheby[i][1]\n ya = i\n if cheby[i][1] =< ymin :\n ymin = cheby[i][1]\n yi = i\n\nif abs(xmax-xmin) > abs(ymax-ymin):\n print(abs(xy[xa][0]-xy[xi][0])+abs(xy[xa][1]-xy[xi][1]))\nelse :\n print(abs(xy[ya][0]-xy[yi][0])+abs(xy[ya][1]-xy[yi][1]))\n', 'n = int(input())\nxy = [list(map(int,input().split())) for i in range(n)]\ncheby = []\nfor i in range(n):\n l = [xy[i][0]-xy[i][1],xy[i][0]+xy[i][1]]\n cheby.append(l)\n\nxmax = -10**10\nxmin = 10**10\nymax = -10**10\nymin = 10**10\nfor i in range(n):\n if cheby[i][0] > xmax :\n xmax = cheby[i][0]\n xa = i\n if cheby[i][0] < xmin :\n xmin = cheby[i][0]\n xi = i\n if cheby[i][1] > ymax :\n ymax = cheby[i][1]\n ya = i\n if cheby[i][1] < ymin :\n ymin = cheby[i][1]\n yi = i\n\nif abs(xmax-xmin) > abs(ymax-ymin):\n print(abs(xy[xa][0]-xy[xi][0])+abs(xy[xa][1]-xy[xi][1]))\nelse :\n print(abs(xy[ya][0]-xy[yi][0])+abs(xy[ya][1]-xy[yi][1]))\n'] | ['Runtime Error', 'Accepted'] | ['s295518391', 's135093588'] | [9036.0, 75784.0] | [24.0, 635.0] | [685, 693] |
p02556 | u469254913 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['import numpy as np\n# import math\n# import copy\n# from collections import deque\nimport sys\ninput = sys.stdin.readline\n\n\n\ndef main():\n N = int(input())\n xy = [list(map(int,input().split())) for i in range(N)]\n print(-1)\n\n xy = np.array(xy)\n # print(xy)\n\n diffs = xy - xy.T\n print(-1)\n md = np.sum(np.abs(diffs),axis=-1)\n res = md.max()\n\n # print(diffs)\n # print(md)\n\n print(res)\n\n\n\nmain()\n', 'import numpy as np\n# import math\n# import copy\n# from collections import deque\nimport sys\ninput = sys.stdin.readline\n\n\n\ndef main():\n N = int(input())\n xy = [list(map(int,input().split())) for i in range(N)]\n\n xy = np.array(xy)\n # print(xy)\n\n diffs = xy - xy.T\n print(-1)\n md = np.sum(np.abs(diffs),axis=-1)\n res = md.max()\n\n # print(diffs)\n # print(md)\n\n print(res)\n\n\n\nmain()\n', 'import numpy as np\n# import math\n# import copy\n# from collections import deque\nimport sys\ninput = sys.stdin.readline\n\n\n\ndef main():\n N = int(input())\n print(-1)\n xy = [list(map(int,input().split())) for i in range(N)]\n print(-1)\n\n xy = np.array(xy)\n # print(xy)\n\n diffs = xy - xy.T\n print(-1)\n md = np.sum(np.abs(diffs),axis=-1)\n res = md.max()\n\n # print(diffs)\n # print(md)\n\n print(res)\n\n\n\nmain()\n', "import numpy as np\n# import math\n# import copy\n# from collections import deque\nimport sys\ninput = sys.stdin.readline\n\nfrom scipy.spatial import distance\n\n\ndef main():\n N = int(input())\n xy = [list(map(int,input().split())) for i in range(N)]\n\n xy = np.array(xy)\n\n md = distance.cdist(xy, xy, metric='minkowski', p=1)\n\n\n print(0)\n\n\n\nmain()\n", 'import numpy as np\n# import math\n# import copy\n# from collections import deque\nimport sys\ninput = sys.stdin.readline\n\nfrom scipy.spatial import distance\n\n\ndef main():\n N = int(input())\n xy = [list(map(int,input().split())) for i in range(N)]\n\n xy = np.array(xy)\n\n print(0)\n\n\n\nmain()\n', 'import numpy as np\n# import math\n# import copy\n# from collections import deque\nimport sys\ninput = sys.stdin.readline\n\n\n\ndef main():\n N = int(input())\n xy = [list(map(int,input().split())) for i in range(N)]\n\n xy = np.array(xy)\n # print(xy)\n\n diffs = xy - xy.T\n md = np.sum(np.abs(diffs),axis=-1)\n res = md.max()\n\n # print(diffs)\n # print(md)\n\n print(res)\n\n\n\nmain()\n', 'import numpy as np\n# import math\n# import copy\n# from collections import deque\nimport sys\ninput = sys.stdin.readline\n\n\n\ndef main():\n N = int(input())\n xy = [list(map(int,input().split())) for i in range(N)]\n\n z_max = 0\n z_min = 2 * 10 **9\n\n w_max = - 10 ** 9\n w_min = 10 ** 9\n\n for i in range(N):\n z = xy[i][0] + xy[i][1]\n w = xy[i][0] - xy[i][1]\n z_max = max(z_max,z)\n z_min = min(z_min,z)\n w_max = max(w_max,w)\n w_min = min(w_min,w)\n\n res = max(z_max-z_min,w_max-w_min)\n\n print(res)\n\n\n\nmain()\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s433468121', 's548878899', 's549688516', 's603819504', 's712556951', 's757530815', 's070088609'] | [66532.0, 66524.0, 66536.0, 84156.0, 84116.0, 66492.0, 63320.0] | [368.0, 367.0, 383.0, 494.0, 455.0, 367.0, 458.0] | [453, 439, 467, 384, 325, 425, 594] |
p02556 | u474162944 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N = int(input())\n#i = 0\na_max = 2\na_min = 2*(10**9)\ns_max = 0\ns_min = 10**9\n\nfor i in N:\n x,y=map(int,input().split())\n add = x+y\n sub = x-y\n\n if add > a_max:\n a_max = add\n if add < a_min:\n a_min = add\n if sub > s_max:\n s_max = sub\n if sub < s_max:\n s_max = sub\n\nd_add = a_max - a_min\nd_sub = s_max - s_min\n\nprint(max(d_add,d_sub))', 'N = int(input())\ni = 0\na_max = 2\na_min = 2*(10**9)\ns_max = 0\ns_min = 1-10**9\n\nfor i in range(N):\n x,y=map(int,input().split())\n add = x+y\n sub = x-y\n\n if add > a_max:\n a_max = add\n if add < a_min:\n a_min = add\n \n if sub > s_max:\n s_max = sub\n if sub < s_min:\n s_min = sub\n\nd_add = a_max - a_min\nd_sub = s_max - s_min\n\n\n# print(d_add)\n\n# print(d_sub)\nprint(max(d_add,d_sub))', 'N = int(input())\ni = 0\na_max = 2\na_min = 2*(10**9)\ns_max = 1-10**9\ns_min = 10**9-1\n\nfor i in range(N):\n x,y=map(int,input().split())\n add = x+y\n sub = x-y\n\n if add > a_max:\n a_max = add\n if add < a_min:\n a_min = add\n \n if sub > s_max:\n s_max = sub\n if sub < s_min:\n s_min = sub\n\nd_add = a_max - a_min\nd_sub = s_max - s_min\n\n\n# print(d_add)\n\n# print(d_sub)\nprint(max(d_add,d_sub))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s439708015', 's608122869', 's510861465'] | [9220.0, 9208.0, 9140.0] | [26.0, 404.0, 407.0] | [380, 468, 474] |
p02556 | u495667483 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ["import sys, math\nfrom functools import lru_cache\nsys.setrecursionlimit(10**9)\nMOD = 10**9+7\n\ndef input():\n return sys.stdin.readline()[:-1]\n\ndef mi():\n return map(int, input().split())\n\ndef ii():\n return int(input())\n\ndef i2(n):\n tmp = [list(mi()) for i in range(n)]\n return [list(i) for i in zip(*tmp)]\n\ndef main():\n N = ii()\n x, y = i2(N)\n\n Mw = max(x[i]+y[i] for i in range(N))\n mw = min(x[i]+y[i] for i in range(N))\n Mz = max(abs(a[i]-y[i]) for i in range(N))\n mz = min(abs(x[i]-y[i]) for i in range(N))\n\n print(max(Mz-mz, Mw-mw))\n \n\n\nif __name__ == '__main__':\n main()\n", "import sys, math\nfrom functools import lru_cache\nsys.setrecursionlimit(10**9)\nMOD = 10**9+7\n\ndef input():\n return sys.stdin.readline()[:-1]\n\ndef mi():\n return map(int, input().split())\n\ndef ii():\n return int(input())\n\ndef i2(n):\n tmp = [list(mi()) for i in range(n)]\n return [list(i) for i in zip(*tmp)]\n\ndef main():\n N = ii()\n x, y = i2(N)\n\n Mw = max(x[i]+y[i] for i in range(N))\n mw = min(x[i]+y[i] for i in range(N))\n Mz = max(x[i]-y[i] for i in range(N))\n mz = min(x[i]-y[i] for i in range(N))\n\n print(max(Mz-mz, Mw-mw))\n \n\n\nif __name__ == '__main__':\n main()\n"] | ['Runtime Error', 'Accepted'] | ['s785229888', 's248112904'] | [63076.0, 63204.0] | [396.0, 443.0] | [616, 606] |
p02556 | u524870111 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['\n\nimport sys\nstdin = sys.stdin\n\ndef ns(): return stdin.readline().rstrip()\ndef ni(): return int(ns())\ndef na(): return list(map(int, stdin.readline().split()))\n\ndef main():\n n = ni()\n amax = [0, 0]\n amin = [10**20, 10**20]\n for _ in range(n):\n x, y = na()\n amin[0] = min(amin[0], x+y)\n amax[0] = max(amax[0], x+y)\n amin[1] = min(amin[1], (10**10-x)+y)\n amax[0] = max(amax[1], (10**10-x)+y)\n print(max(amax[0]-amin[0], amax[1]-amin[1]))\nif __name__ == "__main__":\n main()', '\n\nimport sys\nstdin = sys.stdin\n\ndef ns(): return stdin.readline().rstrip()\ndef ni(): return int(ns())\ndef na(): return list(map(int, stdin.readline().split()))\n\ndef main():\n n = ni()\n amax = [0, 0]\n amin = [10**20, 10**20]\n for _ in range(n):\n x, y = na()\n amin[0] = min(amin[0], x+y)\n amax[0] = max(amax[0], x+y)\n amin[1] = min(amin[1], -x+y)\n amax[1] = max(amax[1], -x+y)\n print(max(amax[0]-amin[0], amax[1]-amin[1]))\nif __name__ == "__main__":\n main()'] | ['Wrong Answer', 'Accepted'] | ['s481286094', 's100654697'] | [8956.0, 9216.0] | [352.0, 342.0] | [553, 537] |
p02556 | u543016260 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['2\n1 1\n1 1', 'N=int(input())\nxy = [map(int, input().split()) for _ in range(N)]\nx, y = [list(i) for i in zip(*xy)]\n\nxyp=[]\nxym=[]\nfor i in range(N):\n xyp.append(x[i]+y[i])\n xym.append(x[i]-y[i])\n \nprint(max(max(xyp)-min(xyp),-min(xym)+max(xym),max(xym)-min(xym),-min(xym)+max(xym)))'] | ['Runtime Error', 'Accepted'] | ['s774466355', 's574950400'] | [8992.0, 130360.0] | [26.0, 841.0] | [9, 277] |
p02556 | u585963734 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N=int(input())\nA=[list(map(int, input().split()))]\n\ntemp1=cp.deepcopy(A[0])\ntemp2=cp.deepcopy(A[0])\nfor i in range(N-1):\n f=0\n x,y=map(int, input().split())\n if abs(temp1[0]-x)+abs(temp1[1]-y):\n temp2[0]=x\n temp2[1]=y\n f=1\n if f==1:\n for i,j in A:\n if max(abs(temp2[0]-i)+abs(temp2[1]-j),abs(temp2[0]-temp1[0])+abs(temp2[1]-temp1[1])):\n temp1[0]=i\n temp2[1]=j\n A.append([x,y])\n\n\nprint(abs(temp2[0]-temp1[0])+abs(temp2[1]-temp1[1]))', 'N=int(input())\nA=[0]*(N)\nB=[0]*(N)\nfor i in range(N):\n x,y=map(int, input().split())\n A[i]=x+y\n B[i]=x-y\n\nA=sorted(A)\nB=sorted(B)\n\nprint(max(A[-1]-A[0],B[-1]-A[0],A[-1]-A[0],B[-1]-B[0]))'] | ['Runtime Error', 'Accepted'] | ['s717011666', 's583277525'] | [9180.0, 26932.0] | [29.0, 499.0] | [512, 195] |
p02556 | u594983000 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['import sys\ndef input(): return sys.stdin.readline().rstrip()\n\nN = int(input())\nX = []\nY = []\nfor i in range(N):\n x,y = map(int,input().split())\n X.append(x)\n Y.append(y)\n\nans1 = []\nans2 = []\nfor i in range(N):\n ans1.append(X[i] + Y[i])\n ans2.append(Y[i] - X[i])\nans1.sort()\nans2.sort()\n\na = ans1[-1] - ans1[1]\nb = ans2[-1] - ans2[1]\n\nprint(max(a,b))', 'import sys\ndef input(): return sys.stdin.readline().rstrip()\n\nN = int(input())\nX = []\nY = []\nfor i in range(N):\n x,y = map(int,input().split())\n X.append(x)\n Y.append(y)\n\nans1 = []\nans2 = []\nfor i in range(N):\n ans1.append(X[i] + Y[i])\n ans2.append(Y[i] - X[i])\nans1.sort()\nans2.sort()\n\na = ans1[-1] - ans1[0]\nb = ans2[-1] - ans2[0]\n\nprint(max(a,b))'] | ['Wrong Answer', 'Accepted'] | ['s179879391', 's075993286'] | [41380.0, 41476.0] | [478.0, 455.0] | [364, 364] |
p02556 | u644265148 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ["n = int(input())\n\nz_vec = [0] * n\nw_vec = [0] * n\n\n\nfor i in range(0, n + 1):\n line = input()\n tmp = line.split()\n z_vec[i] = int(tmp[0]) + int(tmp[1])\n w_vec[i] = int(tmp[0]) - int(tmp[1])\n\nz_ans = max(z_vec) - min(z_vec)\nw_ans = max(w_vec) - min(w_vec)\n\n\nprint(f'{max(z_ans, w_ans)}')", "n = int(input())\n\nz_vec = [0] * n\nw_vec = [0] * n\n\n\nfor i in range(0, n + 1):\n tmp = input().split()\n z_vec[i] = int(tmp[0]) + int(tmp[1])\n w_vec[i] = int(tmp[0]) - int(tmp[1])\n\nz_ans = max(z_vec) - min(z_vec)\nw_ans = max(w_vec) - min(w_vec)\n\n\nprint(f'{max(z_ans, w_ans)}')", "n = int(input())\n\np_one = input()\np_one_list = p_one.split(' ')\n\nzmax = int(p_one_list[0]) + int(p_one_list[1])\nzmin = int(p_one_list[0]) + int(p_one_list[1])\nwmax = int(p_one_list[0]) - int(p_one_list[1])\nwmin = int(p_one_list[0]) - int(p_one_list[1])\n\n\nfor i in range(1, n):\n line = input()\n tmp = line.split(' ')\n z = int(tmp[0]) + int(tmp[1])\n w = int(tmp[0]) - int(tmp[1])\n zmax = max(zmax, z)\n wmax = max(wmax, w)\n zmin = min(zmin, z)\n wmin = min(wmin, w)\n\n\nz_ans = zmax - zmin\nw_ans = wmax - wmin\n\n\nprint(f'{max(z_ans, w_ans)}')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s273816650', 's905831159', 's838193127'] | [24500.0, 24492.0, 9068.0] | [439.0, 429.0, 580.0] | [298, 282, 560] |
p02556 | u688839540 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['n = int(input())\nxy = []\nfor _ in range(n):\n xy.append(list(map(int,input().split())))\na,b=xy[0]\nm1=a+b\np1=xy[0]\nm2=a-b\np2=xy[0]\np3=xy[0]\np4=xy[0]\nm3=-a-b\nm4=-a+b\n\nfor x,y in xy:\n if x+y > m1:\n p1 = [x,y]\nif x-y > m2:\n p2 = [x,y]\nif -x-y > m3:\n p3 = [x,y]\nif -x+y > m4:\n p4 = [x,y]\nm = 0\nfor x0,y0 in [p1,p2,p3,p4]:\n for x1,y1 in [p1,p2,p3,p4]:\n dis=abs(x0-x1) + abs(y0-y1)\n if dis > m:\n m = dis\nprint(m)', 'n = int(input())\nxy = [list(map(int,input())) for _ in range(n)]\nmax = 0\nfor xy1 in xy:\n for xy2 in xy:\n dis = abs(xy1[0]-xy2[0]) + abs(xy1[1]-xy2[1])\n if dis > max:\n max = dis\nprint(max)', 'n = int(input())\nxy = []\nfor _ in range(n):\n xy.append(list(map(int,input().split())))\na,b=xy[0]\nm1=a+b\np1=xy[0]\nm2=a-b\np2=xy[0]\np3=xy[0]\np4=xy[0]\nm3=-a-b\nm4=-a+b\n\nfor x,y in xy:\n if x+y > m1:\n m1=x+y\n p1 = [x,y]\n if x-y > m2:\n m2=x-y\n p2 = [x,y]\n if -x-y > m3:\n m3 = -x-y\n p3 = [x,y]\n if -x+y > m4:\n m4 = -x+y\n p4 = [x,y]\nm = 0\nfor x0,y0 in [p1,p2,p3,p4]:\n for x1,y1 in [p1,p2,p3,p4]:\n dis=abs(x0-x1) + abs(y0-y1)\n if dis > m:\n m = dis\nprint(m)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s284764461', 's873935568', 's683335202'] | [45328.0, 9116.0, 45292.0] | [475.0, 25.0, 509.0] | [466, 199, 544] |
p02556 | u694665829 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['n = int (input())\n\nxy = []\n\ndef dist(a, b):\n return abs(a[0]-b[0]) + abs(a[1]-b[1])\n \nfor i in range(n):\n x, y = map(int,input().split())\n xy.append([x+y, x-y])\n\nxy.sort(key = lambda x: x[0]+x[1])\n\ndist(xy[0], xy[-1])\n\n\nans = 0\nl = int((n//2)**0.5)\nfor i in range(l):\n for j in range(l+1):\n ans = max(ans, dist(xy[i], xy[n-1-j]))\n\nprint(ans)\n', 'n = int (input())\n\nxy = []\n\ndef dist(a, b):\n return abs(a[0]-b[0]) + abs(a[1]-b[1])\n \nfor i in range(n):\n x, y = map(int,input().split())\n xy.append([x+y, x-y])\n\nxy.sort(key = lambda x: x[0])\n\nmin_z = xy[0][0]\nmax_z = xy[-1][0]\n\nxy.sort(key = lambda x: x[1])\n\nmin_w = xy[0][1]\nmax_w = xy[-1][1]\n\nprint(max(abs(min_z - max_z), abs(min_w - max_w)))\n'] | ['Wrong Answer', 'Accepted'] | ['s206473280', 's855813218'] | [49316.0, 42324.0] | [627.0, 656.0] | [364, 359] |
p02556 | u701565600 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N = int(input())\nxy = [map(int, input().split()) for _ in range(N)]\n\n\ndef get_output():\n dist = [0 for _ in range(N)]\n min_x, max_x = 0, 0\n min_y, max_y = 0, 0\n\n for i, (x, y) in enumerate(xy):\n x, y = (x-y), (x+y)\n\n min_x = min(x, min_x)\n min_y = min(y, min_y)\n max_x = max(x, max_x)\n max_y = max(y, max_y)\n\n return max(max_x - min_x, max_y - min_y)\n\n\nprint(get_output())\n', 'N = int(input())\nxy = [map(int, input().split()) for _ in range(N)]\n\n\ndef get_output():\n dist = [0 for _ in range(N)]\n X, Y = [], []\n\n for i, (x, y) in enumerate(xy):\n x, y = x-y, x+y\n X.append(x)\n Y.append(y)\n\n a = max(X) - min(X)\n b = max(Y)-min(Y)\n return max(a, b)\n\n\nprint(get_output())\n'] | ['Wrong Answer', 'Accepted'] | ['s647665832', 's421588284'] | [97884.0, 100656.0] | [870.0, 739.0] | [423, 330] |
p02556 | u706414019 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['import sys,math,collections,itertools\ninput = sys.stdin.readline\n\nN=int(input())\nXY = []\nxAve = 0\nyAve = 0\nfor _ in range(N):\n x,y=map(int,input().split())\n if (x,y) not in XY\n XY.append((x,y))\n xAve += x\n yAve += y\nxAve = xAve//N\nyAve = yAve//N\nXYnorm = [0]*4\nfor x,y in XY:\n nX = x-xAve\n nY = y-yAve\n if nX>=0 and nY>0:\n XYnorm[0]=max(XYnorm[0],nX+nY)\n if nX <0 and nY >=0:\n XYnorm[1]=max(XYnorm[1],-nX+nY)\n if nX <=0 and nY <0:\n XYnorm[2]=max(XYnorm[2],-nX-nY)\n if nX >0 and nY <=0:\n XYnorm[3]=max(XYnorm[3],nX-nY)\nprint(int(max(XYnorm[2]+XYnorm[0],XYnorm[3]+XYnorm[1])))\n \n', "import sys,math,collections,itertools\ninput = sys.stdin.readline\n\nN=int(input())\nzmax=-float('inf')\nzmin = float('inf')\nwmax = -float('inf')\nwmin = float('inf')\n\nfor _ in range(N):\n x,y=map(int,input().split())\n z=x+y\n w=x-y\n zmax = max(z,zmax)\n zmin = min(z,zmin)\n wmax = max(w,wmax)\n wmin = min(w,wmin)\nprint(max(zmax-zmin,wmax-wmin))\n"] | ['Runtime Error', 'Accepted'] | ['s355745196', 's642353789'] | [8976.0, 9432.0] | [26.0, 325.0] | [697, 358] |
p02556 | u716641520 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['n = int(input())\nmaxx, minx, maxy, miny = -1**10, 1**10, -1**10, 1**10\nfor _ in range(n):\n\tx, y = map(int, input().split())\n\tx, y = x+y, x-y\n\tmaxx = max(maxx, x)\n\tminx = min(minx, x)\n\tmaxy = max(maxy, y)\n\tminy = min(miny, y)\nprint(max(maxx - minx, maxy - miny))\n', 'n = int(input())\nmaxx, minx, maxy, miny = -10**10, 10**10, -10**10, 10**10\nfor _ in range(n):\n\tx, y = map(int, input().split())\n\tx, y = x+y, x-y\n\tmaxx = max(maxx, x)\n\tminx = min(minx, x)\n\tmaxy = max(maxy, y)\n\tminy = min(miny, y)\nprint(max(maxx - minx, maxy - miny))\n'] | ['Wrong Answer', 'Accepted'] | ['s765500891', 's981938926'] | [9160.0, 9172.0] | [511.0, 523.0] | [262, 266] |
p02556 | u729133443 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['a,b=[],\nfor z in[*open(0)][1:]:x,y=map(int,z.split());a+=x+y,;b+=x-y,\nprint(max(abs(max(a)-min(a)),abs(max(b)-min(b))))', 'a,*b=[],\nfor z in[*open(0)][1:]:x,y=map(int,z.split());a+=x+y,;b+=x-y,\nprint(max(max(a)-min(a),max(b)-min(b)))'] | ['Runtime Error', 'Accepted'] | ['s216254497', 's780624510'] | [9044.0, 44412.0] | [26.0, 234.0] | [119, 110] |
p02556 | u773081031 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['n = int(input())\nu = [list(map(int, input().split())) for i in range(n)]\nz = [u[i][0] + u[i][1] for i in range(n)]\nw = [w[i][0] - w[i][1] for i in range(n)]\nd = [max(z)-min(z), max(w)-min(w)]\n\nprint(max(d))\n\t\n', 'n = int(input())\nz = [[map(int, input().split())] for i in range(n)]\nm = 0\nd = 0\nfor i in range(n-1):\n for j in range(i+1, n):\n d = 0\n d += max(z[i][0] - z[j][0], z[j][0] - z[i][0])\n d += max(z[i][1] - z[j][1], z[j][1] - z[i][1])\n if d>m:\n m = d\nprint(m)\n\t', 'n = int(input())\nu = [list(map(int, input().split())) for i in range(n)]\nz = [u[i][0] + u[i][1] for i in range(n)]\nw = [u[i][0] - u[i][1] for i in range(n)]\nd = [max(z)-min(z), max(w)-min(w)]\n\nprint(max(d))\n\t\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s158111647', 's302853281', 's506965811'] | [53424.0, 111976.0, 61068.0] | [437.0, 885.0, 486.0] | [209, 274, 209] |
p02556 | u814271993 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['import sys\n\ndef f(x,y):\n return x-y.x+y\n\ndef main():\n input = sys.stdin.buffer.readline\n n = int(input())\n x = [0]*n\n y = [0]*n\n for i in range(n):\n x[i],y[i] = map(int,input().split())\n f0 = [0]*n\n f1 = [0]*n\n for i in range(n):\n f0[i],fi[i] = f(x[i],y[i])\n print(max(max(f0)-minf(0),max(f1)-minf(1)))\n\nif __name__ = "__main__":\n main()', 'import sys\n\ndef f(x,y):\n return x-y,x+y\n\ndef main():\n n = int(input())\n x = [0]*n\n y = [0]*n\n for i in range(n):\n x[i],y[i] = map(int,input().split())\n f0 = [0]*n\n f1 = [0]*n\n for i in range(n):\n f0[i],f1[i] = f(x[i],y[i])\n print(max(max(f0)-min(f0),max(f1)-min(f1)))\n\nif __name__ == "__main__":\n main()'] | ['Runtime Error', 'Accepted'] | ['s117156060', 's034686184'] | [8904.0, 40504.0] | [25.0, 412.0] | [384, 347] |
p02556 | u820685137 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['\n\nimport sys\n\n\ndef input() -> str: \n """Input."""\n return sys.stdin.readline()[:-1]\n\n\ndef calc(p1: list, p2: list) -> int:\n """Calc Manhattan Distance."""\n return abs(p2[1] - p1[1]) + abs(p2[0] - p1[0])\n\n\ndef main():\n """Run."""\n n = int(input())\n\n p1 = p2 = None\n for _ in range(n):\n p = list(map(int, input().split(\' \')))\n if not p1:\n p1 = p\n elif not p2:\n p2 = p\n else:\n p1_max = calc(p1, p)\n p2_max = calc(p1, p)\n\n if p1_max >= p2_max:\n p2 = p\n else:\n p1 = p\n\n print(calc(p1, p2))\n """\n patterns = {\n \'lt\': (1, 1),\n \'rt\': (-1, 1),\n \'lb\': (-1, -1),\n \'rb\': (1, -1),\n }\n\n points: dict = {k: None for k in patterns.keys()}\n\n for _ in range(n):\n p = list(map(int, input().split(\' \')))\n\n for k, (x, y) in patterns.items():\n max_p = points[k]\n\n if max_p:\n max_p_pos = (max_p[0] * x) + (max_p[1] * y)\n p_pos = (p[0] * x) + (p[1] * y)\n if max_p_pos < p_pos:\n points[k] = p\n else:\n points[k] = p\n\n ans = 0\n for i, p1 in enumerate(points.values()):\n for p2 in list(points.values())[i + 1:]:\n ans = max(ans, calc(p1, p2))\n\n print(ans)\n """\n\n\nmain()\n', '\n\nimport sys\n\n\ndef input() -> str: \n """Input."""\n return sys.stdin.readline()[:-1]\n\n\ndef calc(p1: list, p2: list) -> int:\n """Calc Manhattan Distance."""\n return abs(p2[1] - p1[1]) + abs(p2[0] - p1[0])\n\n\ndef main():\n """Run."""\n n = int(input())\n\n patterns = {\n \'lt\': (1, 1),\n \'rt\': (-1, 1),\n \'lb\': (-1, -1),\n \'rb\': (1, -1),\n }\n\n points: dict = {k: None for k in patterns.keys()}\n\n for _ in range(n):\n p = list(map(int, input().split(\' \')))\n\n for k, (x, y) in patterns.items():\n max_p = points[k]\n\n if max_p:\n max_p_pos = (max_p[0] * x) + (max_p[1] * y)\n p_pos = (p[0] * x) + (p[1] * y)\n if max_p_pos < p_pos:\n points[k] = p\n else:\n points[k] = p\n\n ans = 0\n for i, p1 in enumerate(points.values()):\n for p2 in list(points.values())[i + 1:]:\n ans = max(ans, calc(p1, p2))\n\n print(ans)\n\n\nmain()\n'] | ['Wrong Answer', 'Accepted'] | ['s114444302', 's409318589'] | [9104.0, 9148.0] | [293.0, 428.0] | [1443, 1057] |
p02556 | u887080361 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['from numba import jit\nn=int(input())\ndata=[]\nfor _ in range(n):\n data.append(list(map(int,input().split())))\n \n@jit\ndef main():\n ans=0\n for i in range(0,n-1):\n for j in range(i+1,n):\n d=abs(data[i][0]-data[j][0])+abs(data[i][1]-data[j][1])\n ans=max(ans,d)\n print(ans)\n \nif __name__=="__main__":\n main()', 'n=int(input())\ndata=[]\nfor _ in range(n):\n data.append(list(map(int,input().split())))\n\ndata_sum=[]\nfor i in range(n):\n data_sum.append(data[i][0]+data[i][1])\n\n\ndata_sum_1=[]\nfor i in range(n):\n data_sum_1.append(data[i][1]-data[i][0])\n\nd_1=max(data_sum)-min(data_sum)\nd_2=max(data_sum_1)-min(data_sum_1)\n\nprint(max(d_1,d_2))'] | ['Time Limit Exceeded', 'Accepted'] | ['s413280254', 's688863527'] | [189496.0, 61412.0] | [2211.0, 570.0] | [352, 334] |
p02556 | u896741788 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N = int(input())\nY_MAX = 0\nY_MIN = 1000000000000\n\nfor i in range(N):\n x, y = map(int, input().split())\n if abs(0 - x) + abs(y - 1000000000000) > Y_MAX:\n Y_MAX = abs(0 - x) + abs(y - 1000000000000)\n if abs(0 - x) + abs(y - 1000000000000) < Y_MIN:\n Y_MIN = abs(0 - x) + abs(y - 1000000000000)\n \nprint(Y_MAX - Y_MIN)\n', 'import sys\ninput=sys.stdin.buffer.readline\ninputs=sys.stdin.buffer.readlines\nsys.setrecursionlimit(10**9)\n\nn=int(input())\ntable=[(x-y,x+y)for x,y in [map(int,input().split()) for i in range(n)]]\na,b=[table[0][0]]*2,[table[0][1]]*2\nans=0\nfor x,y in table:\n ans=max(ans,abs(x-a[0]),abs(x-a[1]),abs(y-b[0]),abs(y-b[1]))\n a[0]=min(x,a[0])\n a[1]=max(a[1],x)\n b[0]=min(b[0],y)\n b[1]=max(b[1],y)\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s411676747', 's501584137'] | [9136.0, 91440.0] | [444.0, 876.0] | [338, 414] |
p02556 | u921676506 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N = int(input())\nx, y = map(int, input().split())\nd = [x - y, x - y, x + y, x + y]\nfor i in range(1,N):\n x, y = map(int, input().split())\n d[0] = max(d[0], x-y)\n d[1] = min(d[1], x-y)\n d[2] = max(d[2], x+y)\n d[3] = min(d[3], x+y)\nprint(d)\nprint(max(d[0]-d[1], d[2]-d[3]))', 'N = int(input())\nx, y = map(int, input().split())\nd = [x - y, x - y, x + y, x + y]\nfor i in range(1,N):\n x, y = map(int, input().split())\n d[0] = max(d[0], x-y)\n d[1] = min(d[1], x-y)\n d[2] = max(d[2], x+y)\n d[3] = min(d[3], x+y)\nprint(max(d[0]-d[1], d[2]-d[3]))'] | ['Wrong Answer', 'Accepted'] | ['s751288887', 's016964288'] | [9224.0, 9204.0] | [522.0, 536.0] | [276, 267] |
p02556 | u923662841 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N = int(input())\nX = []\nY = []\nfor _ in range(N):\n x,y = map(int, input().split())\n X.append(x)\n Y.append(y)\nX = np.array(X)\nY = np.array(Y)\nX_ = X.reshape((N,1))\nY_ = Y.reshape((N,1))\nZ = np.abs(X-X_)+np.abs(Y-Y_)\nz = Z.reshape((1,-1))\nprint(np.max(z))', '# ABC178D Manhattan\nn = int(input())\nz = []\nw = []\nfor i in range(n):\n x,y = map(int, input().split())\n z.append(x-y)\n w.append(x+y)\n \nz_ans = max(z)-min(z)\nw_ans = max(w)-min(w)\nprint(max(z_ans,w_ans))'] | ['Runtime Error', 'Accepted'] | ['s040706839', 's001328584'] | [24880.0, 24916.0] | [388.0, 407.0] | [262, 214] |
p02556 | u941438707 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['(n,),*e=[[*map(int,i.split())]for i in open(0)]\na=sorted(e)\nb=sorted(e,key=lambda x: x[1])\nc=a[:10]+a[:10]+b[10:]+b[:10]\nans=0\nfor i,j in c:\n for ii,jj in c:\n ans=max(ans,abs(i-ii)+abs(j-jj))', 'a,b=[],[]\nfor _ in range(int(input())):\n x,y=map(int,input().split())\n a+=[x-y]\n b+=[x+y]\nprint(max(max(a)-min(a),max(b)-min(b)))'] | ['Wrong Answer', 'Accepted'] | ['s401715037', 's186674397'] | [53412.0, 24772.0] | [2207.0, 429.0] | [201, 138] |
p02556 | u991713078 | 2,000 | 1,048,576 | There are N points on the 2D plane, i-th of which is located on (x_i, y_i). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the _Manhattan distance_ between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|. | ['N=int(input())\na,b,c,d=0,1e10,-1e10,1e10\nfor i in range(N):\n A,B=int(input().pulit())\n a=max(a,A+B)\n b=min(b,A+B)\n c=max(c,A-B)\n d=min(d,A-B)\nprint(max(abs(a-b),abs(c-d))', 'N=int(input())\na,b,c,d=0,1e10,-1e10,1e10\nfor i in range(N):\n A,B=input().split()\n A=int(A)\n B=int(B)\n a=max(a,A+B)\n b=min(b,A+B)\n c=max(c,A-B)\n d=min(d,A-B)\nprint(max(abs(a-b),abs(c-d)))'] | ['Runtime Error', 'Accepted'] | ['s923404000', 's446738236'] | [8852.0, 9016.0] | [26.0, 501.0] | [175, 193] |
p02570 | u000040786 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d, t, s = map(int, input().split())\nif t >= d/s:\n print("yes")\nelse:\n print("no")', 'd, t, s = map(int, input().split())\nif t >= d/s:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s495347133', 's999283426'] | [9148.0, 9136.0] | [28.0, 28.0] | [87, 87] |
p02570 | u000100945 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['def ans():\n if t==0:\n return "N0"\n if d/s < = t:\n return "Yes"\n else:\n return "No"\n \nd, t, s = map(int, input().split())\nprint(ans())', 'def ans():\n if t==0:\n return "N0"\n if d/s <= t:\n return "Yes"\n else:\n return "No"\n \nd, t, s = map(int, input().split())\nprint(ans())'] | ['Runtime Error', 'Accepted'] | ['s246119543', 's005520049'] | [8900.0, 9064.0] | [25.0, 28.0] | [170, 169] |
p02570 | u007346335 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d t s = map(int, input().split())\nif d<t*s:\n print('Yes')\nelse:\n print('No')\n ", "d t s = map(int, input().split())\nif d<=t*s:\n print('Yes')\nelse:\n print('No')\n ", "d, t, s = map(int, input().split())\nif d<=t*s:\n print('Yes')\nelse:\n print('No')\n "] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s436797206', 's638099920', 's993589514'] | [8868.0, 8924.0, 9156.0] | [23.0, 20.0, 26.0] | [81, 81, 83] |
p02570 | u007637377 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d,t,s=map(int,input().split())\nprint("Yes" if t>=d*s else "No")', 'd,t,s=map(int,input().split())\nprint("Yes" if t>=d/s else "No")'] | ['Wrong Answer', 'Accepted'] | ['s875259737', 's070239164'] | [9124.0, 9096.0] | [27.0, 30.0] | [63, 63] |
p02570 | u011348645 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["x, y,z = map(int, input().split()) \ntest = x / z\n\nif (test < y){\n print('Yes')\n}else{\n print('No')\n}", "x, y,z = map(int, input().split()) \ntest = x / z\n\nif (test <= y):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s241129892', 's852570256'] | [9032.0, 9160.0] | [25.0, 29.0] | [106, 104] |
p02570 | u013617325 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['N = int(input())\nA = list(map(int, input().split()))\n\nnumber = 0\nMOD = 1000000007\n\nfor i in range(N-1):\n for j in range(i+1, N):\n number += A[i]*A[j]\n\n\nif number > MOD:\n print(number%MOD)\nelse:\n print(number)\n', '#!/usr/bin/env python3\nimport sys\nfrom itertools import accumulate\nMOD = 1000000007 # type: int\n\n\ndef solve(N: int, A: "List[int]"):\n aa = list(accumulate(A))\n print(aa)\n x = sum(A)\n print(x)\n\n ans = 0\n\n for i in range(N):\n ans += A[i]*(aa[N-1]-aa[i])%MOD\n ans %= MOD\n return print(ans)\n\n\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) # type: int\n A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"\n solve(N, A)\n\nif __name__ == \'__main__\':\n main()\n', '#!/usr/bin/env python3\nimport sys\n\nYES = "Yes" # type: str\nNO = "No" # type: str\n\n\ndef solve(D: int, T: int, S: int):\n\n if D <= T*S:\n return print(\'Yes\')\n else:\n return print(\'No\')\n\n\n\n# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n D = int(next(tokens)) # type: int\n T = int(next(tokens)) # type: int\n S = int(next(tokens)) # type: int\n solve(D, T, S)\n\nif __name__ == \'__main__\':\n main()\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s560975981', 's908774769', 's496228141'] | [9132.0, 9160.0, 9188.0] | [26.0, 25.0, 26.0] | [225, 818, 713] |
p02570 | u021176439 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["D, T, S = map(int, input().split())\nif D / S >= T:\n print('YES')\nelse:\n print('NO')\n", "D, T, S = map(int, input().split())\nif S * T >= D:\n print('YES')\nelse:\n print('NO')", "D, T, S = map(int, input().split())\nif D / S <= T:\n print('YES')\nelse:\n print('NO')\n", "D, T, S = map(int, input().split())\nif D / S <= T:\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s562650045', 's688316173', 's935785062', 's354448800'] | [9140.0, 9068.0, 9152.0, 9168.0] | [29.0, 26.0, 29.0, 29.0] | [86, 85, 86, 86] |
p02570 | u021877437 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["D, T, S = map(int, input().rstrip().split())\nprint(D)\ndis = S * T\nr = 'Yes' if dis >= D else 'No'\nprint(r)\n\n", "D, T, S = map(int, input().rstrip().split())\ndis = S * T\nr = 'Yes' if dis >= D else 'No'\nprint(r)\n"] | ['Wrong Answer', 'Accepted'] | ['s083441010', 's166358489'] | [9088.0, 9144.0] | [26.0, 29.0] | [108, 98] |
p02570 | u024584010 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['n = int(input())\na = list(map(int,input().split()))\nsum = 0\nfor i in range(n):\n sum += a[i]\nsum = sum*sum\nfor j in range(n):\n sum = sum - a[j]*a[j]\nsum = int(sum/2)\nprint(sum%1000000007)', 'n = int(input())\na = list(map(int,input().split()))\nsum = 0\nfor i in range(n):\n sum += a[i]\nsum = sum*sum\nfor j in range(n):\n sum = sum - a[j]*a[j]\nsum = int(sum/2)\nprint(sum%1000000007)', 'n = int(input())\na = list(map(int,input().split()))\nsum = 0\nfor i in range(n):\n sum += a[i]\nsum = sum*sum\nfor j in range(n):\n sum = sum - a[j]*a[j]\nsum = sum\nprint((sum%1000000007)/2)', 'd,t,s = map(int,input().split())\nif d<= s*t:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s117148641', 's560471334', 's647610064', 's762685018'] | [9184.0, 9096.0, 9164.0, 9108.0] | [32.0, 30.0, 22.0, 31.0] | [192, 192, 189, 83] |
p02570 | u035453792 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d,t.s = map(int,input().split())\na = d/s\nif t>=a:\n print("Yes")\nelse:\n print("No")', 'd,t,s = map(int,input().split())\na = d/s\nif t>=a:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s712591113', 's036438002'] | [9092.0, 9152.0] | [26.0, 29.0] | [88, 88] |
p02570 | u036340997 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d, t, s = map(int, input().split())\nprint('Yes' if d/s >= t else 'No')", "print('Yes' if eval(input().replace(' ','<=',1).replace(' ','*',1)) else 'No')"] | ['Wrong Answer', 'Accepted'] | ['s662021209', 's858130074'] | [9124.0, 9048.0] | [29.0, 26.0] | [70, 78] |
p02570 | u048826171 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d = int(input())\nt = int(input())\ns = int(input())\nif (t*s >= d):\n print("Yes")\nelse:\n print("No")', 'd = int(input())\nt = int(input())\ns = int(input())\nif t*s >= d:\n print("Yes")\nelse:\n print("No")', 'D, T, S = map(int, input().split())\nif T*S >= D:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s088077714', 's134822461', 's770635804'] | [9168.0, 9116.0, 9148.0] | [20.0, 24.0, 28.0] | [100, 98, 83] |
p02570 | u048947465 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['m, s, mps = [int(x) for x in input().split()]\ntime = m / mps\n\nif s >= time:\n print(True)\nelse:\n print(False)', "m, s, mps = [int(x) for x in input().split()]\ntime = m / mps\n\nif s >= time:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s009281827', 's937802187'] | [9052.0, 9024.0] | [29.0, 31.0] | [114, 114] |
p02570 | u054471580 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['a,b,c = map(int, input().split()) \nif(b*c<=a):\n print("Yes")\nelse:\n print("No")', 'a,b,c = map(int, input().split()) \nif(b*c>=a):\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s850832558', 's149423792'] | [9152.0, 9112.0] | [32.0, 25.0] | [81, 82] |
p02570 | u062431216 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['str = input()\nstr = [int(x) for x in str.split()]\n\nif(str[0] <= str[1] * str[2]):\n print("yes")\nelse:\n print("no")', 'str = input()\nstr = [int(x) for x in str.split()]\n\nif(str[0] > str[1] * str[2]):\n print("no")\nelse:\n print("yes")', 'str = input()\nstr = [int(x.strip()) for x in str.split()]\n\nif(str[0] <= str[1] * str[2]):\n print("yes")\nelse:\n print("no")', 'str = input()\nstr = [int(x) for x in str.split()]\n\nif(str[0] <= str[1] * str[2]):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s243290539', 's453691275', 's984715923', 's771217251'] | [9092.0, 9088.0, 9108.0, 9132.0] | [27.0, 28.0, 27.0, 27.0] | [116, 115, 124, 116] |
p02570 | u070423038 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["D, T, S = map(int, input().split())\n\nif D / S <= T:\n print('Yes')\nelse:\n print('No')\nprint(D/S)", "D, T, S = map(int, input().split())\n\nif D / S <= T:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s278341622', 's405905692'] | [9156.0, 9156.0] | [32.0, 28.0] | [101, 90] |
p02570 | u074220993 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d, t, s = (int(x) for x in input().split())\nprint('Yes' if s*t <= d else 'No')", "d, t, s = (int(x) for x in input().split())\nprint('Yes' if s*t >= d else 'No')"] | ['Wrong Answer', 'Accepted'] | ['s662062328', 's071780388'] | [9100.0, 9152.0] | [31.0, 35.0] | [78, 78] |
p02570 | u075304271 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['import math\nimport collections\nimport fractions\nimport itertools\nimport functools\nimport operator\nimport bisect\n\ndef solve():\n n, m = map(int, input().split())\n group = []\n done = [-1]*n\n num = 0\n for i in range(m):\n a, b = map(lambda x:int(x)-1, input().split())\n if done[a] != -1:\n if done[b] == -1:\n group[done[a]].append(b)\n done[b] = done[a]\n else:\n if done[b] == -1:\n group.append([a,b])\n done[a], done[b] = num, num\n num += 1\n else:\n group[done[b]].append(a)\n done[a] = done[b]\n people = [0]+[len(i) for i in group]\n print(max(people))\n return 0\n\nif __name__ == "__main__":\n solve()\n', 'import math\nimport collections\nimport fractions\nimport itertools\nimport functools\nimport operator\nimport bisect\n\ndef solve():\n s = input()\n t = input()\n hoge = 10000\n let = len(t)\n les = len(s)\n ans = 10000\n for i in range(les-let+1):\n hoge = s[i:i+let]\n piyo = 0\n for j, k in zip(hoge,t):\n if j != k:\n piyo += 1\n if piyo < ans:\n ans = piyo\n print(ans)\n return 0\n\nif __name__ == "__main__":\n solve()\n', 'import math\nimport collections\nimport fractions\nimport itertools\nimport functools\nimport operator\nimport bisect\n\ndef solve():\n d, t, s = map(int, input().split())\n if d > t*s:\n print("No")\n else:\n print("Yes")\n return 0\n\nif __name__ == "__main__":\n solve()\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s362592447', 's903047981', 's413386245'] | [10460.0, 10396.0, 10136.0] | [39.0, 40.0, 36.0] | [776, 495, 286] |
p02570 | u075950453 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d, t, s = input().split()\nif t*s >= d:\n\treturn "Yes"\nelse:\n\treturn "No"', 'd, t, s = input().split()\nif t*s >= d:\n\tprint "Yes"\nelse:\n\tprint "No"', 'd, t, s = map(int, input().split())\nif t*s >= d:\n\tprint ("Yes")\nelse:\n\tprint ("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s123527692', 's634048260', 's776115041'] | [9020.0, 8956.0, 9020.0] | [29.0, 25.0, 26.0] | [71, 69, 83] |
p02570 | u082587812 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['l=[]\nfor i in range(3):\n l.append(int(input()))\nd=l[0]\nt=l[1]\ns=l[2]\n\ntime=d/s\nif(time<=t):\n print("Yes")\nelse:\n print("No")\n', 'd,t,s=map(int,input().split())\ntime=d/s\nif(time<=t):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s672924945', 's951052568'] | [9116.0, 9156.0] | [31.0, 30.0] | [128, 87] |
p02570 | u085186789 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['D,T,S = map(int,input().split())\nif D <= T * S:\n print("YES")\nelse:\n print("NO")\n', 'D,T,S = list(map(int,input().split(" ")))\nif D <= T * S:\n print("YES")\nelse:\n print("NO")', 'D,T,S = map(int,input().split())\nif D<=T*S:\n print("YES")\nelse:\n print("NO")\n', 'D,T,S = list(int,input().split())\nif D <= T * S:\n print("YES")\nelse:\n print("NO")\n', 'D,T,S = map(int,input().split(" "))\nif D <= T * S:\n print("YES")\nelse:\n print("NO")\n', 'D, T, S = list(map((int, input().split()))\n if D <= T * S:\n print("YES")\n else:\n print("NO")', 'D,T,S=map(int,input().split())\nif D<=T*S:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s364938504', 's447127675', 's549969639', 's671738164', 's733948556', 's768858261', 's828204397'] | [9148.0, 8996.0, 8996.0, 8996.0, 9096.0, 8592.0, 8972.0] | [27.0, 27.0, 30.0, 26.0, 28.0, 28.0, 29.0] | [83, 91, 79, 84, 86, 152, 81] |
p02570 | u085970119 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['n = int(input()) \nnum_list = [int(input()) for _ in range(n)]\n \narriving_tm = num_list[0] / num_list[2]\nif arriving_tm <= num_list[1]:\n print("Yes")\nelse :\n print("No")\n ', 'ๅพ
ใกๅใใๅ ดๆใฏ้ซๆฉๅใฎๅฎถใใ \nD\n ใกใผใใซ้ขใใๅฐ็นใงใใใๅพ
ใกๅใใใฎๆๅปใฏ \nT\n ๅๅพใงใใ\n\n้ซๆฉๅใฏไปใใๅฎถใๅบ็บใใๅ้ \nS\n ใกใผใใซใงๅพ
ใกๅใใๅ ดๆใพใงใพใฃใใ็งปๅใใพใใ\n\nๅพ
ใกๅใใใซ้ใซๅใใงใใใใ๏ผ\n\nn = int(input()) \nnum_list = [int(input()) for _ in range(n)]\n\narriving_tm = num_list[0] / num_list[2]\nif arriving_tm <= num_list[1]:\n print("Yes")\nelse :\n print("No")\n\n', 'n = int(input()) \nnum_list = [int(input()) for _ in range(n)]\n \na = num_list[0] / num_list[2]\n\nif a <= num_list[1]:\n print("Yes")\nelse :\n print("No")\n ', 'a,b,c = map(int, input().split())\n\nans = a/c\n \nif ans <= b:\n print("Yes")\nelse :\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s415985223', 's572068810', 's753957443', 's774792720'] | [9188.0, 8836.0, 9092.0, 8988.0] | [21.0, 27.0, 27.0, 29.0] | [191, 502, 172, 95] |
p02570 | u086138398 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['N,M = map(int,input().split())\nedge = []\nfor i in range(M):\n a,b = map(int,input().split())\n add = []\n for j in range(len(edge)):\n if a in edge[j] or b in edge[j]:\n edge[j].append(a)\n edge[j].append(b)\n add.append(j)\n if len(add) == 0:\n edge.append([a,b])\n elif len(add) >= 2:\n for j in range(1,len(add)):\n edge[add[0]].extend(edge[add[j]])\n for j in range(1,len(add)):\n edge.pop(add[j])\nans = 0\nfor i in range(len(edge)):\n x = list(set(edge[i]))\n if len(x) > ans:\n ans = len(x)\nprint(ans)\n', 'd,t,s = map(int,input().split())\nif d <= t*s:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s701658849', 's156900702'] | [9188.0, 9152.0] | [28.0, 28.0] | [601, 84] |
p02570 | u089230684 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d=int(input())\nt=int(input())\ns=int(input())\n\nif d == 0:\n print ('error')\n \nelif t == 0:\n print ('error')\n \nelif s == 0:\n print ('error')\n\nelse:\n \n if (s*t) >= d :\n print ('Yes')\n \n else:\n print ('No')\n\n", "d=int(input())\nt=int(input())\ns=int(input())\n\nif d == 0:\n print ('error')\n \nelif t == 0:\n print ('error')\n \nelif s == 0:\n print ('error')\n\nelse:\n \n if s*t >= d:\n print ('Yes')\n \n else:\n print ('No')", '\nstr_in = input()\nnum = [int(n) for n in str_in.split()]\nnum =list(map(int, str_in.strip().split())) \n#print(num) #D,T,S\n\n\nif num[1] >= (num[0]/num[2]):\n print("Yes")\nelse:\n print("No")\n\n\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s037971150', 's346599339', 's491107689'] | [9140.0, 9068.0, 9100.0] | [26.0, 31.0, 31.0] | [248, 243, 252] |
p02570 | u090046582 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['a, b, c = map(int, input().split())\n\nif b * c >= a:\n print("yes")\nelse:\n print("no")', 'a, b, c = map(int, input().split())\n\n\n\n\ntime=a/c\nif time <= b:\n print("yes")\nelse:\n print("no")\n\n\n\n\n\n\n', 'a, b, c = map(int, input().split())\n\n\n\n\nif a <= b*c :\n print("yes")\nelse:\n print("no")\n\n\n\n\n', 'D, T, S = map(int, input().split())\n\n\n\ntime=D/S\nif time <= T:\n print("yes")\nelse:\n print("no")\n', 'a, b, c = map(int, input().split())\n\n\n\n\nif b * c >= a:\n print("yes")\nelse:\n print("no")', 'D, T, S = list(map(int, input().split(" ")))\n\n\n\ntime=D/S\n\nif time <= T:\n print("yes")\nelse:\n print("no")\n\n', 'a, b, c = map(int, input().split())\n\n\n\n\nif b * c >= a:\n print("yes")\nelse:\n print("no")\n\n\n\n\n', 'D = int(input())\nT = int(input())\nS = int(input())\n\n\n\n\ntime=D/S\nif time <= T:\n print("yes")\nelse:\n print("no")\n\n', 'a, b, c = map(int, input().split())\n\n\n\n\nif b * c >= a:\n print("yes")\nelse:\n print("no")\n\n\n\n\n', 'D, T, S = map(int, input().split())\n\n\n\ntime=D/S\nif time <= T:\n print("yes")\nelse:\n print("no")\n\n', 'a, b, c = map(int, input().split())\n\n\n\n\nif a <= b * c:\n print("yes")\nelse:\n print("no")\n\n\n\n\n', 'a, b, c = map(int, input().split())\n\n\n\n\nif a <= b*c:\n print("yes")\nelse:\n print("no")\n\n\n\n\n', 'a, b, c = map(int, input().split())\n\n\n\n\nif b * c >= a:\n print("yes")\nelse:\n print("no")', 'a, b, c = map(int, input().split())\n\nif b * c >= a:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s020737747', 's025218628', 's081842777', 's158724356', 's163310272', 's166266489', 's286941406', 's294176584', 's325045270', 's446761155', 's862050939', 's862404474', 's876608354', 's992480908'] | [9080.0, 9004.0, 9156.0, 9088.0, 9056.0, 9020.0, 9108.0, 8908.0, 8848.0, 8904.0, 9100.0, 9156.0, 9044.0, 9164.0] | [28.0, 30.0, 31.0, 26.0, 25.0, 27.0, 27.0, 24.0, 30.0, 28.0, 27.0, 27.0, 30.0, 27.0] | [90, 108, 98, 101, 94, 112, 99, 118, 99, 102, 99, 96, 93, 90] |
p02570 | u092650292 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['import collections\nn, m = map(int, input().split())\npar = [i for i in range(0, n + 1)]\n# print(par)\ns = list()\n\n\n\ndef find(x):\n\n while par[x] != x:\n tmp = par[x]\n par[x] = par[par[x]]\n x = par[x]\n\n return x\n\n\ndef union(x, y):\n x = find(x)\n y = find(y)\n if x == y:\n return 0\n else:\n par[x] = y\n\n\n\nfor j in range(m):\n a, b = map(int, input().split())\n union(a, b)\n\n\nfor k in range(1, n + 1):\n s.append(find(k))\n# print(s)\nc = collections.Counter(s)\nprint(max(c.values()))\n', 'from math import gcd\n\nfrom math import factorial as f\n\nfrom math import ceil, floor, sqrt\nimport math\n\nimport bisect\nimport re\nimport heapq\n\nfrom copy import deepcopy\nimport itertools\nfrom itertools import permutations\n\nfrom sys import exit\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(map(int, input().split()))\n\nyes = "Yes"\nno = "No"\n\n\ndef main():\n d, t, s = mi()\n\n if s * t >= d:\n print(yes)\n else:\n print(no)\n\n\nmain()\n'] | ['Runtime Error', 'Accepted'] | ['s180392642', 's310189514'] | [9404.0, 10020.0] | [29.0, 43.0] | [825, 484] |
p02570 | u095704523 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["D = input('่ท้ข')\nT = input('ๆ้')\nS = input('้ๅบฆ')\nif D/S < T:\n print('Yes')\nelse:\n print('No')", "D,T,S = map(int,input().split())\n\nif D/S <= T:\n print('Yes')\nelse:\n \tprint('No')\n"] | ['Runtime Error', 'Accepted'] | ['s135531538', 's809505986'] | [8960.0, 9144.0] | [25.0, 27.0] | [106, 85] |
p02570 | u097852911 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d ,t,s = map(int.input().split())\nif d/s > t:\n print(No)\nelse:\n print(Yes)', 's = input()\nt = input()\nm = len(s)\nn = len(t)\ndid = m -n\nli = []\nfor i in range(did+1):\n su = 0\n for j in range(n):\n if t[j] ==s[i+j]:\n su +=0\n else:\n su +=1\n li.append(su)\nprint(min(li))', 'd,t,s = map(int,input().split())\nif d/s > t:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s686569615', 's855489748', 's450145844'] | [9016.0, 9128.0, 9064.0] | [24.0, 24.0, 27.0] | [76, 206, 79] |
p02570 | u101232733 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["n= int(input())\naas= list(map(int, input().split(' ')))\n\nans=0\nfor i in range(n-1):\n for j in range(i+1, n):\n ans+= aas[i]*aas[j]\n if ans>(10**9+7):\n ans= ans% (10**9+7)\n\nprint(ans)", "d,t,s= map(int, input().split(' '))\n\nif s*t<d:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s912014587', 's122672294'] | [9184.0, 9152.0] | [28.0, 29.0] | [193, 81] |
p02570 | u102960641 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['def compare(a,b):\n res = 0\n for x,y in zip(a,b):\n if x == y:\n res += 1\n return res\n\ns,t = map(int, input().split())\nlen_t = len(t)\nans = 0\nfor i in range(len(s)-len(t)+1):\n ans = max(ans,compare(s[i:i+len_t],t))\nprint(ans)\n', 'a,b,c = map(int, input().split())\nprint("Yes") if b * c >= a else print("No")'] | ['Runtime Error', 'Accepted'] | ['s770959881', 's244479508'] | [9064.0, 8996.0] | [25.0, 27.0] | [235, 77] |
p02570 | u119071953 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['def is_late(distance, time, speed):\n if distance/speed <= time:\n return "Yes"\n else:\n return "No"\n ', 'def is_late(distance, time, speed):\n if distance/speed <= time:\n return "Yes"\n else:\n return "No"\n \nif __name__ =="__main__":\n user = [int(i) for i in input().split()]\n print(is_late(user[0], user[1], user[2]))'] | ['Wrong Answer', 'Accepted'] | ['s415969931', 's016818907'] | [9000.0, 9160.0] | [29.0, 25.0] | [108, 221] |
p02570 | u123579949 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['A,B,C=map(int,input().split())\nif A-B*C>=0:\n print("Yes")\nelse:\n print("No")\n ', 'A,B,C=map(int,input().split())\nif B*C-A>=0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s378507338', 's218088323'] | [9148.0, 9156.0] | [31.0, 34.0] | [81, 78] |
p02570 | u126183307 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['i = list(map(int, input().split()))\nprint("Yes" if i[0]>i[1]*1[2] else "No")\n', 'i = list(map(int, input().split()))\nprint("Yes" if i[0]>i[1]*i[2] else "No")', 'i = list(map(int, input().split()))\nprint("Yes" if i[0]<=i[1]*i[2] else "No")'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s199688551', 's931170697', 's559978628'] | [9156.0, 9164.0, 9140.0] | [27.0, 29.0, 31.0] | [77, 76, 77] |
p02570 | u128583260 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d,t,s =map(int,input().split())\nif d%s <=t :\n print(Yes)\nelse :\n print(No)', 's=list(input())\nt=list(input())\nresult=0\n#count=0\nfor i in range(len(s)-len(t)+1) :\n count=0\n for n in range(len(t)):\n if s[i+n]==t[n]:\n count += 1\n #s[i:i+len(t)] == t\n \n if count>result:\n result=count\n\n\nprint(len(t)-result)', "d,t,s =map(int,input().split())\nif d%s <=t :\n print('Yes')\nelse :\n print('No')", 'import sys\ninput = sys.stdin.readline\nn = int(input())\na = list(map(int,input().split()))\nre = 0\nre2 = 0\n\nfor i in range(n):\n for m in range(n-i-1):\n re = a[i]*a[i+m+1]\n re2 += re\n\nans = re2 %1000000007\nprint(ans)', "d,t,s =map(int,input().split())\nif d/s <=t :\n print('Yes')\nelse :\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s061221824', 's207436802', 's321889529', 's875161461', 's272650508'] | [9144.0, 9092.0, 9148.0, 9184.0, 9060.0] | [25.0, 25.0, 28.0, 24.0, 29.0] | [80, 269, 84, 230, 84] |
p02570 | u135642682 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d, t, s = input().split()\nif int(s) * int(t) >= d:\n print("Yes")\nelse:\n print("No")', 'd, t, s = input().split()\nif int(s) * int(t) >= int(d):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s452686322', 's805045714'] | [9120.0, 9100.0] | [25.0, 28.0] | [89, 94] |
p02570 | u135832955 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d,t,s=map(int, input().split())\nif d/s<=t:\n print('No')\nelse:\n print('Yes')", "d,t,s=map(int, input().split())\nif d/s<=t:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s521616629', 's344827848'] | [9152.0, 9092.0] | [38.0, 26.0] | [81, 81] |
p02570 | u136282556 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["D=int(input('D='))\nT=int(input('T='))\nS=int(input('S='))\n\nif (D/S)<=T:\n print('Yes')\nelse:\n print('No')", "D,T,S = map(int, input().split())\n\nif (D/S)<=T:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s655653782', 's451794905'] | [9124.0, 9104.0] | [22.0, 28.0] | [109, 86] |
p02570 | u137038354 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["D,T,S = map(int,input().split())\n\nif D < S * T:\n print('No')\nelse:\n print('Yes')", "D,T,S = map(int,input().split())\n\nif D > S * T:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s306870351', 's581319352'] | [9148.0, 9152.0] | [32.0, 31.0] | [86, 86] |
p02570 | u144242534 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['n = int(input())\na = list(map(int, input().split()))\nsum = 0\nfor each in range(1,n):\n for other in range(each):\n sum += (a[each] % (10**9 + 7)) * (a[other] % (10**9 + 7))\n sum = sum % (10**9 + 7)\nprint(sum)', 'd,t,s = map(int, input().split())\ntime = d / s\nif t >= time:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s893830385', 's718008666'] | [9180.0, 9156.0] | [29.0, 29.0] | [223, 99] |
p02570 | u145145077 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | [" print('No')", "d,t,s=map(int,input().split())\n\nif d / s <= t:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s799558136', 's810753460'] | [9064.0, 9104.0] | [28.0, 29.0] | [13, 81] |
p02570 | u145838785 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d,t,s=map(int,input()).split())\nif s == 0:\n print("No")\nelif d/s => t :\n print("Yes")\nelse:\n print("No")', 'd,t,s=map(int,input().split())\nif s == 0:\n print("No")\nelif d/s <= t :\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s490744481', 's529031080'] | [9004.0, 9164.0] | [30.0, 34.0] | [113, 112] |
p02570 | u147910356 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['user = input()\nif(user == 1000, user == 15, user == 80):\n print("yes")\nelif(user == 2000, user == 20, user == 100):\n print("Yes")\nelse:\n print("No")\n', 'D, T, S = map(int, input().split())\nNT = D/S\nif NT > T:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s027540295', 's423576274'] | [9084.0, 9156.0] | [31.0, 29.0] | [158, 94] |
p02570 | u149604146 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d, t, s = map(int, input().split())\n\nts = d / s\ndiff = ts - t\nprint(diff)\nif diff > 0:\n print('No')\nelse:\n print('Yes')", "d, t, s = map(int, input().split())\n\nts = d / s\ndiff = ts - t\nif diff > 0:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s919055106', 's486821182'] | [9156.0, 9156.0] | [33.0, 26.0] | [121, 109] |
p02570 | u153047519 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['n = int(input())\na = list(map(int, input().split()))\nresult = 0\nd = 0\nfor i in range(n):\n d += a[i] ** 2\nresult = int(((sum(a) % (10**9 + 7)) ** 2 - d) / 2)\nresult = result % (10**9 + 7)\nprint(result)', 'n = int(input())\na = list(map(int, input().split()))\nresult = 0\nfor i in range(n):\n for j in range(i + 1, n):\n result += a[i] * a[j]\nresult = result % (10**9 + 7)\nprint(result)\n', 'd, t, s = map(int, input().split())\nif s * t < d:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s769821460', 's806810000', 's879399350'] | [9064.0, 9084.0, 9156.0] | [30.0, 27.0, 29.0] | [201, 181, 84] |
p02570 | u153427406 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d,t,s=map(int,input().split())\nactualTime=d/s\n \nif actualTime=<t:\n print('Yes')\nelse:\n print('No')", "d,t,s=map(int,input().split())\nactualTime=d/s\n \nif actualTime<=t:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s094311568', 's201181003'] | [8932.0, 9080.0] | [25.0, 28.0] | [100, 100] |
p02570 | u153823221 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['a, b, c= map(int,input().split())\n\nif b * c <= a:\n print("Yes")\nelse:\n print("No")', 'a, b, c= map(int,input().split())\n\nif b * c >= a:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s793579826', 's038329069'] | [9156.0, 9152.0] | [34.0, 25.0] | [84, 85] |
p02570 | u153955689 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["D, T, S = map(int,input().split())\nprint('YES') if T * S >= D else print('No') ", "D, T, S = map(int(),input().split())\nprint('YES') if T * S >= D else print('No') ", "D, T, S = map(int,input().split())\nprint('Yes') if T * S >= D else print('No') "] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s667434880', 's674509215', 's902120543'] | [9092.0, 9024.0, 9156.0] | [29.0, 26.0, 27.0] | [79, 81, 79] |
p02570 | u154777379 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d,t,s = map(int,input())\n\nif d > t * s :\n print('No')\nelse:\n print('Yes')", "d,t,s = map(int,input().split())\n\nif d > t * s :\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s911535086', 's650681544'] | [9092.0, 9056.0] | [25.0, 25.0] | [79, 87] |
p02570 | u161322737 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['n = int(input())\na = list(map(int,input().split()))\nsum = 0\nans = 0\n\n# a[i] = a[i] % (10**9 +7)\n#\n\n\nfor i in range(n):\n sum += a[i]\n\nfor i in range(n-1):\n sum -= a[i]\n ans += a[i] * sum\n\nprint(ans % (10**9 + 7))\n', 'd,t,s = map(int,input().split())\nif d/s <= t:\n print("Yes")\n\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s136864641', 's779433857'] | [9172.0, 9160.0] | [23.0, 28.0] | [252, 85] |
p02570 | u162612857 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d, time, s = list(map(int, input().split()))\n\nif time * s <= d:\n print('Yes')\nelse:\n print('No')\n", "d, time, s = list(map(int, input().split()))\n\nif time * s >= d:\n print('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s129413408', 's962920874'] | [9176.0, 9148.0] | [31.0, 27.0] | [103, 103] |
p02570 | u164471280 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['# union-find\n# https://note.nkmk.me/python-union-find/\n\nclass UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n return self.find(self.parents[x])\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n return\n \n def size(self, x):\n x = self.find(x) \n return self.parents[x]*(-1)\n\ndef main():\n n, m = map(int, input().split())\n friend = UnionFind(n)\n\n for _ in range(m):\n a, b = map(int, input().split())\n friend.union(a-1, b-1)\n \n ans = 0\n for i in range(n):\n ans = max(ans, friend.size(i))\n print(ans)\n\nif __name__ == "__main__":\n main()\n', "d, t, s = map(int, input().split())\nif s*t >= d:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s925588275', 's157118140'] | [9200.0, 9100.0] | [24.0, 29.0] | [1013, 87] |
p02570 | u168573507 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['N= int(input())\nlist1 =[]\nlist1 = list(map(int, input().split()))\nsum = 0\n\nprint(list1) \nfor i in range(N-1):\n for j in range(i+1,N):\n \n sum = sum + list1[i]*list1[j]\nanswer = divmod(sum, 10**9+7)\nprint(answer[1])\n', 'D, T, S = map(int, input().split())\nif (T*S >=D):\n print("Yes")\n\nelse:\n print("No")\n\n '] | ['Runtime Error', 'Accepted'] | ['s480599935', 's098153835'] | [9036.0, 9144.0] | [33.0, 29.0] | [232, 99] |
p02570 | u169042722 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['a,b,c=input().split()\nif b*c>=a:\n print ("Yes")\nelse:\n print("No")\n', 'a,b,c=[int(a) for a in input().split()]\nif b*c>=a:\n print ("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s677110459', 's249055829'] | [9080.0, 9128.0] | [27.0, 30.0] | [69, 86] |
p02570 | u175476241 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['D,T,S = map(int, input().split())\nif (D/T >= S):\n \tprint("Yes")\nelse:\n\tprint("No")', 'x,y,z = input.split()\nif (x/y <= z)\n\tprint("Yes")\nelif\n\tprint("No")', 'D,T,S = map(int, input().split())\nif (D/T < S):\n \tprint("No")\nelse:\n\tprint("Yes")', 'D,T,S = map(int(), input().split())\nif (D/T < S):\n \tprint("No")\nelse\n\tprint("Yes")', 'x,y,z = input().split()\nif ( int(x) / int(y) >= int(z)):\n\tprint("Yes")\nelse:\n\tprint("No")', 'x,y,z = input.split()\nif (x/y >= z):\n\tprint("Yes")\nelif\n\tprint("No")', 'x,y,z = input.split()\nif (x/y >= z)\n\tprint("Yes")\nelif\n\tprint("No")', ' D,T,S = map(int, input().split())\nif (D/T > S):\n \tprint("No")\nelse:\n\tprint("Yes")', 'D,T,S = map(int, input().split())\nif (D/T <= S):\n \tprint("Yes")\nelse:\n\tprint("No")'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s033696968', 's197247678', 's243064209', 's461296553', 's582950250', 's795509607', 's885162321', 's954953823', 's195166587'] | [9076.0, 8816.0, 9068.0, 9016.0, 8988.0, 9012.0, 9016.0, 8840.0, 9100.0] | [28.0, 24.0, 28.0, 27.0, 34.0, 25.0, 26.0, 28.0, 33.0] | [83, 67, 82, 83, 89, 68, 67, 83, 83] |
p02570 | u176643848 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['input_data = list(map(int, input("ๅๆๆกไปถใๅ
ฅๅใใฆไธใใ(่ท้ขD ๆ้T ้ใS)").strip().split()))\nif (input_data[0] / input_data[2] <= input_data[1]):\n print("Yes")\nelse:\n print("No")', 'input_data = list(map(int, input("ๅๆๆกไปถใๅ
ฅๅใใฆไธใใ(่ท้ขD ๆ้T ้ใS)").strip().split()))\n# print(input_data)\n# print(input_data[0])\nif (input_data[0] / input_data[2] <= input_data[1]):\n print("Yes")\nelse:\n print("No")', 'print("ๅๆๆกไปถใๅ
ฅๅใใฆไธใใ")\nD = int(input("้ซๆฉใใใฎๅฎถใใๅพ
ใกๅใใๅ ดๆใพใงใฎ่ท้ขD[m]ใๅ
ฅๅใใฆไธใใ"))\nT = int(input("ๅพ
ใกๅใใใฎๆๅปใพใงใฎๆ้[min]ใๅ
ฅๅใใไธใใ"))\nS = int(input("้ซๆฉใใใฎ็งปๅใใ้ใ[m/min]ใๅ
ฅๅใใฆไธใใ"))\n# input_data = [D, T, S]\n# print(input_data)\nif (D / S <= T):\n print("Yes")\nelse:\n print("No")', 'input_data = list(map(int, input().strip().split()))\nif (input_data[0] / input_data[2] <= input_data[1]):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s121466563', 's389814714', 's406506298', 's844776993'] | [9164.0, 9104.0, 9168.0, 8780.0] | [30.0, 28.0, 23.0, 31.0] | [207, 250, 423, 144] |
p02570 | u183432736 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['S = str(input())\nT = str(input())\ntempcount = 0\nmincount = 0\n\nif S in T:\n print("0")\n exit\n\nfor i in range(len(S) - len(T)+1):\n for j in range(len(T)):\n if S[i + j] != T[j]:\n tempcount += 1\n if i == 0:\n mincount = tempcount\n elif tempcount < mincount:\n mincount = tempcount\n tempcount = 0\n \nprint(mincount)\n\n', 'D,T,S=map(int,input().split())\nMax = 0\n\nif D/S<=T:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s590522224', 's243100451'] | [9068.0, 9156.0] | [22.0, 29.0] | [361, 89] |
p02570 | u185851743 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["N = input()\na_list = [int(i) for i in input().split(' ')]\nmod = 1000000007\n \nsum = 0\nfor i in a_list:\n sum += i\n\noutput_sum = 0\nfor idx, i in enumerate(a_list[:-1]):\n sum -= a_list[idx]\n output_sum += i*sum\n \nprint(output_sum%mod)", "if S*T > D:\n print('Yes')\nelse:\n print('No')", 'S = input()\nT = input()\n\nmin = len(T)\nfor t in range(len(S) - len(T)+1):\n tmp = 0\n for i in range(len(T)):\n if S[i+t] != T[i]:\n tmp+=1\n \n if tmp < min:\n min = tmp\n\nprint(min)', "N = input()\na_list = [int(i) for i in input().split(' ')]\nmod = 1000000007\n \nsum = 0\nfor i in a_list:\n sum += i\n \nfor idx, i in enumerate(a_list[:-1]):\n sum -= a_list[idx]\n sum += i*sum\n \nprint(sum%mod)", "N = input()\na_list = [int(i) for i in input().split(' ')]\nmod = 1000000007\n \nsum = 0\nfor i in a_list:\n sum += i\n \noutput_sum = 0\nfor idx, i in enumerate(a_list[:-1]):\n sum -= a_list[idx]\n output_sum += i*sum\n \nprint(output_sum%mod)", "N = input()\na_list = [int(i) for i in input().split(' ')]\nmod = 1000000007\n \nsum = 0\nfor i in a_list:\n sum += i\noutput_sum=0\nfor idx, i in enumerate(a_list[:-1]):\n sum -= a_list[idx]\n output_sum += i*sum\n \nprint(output_sum%mod)", "D,T,S = [int(i) for i in input().split(' ')]\n \nif T*S >= D:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s287683377', 's418218459', 's595573294', 's868472692', 's917671352', 's972195301', 's007742615'] | [9084.0, 9080.0, 8996.0, 9120.0, 9060.0, 8916.0, 9164.0] | [23.0, 24.0, 22.0, 34.0, 31.0, 23.0, 31.0] | [234, 46, 211, 206, 235, 231, 94] |
p02570 | u186397299 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['x = list(map(int, input("D T S:").split()))\n\nD = x[0]\nT = x[1]\nS = x[2]\n\nif 1<= D <=10000 and 1<= T <=10000 and 1<= S <= 10000:\n if D/S <= T:\n print("Yes")\n else:\n print("No")\nelse:\n print("ๅคใๆๅฎใฎ็ฏๅฒๅคใงใ")', 'x = list(map(int, input("").split()))\n\nD = x[0]\nT = x[1]\nS = x[2]\n\nif D/S <= T:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s140728955', 's244583920'] | [9156.0, 9080.0] | [25.0, 27.0] | [245, 118] |
p02570 | u187516587 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['D,T,S=map(int,input().spltit())\nif D>T*S:\n print("No")\nelse:\n print("Yes")', 'D,T,S=map(int,input().split())\nif D>T*S:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s407695718', 's769586706'] | [9096.0, 9160.0] | [21.0, 28.0] | [80, 79] |
p02570 | u191239329 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d, t, s = list(map(int, input().split()))\n\nif t * s >= d:\n print("yes")\nelse:\n print("no")', 'd, t, s = list(map(int, input().split()))\n\nif t * s >= d:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s107525809', 's837540199'] | [9084.0, 9020.0] | [24.0, 28.0] | [96, 96] |
p02570 | u196182810 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['requestMap = list(map(float, input().split()))\n\nD = requestMap[0]\nT = requestMap[1]\nS = requestMap[2]\n\nif (S * T) >= D:\n print("YES")\nelse:\n print("No")\n', 'requestMap = list(map(int, input().split()))\n\nD = requestMap[0]\nT = requestMap[1]\nS = requestMap[2]\n\nif (S * T) >= D:\n print("YES")\nelse:\n print("No")', 'requestMap = list(map(float, input().split()))\n\nD = requestMap[0]\nT = requestMap[1]\nS = requestMap[2]\n\nif (S * T) >= D:\n print("YES")\nelse:\n print("No")\n ', 'requestMap = list(map(float, input().split()))\n\nD = requestMap[0]\nT = requestMap[1]\nS = requestMap[2]\n\ndist = S * T\n\nif dist >= D:\n print("YES")\nelse:\n print("No")', 'def SumOfProduct(n, arrayA):\n ans = 0\n\n for i in range(0, len(arrayA)):\n for j in range(i + 1, len(arrayA)):\n ans += arrayA[i] * arrayA[j]\n\n print(ans)\n\nn = int(input())\narrayA = list(map(int, input().split()))\n\nSumOfProduct(n, arrayA)\n', 'requestMap = list(map(float, input().split()))\n\nD = requestMap[0]\nT = requestMap[1]\nS = requestMap[2]\n\nif (S * T) >= D:\n print("YES")\nelse:\n print("No")', 'requestMap = list(map(float, input().split()))\n\nD = requestMap[0]\nT = requestMap[1]\nS = requestMap[2]\n\ndist = S * T\n\nif dist >= D:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s110652209', 's587196101', 's617377549', 's740562449', 's840285056', 's952140576', 's178854253'] | [9024.0, 9164.0, 9016.0, 8976.0, 9056.0, 8900.0, 9040.0] | [29.0, 28.0, 28.0, 28.0, 23.0, 29.0, 28.0] | [155, 152, 157, 165, 247, 154, 165] |
p02570 | u198336369 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['n = int(input())\na = list(map(int, input().split()))\nsum = 0\nb = [i % (10**9+7) for i in a if i % (10**9+7) != 0]\n# print(b)\nfor j in range(0,len(b)-1):\n for k in range(j+1,len(b)):\n c = b[j]*b[k]\n sum = sum + c\nprint(sum%(10**9+7))', "d, t, s = map(int, input().split())\nif t*s < d:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s956805952', 's442922353'] | [9088.0, 9152.0] | [22.0, 30.0] | [249, 86] |
p02570 | u204198275 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['nums=input().split()\nt=int(nums[1])/int(nums[2])\nif t<int(nums[3]):\n print("Yes")\nelse:\n print("No")', 'nums=input().split()\nt=int(nums[1])/int(nums[3])\nif t<=int(nums[2]):\n print("Yes")\nelse:\n print("No")\n', 'nums=input().split()\nt=int(nums[1])/int(nums[3])\nif t<int(nums[2]):\n print("Yes")\nelse:\n print("No")\n', 'nums=input().split()\nt=int(nums[0])/int(nums[2])\nif t<=int(nums[1]):\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s278558019', 's384892176', 's562905996', 's480355260'] | [9076.0, 9024.0, 9068.0, 9024.0] | [29.0, 28.0, 24.0, 32.0] | [102, 104, 103, 104] |
p02570 | u206873502 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['D=int(input())\nT=int(input())\nS=int(input())\na=float(T-D/S)\nif a>=0:\n print("Yes")\nelse :\n print("No")', 'D=input()\nT=input()\nS=input()\nif T-D/S>=0:\n print("Yes")\n else print("No")\n', 'D=int(input())\nT=int(input())\nS=int(input())\na=float(T-D/S)\nif a>0:\n print("Yes")\nelse :\n print("No")', 'D,T,S=input().split()\nD=int(D)\nT=int(T)\nS=int(S)\na=float(T-D/S)\nif a>=0:\n print("Yes")\nelse :\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s000539559', 's195290934', 's920470973', 's468558627'] | [9164.0, 8948.0, 9116.0, 9152.0] | [25.0, 22.0, 26.0, 25.0] | [108, 81, 107, 112] |
p02570 | u208309047 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['INF = 10 ** 9 + 7\nN = int(input())\nA = list(map(int, input().split()))\nS = [sum(A)]\n\nans = 0\nfor i in range(N):\n key = S[-1]\n S.append(key - A[i])\n #print(S)\n ans += (A[i] * S[-1])\n\nprint(ans % INF)', 'D,T,S = map(int, input().split())\n\nA = D/S\n\nif (A > T):\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s863438523', 's860170119'] | [9060.0, 9076.0] | [25.0, 29.0] | [486, 96] |
p02570 | u208588434 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["d, t, s = map(int, input().split())\nif d <= t * s:\n print('yes')\nelse:\n print('no')\n ", "d, t, s = map(int, input().split())\nif d <= t * s:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s606453348', 's464835122'] | [9068.0, 9056.0] | [30.0, 29.0] | [88, 85] |
p02570 | u208633734 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ['d,t,s = map(int,input().split())\nif d/s<t:\n print("No")\nelse:\n print("Yes")', 'D,T,S = map(input().split())\nif D/S>=T:\n print("No")\nelse:\n print("Yes")', 'D,T,S = map(int,input().split())\nif D/S<T:\n print("No")\nelse:\n print("Yes")', 'd,t,s = map(int,input().split())\nif d/s>t:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s411666133', 's604938402', 's927914489', 's725936493'] | [9100.0, 8880.0, 9080.0, 9144.0] | [27.0, 25.0, 29.0, 24.0] | [77, 74, 77, 77] |
p02570 | u213314609 | 2,000 | 1,048,576 | Takahashi is meeting up with Aoki. They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now. Takahashi will leave his house now and go straight to the place at a speed of S meters per minute. Will he arrive in time? | ["D, T, S = map(int, input()).split()\nif T*S <= D:\n print('Yes')\nelse: \n print('No')", "D, T, S = list(map(int, input().split()))\nif T*S <= D:\n print('Yes')\nelse: \n print('No')\n", "D, T, S = list(map(int, input().split()))\nif T*S >= D:\n print('Yes')\nelse: \n print('No')\n"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s145360737', 's938906539', 's551449779'] | [8976.0, 9060.0, 9012.0] | [23.0, 32.0, 27.0] | [84, 91, 91] |
Subsets and Splits