← Back to List

6003번: Claustrophobic Cows ↗

Solutions

Python 3
1.0 KB | 1047 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta

SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "

if SET_RECURSION:
    sys.setrecursionlimit(RECURSION_LIMIT)

inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print

def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)

def f(a, b):
    return (a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2

def solve():
    n = ii()
    l = [mii() for _ in range(n)]

    ans = []
    mn = 1e30

    for i in range(n):
        for j in range(i + 1, n):
            dis = f(l[i], l[j])

            if dis < mn:
                mn = dis
                ans = [i + 1, j + 1]

    p(*ans)

if __name__ == "__main__":
    tc = 1
    for t in range(1, tc+1):
        ret = solve()