QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#674472#9462. Safest Buildingsucup-team1338#AC ✓2ms4064kbC++20677b2024-10-25 15:57:122024-10-25 15:57:14

Judging History

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

  • [2024-10-25 15:57:14]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:4064kb
  • [2024-10-25 15:57:12]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=5005;
ll dis[maxn];
void solve() {
    int n;cin>>n;
    ll R,r;cin>>R>>r;
    R=R-2*r;
    ll mdis=1e18;
    for(int i=1;i<=n;i++) {
        ll x,y;cin>>x>>y;
        dis[i]=max(R*R,x*x+y*y);
        mdis=min(mdis,dis[i]);
    }
    vector<int> ans;
    for(int i=1;i<=n;i++) {
        if(mdis==dis[i]) ans.push_back(i);
    }
    printf("%d\n",ans.size());
    //for(auto x:ans) printf("%d ",x);
    for(int i=0;i<ans.size()-1;i++) printf("%d ",ans[i]);
    printf("%d\n",ans.back());
}
int main() {
    int t;cin>>t;
    while(t--) solve();
    return 0;

}



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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 2ms
memory: 3792kb

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