QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#649251#9462. Safest BuildingslonlynessAC ✓0ms3668kbC++231.3kb2024-10-17 22:18:492024-10-17 22:18:49

Judging History

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

  • [2024-10-17 22:18:49]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3668kb
  • [2024-10-17 22:18:49]
  • 提交

answer

//  _                          _   _                            
// | |   ___    _ __     ___  | | (_)  _ __     ___   ___   ___ 
// | |  / _ \  | '_ \   / _ \ | | | | | '_ \   / _ \ / __| / __|
// | | | (_) | | | | | |  __/ | | | | | | | | |  __/ \__ \ \__ \
// |_|  \___/  |_| |_|  \___| |_| |_| |_| |_|  \___| |___/ |___/
//                                                              
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<unordered_map>
using namespace std;
#define int long long
#define endl "\n"
const int N = 1e6+10,mod=1e9+13;

typedef pair<int,int> PII;
int n,m;
void solve()
{
    int R,r;
    cin>>n>>R>>r;
    vector<PII>a(n);
    for(int i = 0;i < n;i ++){
        int x,y;
        cin>>x>>y;
        a[i].first=max(x*x+y*y,(R-2*r)*(R-2*r));
        a[i].second = i+1;
    }
    sort(a.begin(),a.end());
    int ans = 0;
    while(ans<n&&a[ans].first==a[0].first)ans++;
    cout<<ans<<endl;
    for(int i= 0;i < ans-1;i ++)cout<<a[i].second<<' ';
    cout<<a[ans-1].second<<endl;
}
signed  main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

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

详细

Test #1:

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

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

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