QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #636796 | #9462. Safest Buildings | ucup-team4810# | AC ✓ | 23ms | 10704kb | Python3 | 467b | 2024-10-13 02:57:13 | 2024-10-13 02:57:14 |
Judging History
answer
def tc():
n,R,r = map(int,input().split())
pts=[]
for i in range(n):
x,y = map(int,input().split())
pts.append((x**2+y**2,x,y,i+1))
pts.sort()
if pts[0][0] <= (R-r*2)**2:
lst = [pt for pt in pts if pt[0] <= (R-r*2)**2]
else:
lst = [pt for pt in pts if pt[0] == pts[0][0]]
print(len(lst))
print(' '.join(map(str, sorted((pt[3]) for pt in lst))))
for _ in range(int(input())):
tc()
这程序好像有点Bug，我给组数据试试？
詳細信息
Test #1:
score: 100
Accepted
time: 18ms
memory: 10704kb
input:
2 3 10 5 3 4 3 5 3 6 3 10 4 -7 -6 4 5 5 4
output:
1 1 2 2 3
result:
ok 5 tokens
Test #2:
score: 0
Accepted
time: 23ms
memory: 10616kb
input:
100 6 100 50 42 -31 -66 7 13 84 94 13 51 -14 -18 9 12 100 50 -78 56 -56 -64 -22 54 -41 14 -14 55 21 -83 75 21 -51 56 -31 74 -34 79 22 -37 1 -12 14 100 50 15 71 -44 41 -56 78 -48 22 42 -2 -70 28 51 -34 49 -31 -36 67 63 70 34 9 27 -33 36 -93 -52 -19 8 100 14 21 89 67 60 -12 -3 24 -37 -51 14 -30 8 -75 ...
output:
1 6 1 12 1 11 4 3 4 5 6 7 1 4 6 8 9 12 13 1 1 6 2 4 5 7 13 14 7 1 3 4 5 6 7 9 1 11 9 1 2 3 4 5 6 7 8 9 1 29 1 5 1 29 47 1 2 3 4 5 6 7 9 10 11 12 14 17 18 19 21 22 24 25 26 27 28 30 31 32 33 34 35 36 37 38 39 40 41 43 44 45 46 47 48 50 51 52 53 54 55 56 2 21 29 20 1 5 6 7 10 13 14 18 21 25 26 30 33 3...
result:
ok 1674 tokens
Extra Test:
score: 0
Extra Test Passed