제출 #924029

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
924029		Danusan	Best Place (NOI17_bestplace)	Cpython 3	0 / 100	12 ms	2908 KiB

bestplace

import math
def main():
  num=int(input())
  x=[]
  y=[]
  xval={}
  yval={}
  for i in range(num):
    xn = int(input())
    yn =int(input())
    x.append(xn)
    y.append(yn)
  for i in range(num):
    for j in range(i+1,num):
      xval[i]=xval.get(i,0) + abs(x[i]-x[j])
      xval[j]=xval.get(j,0) + abs(x[i]-x[j])
  for i in range(num):
    for j in range(i+1,num):
      yval[i]= yval.get(i,0) + abs(y[i]-y[j])
      yval[j]= yval.get(j,0) + abs(y[i]-y[j])
  print [min(xval, key=xval.get),min(yval, key=yval.get)]
  return 0

• Subtask 1: 0 / 3
• Subtask 2: 0 / 20
• Subtask 3: 0 / 28
• Subtask 4: 0 / 13
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19