제출 #753112

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
753112		teerapat_	Pairs (IOI07_pairs)	Cpython 3	12 / 100	836 ms	524288 KiB

pairs

import math

answer = 0
B, N, D, M  = map(int, input().split())
px = [0] * N
py = [0] * N
pz = [0] * N
p_range = [[0] * N for i in range(N)]

if B == 1:
    for i in range(N):
        px[i] = int(input())
    px.sort()
    for i in range(N):
        aux = px[i]
        for j in range(i+1, N):
            aux = abs(px[i] - px[j])
            if aux <= D:
                answer += 1
elif B == 2 :
    for i in range(N):
        px[i], py[i] = map(int, input().split())

    for i in range(N):
        for j in range(i+1, N):
            temp_aux = math.sqrt(math.pow(px[i] - px[j], 2) + math.pow(py[i] - py[j], 2))
            aux = round(temp_aux)
            # print(f'{str(px[i])},{str(py[i])}', f'{str(px[j])},{str(py[j])}', 'aux:',aux, 'D:', D)
            if temp_aux < aux:
                aux += 1
            if aux <= D:
                answer += 1

elif B == 3:
    for i in range(N):
        px[i], py[i], pz[i] = map(int, input().split())
    for i in range(N):
        for j in range(i+1, N):
            temp_aux = math.sqrt(math.pow(px[i] - px[j], 2) + math.pow(py[i] - py[j], 2) + math.pow(pz[i] - pz[j], 2))
            aux = round(temp_aux)
            # print(f'{str(px[i])},{str(py[i])}', f'{str(px[j])},{str(py[j])}', 'aux:',aux, 'D:', D)
            if temp_aux < aux:
                aux += 1
            if aux <= D:
                answer += 1

print(answer)

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 0 / 6
• Subtask 4: 0 / 6
• Subtask 5: 0 / 6
• Subtask 6: 0 / 7
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10
• Subtask 12: 0 / 10
• Subtask 13: 0 / 10