QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#636789#9462. Safest Buildingsucup-team4810#WA 17ms10632kbPython3452b2024-10-13 02:54:142024-10-13 02:54:15

Judging History

你现在查看的是最新测评结果

  • [2024-10-13 02:54:15]
  • 评测
  • 测评结果:WA
  • 用时:17ms
  • 内存:10632kb
  • [2024-10-13 02:54:14]
  • 提交

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(str(pt[3]) for pt in lst))


for _ in range(int(input())):
    tc()

详细

Test #1:

score: 100
Accepted
time: 10ms
memory: 10540kb

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: -100
Wrong Answer
time: 17ms
memory: 10632kb

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 6 4 5
7
12 4 13 9 1 6 8
1
1
6
5 7 2 13 14 4
7
9 1 3 7 4 6 5
1
11
9
5 2 1 8 9 4 3 7 6
1
29
1
5
1
29
47
33 25 48 45 7 18 43 19 2 27 32 17 38 54 3 14 12 56 22 41 28 36 34 44 6 47 21 55 37 9 11 26 52 24 46 4 10 1 51 40 39 30 31 53 5 35 50
2
21 29
20
35 26 45 7 10 33 5 48 6 43 41 13 30 ...

result:

wrong answer 9th words differ - expected: '4', found: '6'