QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#632925#9462. Safest Buildingsucup-team052#AC ✓2ms3808kbC++23845b2024-10-12 14:12:492024-10-12 14:12:53

Judging History

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

  • [2024-10-12 14:12:53]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3808kb
  • [2024-10-12 14:12:49]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define N 100005
int n,R,r;
struct Vec
{
	int x,y,id;
	int norm() {return x*x+y*y;}
};
Vec a[N];
void work()
{
	cin>>n>>R>>r;
	for(int i=1;i<=n;i++) cin>>a[i].x>>a[i].y,a[i].id=i;
	sort(a+1,a+n+1,[&](Vec x,Vec y) {return x.norm()<y.norm();});
	vector<int> ans;
	int cur=1;
	ans.push_back(a[1].id);
	while(cur+1<=n)
	{
		cur++;
		if(a[1].norm()==a[cur].norm()) ans.push_back(a[cur].id);
		else if((a[1].norm()<=(2*r-R)*(2*r-R))&&(a[cur].norm()<=(2*r-R)*(2*r-R))) ans.push_back(a[cur].id);
		else break;
	}
	cout<<ans.size()<<endl;
	sort(ans.begin(),ans.end());
	for(int i=0;i<(int)ans.size();i++) printf("%d%c",ans[i]," \n"[i==(int)ans.size()-1]);
}
signed main()
{
#ifdef xay5421
	freopen("b.in","r",stdin);
#endif
	int T; cin>>T;
	while(T--) work();
	return 0;
}

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

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

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

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