Submission #1184973


Source Code Expand

import math
n,m=map(int,raw_input().split())
a=[]
b=[]
for i in range(n):
	ia,ib=map(int,raw_input().split())
	a.append(ia)
	b.append(ib)
c=[]
d=[]
for i in range(m):
	ic,id=map(int,raw_input().split())
	c.append(ic)
	d.append(id)
for i in range(n):
	dist=10**9
	ans=0
	for j in range(m):
		ndist=abs(a[i]-c[j])+abs(b[i]-d[j])
		if ndist<dist:
			dist=ndist
			ans=j+1
	print ans

Submission Info

Submission Time
Task B - Checkpoints
User fiord
Language Python (2.7.6)
Score 200
Code Size 403 Byte
Status AC
Exec Time 11 ms
Memory 2692 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt
Case Name Status Exec Time Memory
sample_01.txt AC 10 ms 2692 KB
sample_02.txt AC 10 ms 2692 KB
sample_03.txt AC 10 ms 2692 KB
subtask_1_1.txt AC 11 ms 2692 KB
subtask_1_2.txt AC 11 ms 2692 KB
subtask_1_3.txt AC 11 ms 2692 KB
subtask_1_4.txt AC 10 ms 2692 KB
subtask_1_5.txt AC 10 ms 2692 KB
subtask_1_6.txt AC 11 ms 2692 KB
subtask_1_7.txt AC 11 ms 2692 KB