제출 #26031

#제출 시각아이디문제언어결과실행 시간메모리
26031leejseo먼 별 (KOI16_dist)Cpython 2
2 / 100
2062 ms16 KiB
import sys class Star: def __init__(self, x, y, dx, dy): self.x = x self.y = y self.dx = dx self.dy = dy def place(self, t): return [ self.x + t * self.dx , self.y + t * self.dy] def dist(self, P, t): P1 = self.place(t) P2 = P.place(t) x1, y1 = P1[0], P1[1] x2, y2 = P2[0], P2[1] return (x2 - x1)*(x2 - x1) + (y2 - y1)*(y2 - y1) def g(L, t): n = len(L) cnt = 0 for i in range(n): for j in range(i): temp = L[i].dist(L[j], t) if temp > cnt: cnt = temp return cnt def f(L, P): lo = 0 hi = P while (lo <= hi): llh = (2*lo + hi)/3 lhh = (lo + 2*hi + 1)/3 if g(L, llh) <= g(L, lhh): hi = lhh-1 else: lo = llh+1 return [lo, g(L, lo)] n, T = map(int, sys.stdin.readline().split()) L = [None]*n for i in range(n): x, y, dx, dy = map(int, sys.stdin.readline().split()) L[i] = Star(x, y, dx, dy) k = f(L, T) print k[0] print k[1]
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...