QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#645422#9462. Safest BuildingsyhdddAC ✓1ms3872kbC++201.2kb2024-10-16 18:17:472024-10-16 18:17:49

Judging History

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

  • [2024-10-16 18:17:49]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3872kb
  • [2024-10-16 18:17:47]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=200010;
const int inf=1e18;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,m,r;
pii a[maxn];
vector<int> ans;
void work(){
	n=read();r=read();m=read();
	for(int i=1;i<=n;i++){
		int u=read(),v=read();
		a[i]={u*u+v*v,i};
	}
	sort(a+1,a+n+1);
	ans.clear();
	for(int i=1;i<=n;i++)if(a[i].fi<=(r-2*m)*(r-2*m))ans.pb(a[i].se);
	if(!ans.size()){
		for(int i=1;i<=n;i++)if(a[i].fi==a[1].fi)ans.pb(a[i].se);
	}
	printf("%lld\n",(int)ans.size());
	sort(ans.begin(),ans.end());
	for(int i:ans)printf("%lld ",i);puts("");
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=read();
	while(T--)work();
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 0ms
memory: 3820kb

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 2...

result:

ok 1674 tokens

Extra Test:

score: 0
Extra Test Passed