QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#674083#9462. Safest BuildingsWolam#AC ✓1ms3736kbC++201.4kb2024-10-25 13:41:482024-10-25 13:41:48

Judging History

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

  • [2024-10-25 13:41:48]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3736kb
  • [2024-10-25 13:41:48]
  • 提交

answer

#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
using ll = long long;
const int maxn = 110;
pair<ll,ll> center[maxn];
ll dis(pair<ll,ll> x,pair<ll,ll> y)
{
    return (x.first-y.first)*(x.first-y.first)+(x.second-y.second)*(x.second-y.second);
}
void solve(void)
{
    ll n,R,r;
    cin>>n>>R>>r;
    for(int i=1;i<=n;i++)
    {
        cin>>center[i].first>>center[i].second;
    }
    vector<int> ans;
    for(int i=1;i<=n;i++)
    {
        if(dis(center[i],center[0])<=(2*r-R)*(2*r-R))//A bao han B
        {
            ans.emplace_back(i);
        }
    }
    if(!ans.empty())
    {
        cout<<ans.size()<<endl;
        for(int i=0;i<(int)ans.size();i++)
        {
            cout<<ans[i]<<" \n"[i==ans.size()-1];
        }
        return;
    }
    ll mn=1e18;
    for(int i=1;i<=n;i++)
    {
        if(dis(center[i],center[0])<mn)
        {
            ans.clear();
            ans.emplace_back(i);
            mn=dis(center[i],center[0]);
        }
        else if(dis(center[i],center[0])==mn)
        {
            ans.emplace_back(i);
        }
    }
    cout<<ans.size()<<endl;
    for(int i=0;i<(int)ans.size();i++)
    {
        cout<<ans[i]<<" \n"[i==ans.size()-1];
    }
}
int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

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

详细

Test #1:

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

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: 1ms
memory: 3736kb

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