QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#633025#9462. Safest Buildingsucup-team4702#AC ✓0ms4172kbC++171.0kb2024-10-12 14:23:322024-10-12 14:23:34

Judging History

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

  • [2024-10-12 14:23:34]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:4172kb
  • [2024-10-12 14:23:32]
  • 提交

answer

#include<bits/stdc++.h>
#define y1 _
using namespace std;
const double eps=1e-12;
inline double f(double x1,double y1,double r1,double x2,double y2,double r2){
  double d=hypotl(x1-x2,y1-y2);
  if(d>=r1+r2)return 0;
  if(d<=fabs(r1-r2)){
    double r_min=min(r1,r2);
    return M_PI*r_min*r_min;
  }
  double a1=2*acos(1.0*(r1*r1+d*d-r2*r2)/(2*r1*d));
  double a2=2*acos(1.0*(r2*r2+d*d-r1*r1)/(2*r2*d));
  return 0.5*r1*r1*(a1-sin(a1))+0.5*r2*r2*(a2-sin(a2));
}
int main(){
  ios::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  int t; cin>>t;
  while(t--){
    int n,R,r; cin>>n>>R>>r;
    vector<pair<double,int> > v(n);
    for(int i=0;i<n;i++){
      int x,y; cin>>x>>y;
      v[i]=make_pair(f(x,y,r,0,0,R-r),i);
    }
    sort(v.begin(),v.end(),greater<>());
    vector<int> w;
    for(int i=0;i<n;i++)
      if(fabs(v[i].first-v[0].first)<eps)
        w.emplace_back(v[i].second);
    cout<<w.size()<<'\n';
    sort(w.begin(),w.end());
    for(int i=0;i<w.size();i++)
      cout<<w[i]+1<<" \n"[i+1==w.size()];
  }
  return 0;
}

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

詳細信息

Test #1:

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

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: 4136kb

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