QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#676151#9462. Safest Buildingswjy#WA 2ms3688kbC++231021b2024-10-25 20:27:502024-10-25 20:27:50

Judging History

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

  • [2024-10-25 20:27:50]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3688kb
  • [2024-10-25 20:27:50]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
#define pldld pair<ld, ld>
#define x first
#define y second
const ld eps = 1e-20;
ld dist(pldld a, pldld b) {
	return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); 
}
void solve() {
	ld n, R, r; cin >> n >> R >> r;
	vector<pldld> b(n); vector<ld> d(n);
	ld mn = 2e4 + 10;
	for (int i = 0; i < n; i++) {
		cin >> b[i].x >> b[i].y;
		d[i] = dist(b[i], {0, 0});
		mn = min(mn, d[i]);
	}
	vector<int> ans;
	for (int i = 0; i < n; i++) {
		if (fabs(d[i] - mn) <= eps) ans.push_back(i);
	}
	if (mn < R - 2 * r || fabs(mn - R + 2 * r) <= eps) {
		ans.clear();
		for (int i = 0; i < n; i++) if (d[i] < R - 2 * r || fabs(d[i] - R + 2 * r) <= eps) ans.push_back(i);
	}
	cout << ans.size() << '\n';
	for (int i : ans) {
		cout << i + 1; if (i != *(ans.rbegin())) cout << ' ';
	} cout << '\n';
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int T; cin >> T;
	while (T--) solve();
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3688kb

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: 2ms
memory: 3688kb

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
1
5
1
9
1
11
1
5
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 35 37 38 41 43 45 48
1
29
1
14
1
14
1
13
...

result:

wrong answer 22nd words differ - expected: '6', found: '1'