QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#635251#9462. Safest Buildingsucup-team3586#WA 1ms3596kbC++231.6kb2024-10-12 19:22:372024-10-12 19:22:37

Judging History

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

  • [2024-10-12 19:22:37]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3596kb
  • [2024-10-12 19:22:37]
  • 提交

answer

//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int x[105],y[105];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		int n,R,r;
		cin>>n>>R>>r;
		for(int i=1;i<=n;i++)
			cin>>x[i]>>y[i];
		int cnt=0;
		for(int i=1;i<=n;i++)
		{
			if(R<r+r) continue;
			int len=R-r-r;
			if(x[i]*x[i]+y[i]*y[i]<=len*len)
				cnt++;
		}
		if(cnt)
		{
			cout<<cnt<<'\n';
			for(int i=1;i<=n;i++)
			{
				int len=R-r-r;
				if(x[i]*x[i]+y[i]*y[i]<=len*len)
				{
					cnt--;
					cout<<i;
					if(cnt)
						cout<<" ";
					else
						cout<<'\n';
				}
			}
		}
		else
		{
			int mn=inf;
			for(int i=1;i<=n;i++)
				mn=min(mn,x[i]*x[i]+y[i]*y[i]);
			int cnt=0;
			for(int i=1;i<=n;i++)
				if(mn==x[i]*x[i]+y[i]*y[i])
					cnt++;
			cout<<cnt<<'\n';
			for(int i=1;i<=n;i++)
				if(mn==x[i]*x[i]+y[i]*y[i])
				{
					cnt--;
					cout<<i;
					if(cnt)
						cout<<" ";
					else
						cout<<'\n';
				}
		}
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3580kb

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: 1ms
memory: 3596kb

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'