QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#634963#9462. Safest Buildingsucup-team3282#AC ✓0ms3564kbC++201.2kb2024-10-12 18:29:432024-10-12 18:29:43

Judging History

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

  • [2024-10-12 18:29:43]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3564kb
  • [2024-10-12 18:29:43]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=120;

int T;
int n,R,r;
int x[maxn],y[maxn];
int d[maxn];

int main(){
    ios::sync_with_stdio(0);
    cin>>T;
    while(T--){
        cin>>n>>R>>r;
        for(int i=1;i<=n;i++)
            cin>>x[i]>>y[i];
        if(r+r<=R){
            for(int i=1;i<=n;i++){
                d[i]=max(x[i]*x[i]+y[i]*y[i],(R-r-r)*(R-r-r));
            }
            int mn=*min_element(d+1,d+n+1);
            vector<int> p;
            for(int i=1;i<=n;i++)
                if(d[i]==mn)
                    p.push_back(i);
            cout<<p.size()<<endl;
            for(int i:p)
                cout<<i<<"\n "[i!=p.back()];
        }
        else{
            for(int i=1;i<=n;i++){
                d[i]=max(x[i]*x[i]+y[i]*y[i],(r+r-R)*(r+r-R));
            }
            int mn=*min_element(d+1,d+n+1);
            vector<int> p;
            for(int i=1;i<=n;i++)
                if(d[i]==mn)
                    p.push_back(i);
            cout<<p.size()<<endl;
            for(int i:p)
                cout<<i<<"\n "[i!=p.back()];
        }
    }


    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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