QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#706905 | #9462. Safest Buildings | chimu | WA | 1ms | 3608kb | C++17 | 1017b | 2024-11-03 13:54:01 | 2024-11-03 13:54:02 |
Judging History
answer
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
using namespace std;
int z = 1e9 + 7;
int main()
{
cin.tie(0),cout.sync_with_stdio(0);
int t;
cin >> t;
while(t--)
{
int n , R , r , res = 0;
int mi = R * R;
cin >> n >> R >> r;
vector<int> re(n);
for(int i = 0 ; i < n ; i++)
{
int a , b;
cin >> a >> b;
int dis = a * a + b * b;
if(dis < R * R)
{
if(dis < mi)
{
mi = dis;
res = 0;
re[res++] = i + 1;
}
else if(dis == mi)
{
re[res++] = i + 1;
}
}
}
cout << res << endl << re[0];
for(int i = 1 ; i < res ; i++)
{
cout << " " << re[i];
}
cout << endl;
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3484kb
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: -100
Wrong Answer
time: 1ms
memory: 3608kb
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 1 3 1 12 1 1 1 5 1 9 1 11 1 5 0 0 1 5 1 29 1 33 1 21 1 35 1 29 1 14 1 14 1 13 1 10 1 19 1 14 1 9 1 10 1 3 1 14 1 14 1 27 1 28 1 40 1 24 1 10 1 28 1 6 1 12 1 35 1 47 1 7 1 42 1 9 1 3 1 65 1 41 1 37 1 63 1 6 1 8 1 23 1 9 1 1 1 17 1 21 1 33 1 43 1 32 1 20 1 23 1 8 1 31 1 23 1 23 1 40 1 15...
result:
wrong answer 7th words differ - expected: '4', found: '1'