QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#686586 | #9462. Safest Buildings | ir101# | WA | 1ms | 3588kb | C++20 | 1.0kb | 2024-10-29 14:32:03 | 2024-10-29 14:32:04 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define PII pair<int,int>
#define endl '\n'
#define int long long
#define lc p<<1
#define rc p<<1|1
using namespace std;
const int N = 2e5 + 10;
int cnt = 0;
string s;
int a[N],b[N];
int f1[N],f2[N];
vector<PII>q;
vector<int>ans;
void solve() {
int n,R,r;
cin>>n>>R>>r;
q.clear();
ans.clear();
for(int i=1;i<=n;i++){
int x,y;
cin>>x>>y;
q.push_back({x*x+y*y,i});
}
sort(q.begin(),q.end());
if(R>=2*r&&q.front().first<=(R-2*r)*(R-2*r)){
for(int i=0;i<n;i++){
if(q[i].first<=(R-2*r)*(R-2*r)){
ans.push_back(q[i].second);
}else{
break;
}
}
}else{
int p=q.front().first;
for(int i=0;i<n;i++){
if(q[i].first==p){
ans.push_back(q[i].second);
}else{
break;
}
}
}
cout<<ans.size()<<endl;
for(int i=0;i<ans.size();i++){
cout<<ans[i]<<" \n"[i==ans.size()-1];
}
}
signed main() {
ios::sync_with_stdio(false),cin.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 3588kb
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 6 4 5 7 12 4 13 9 1 6 8 1 1 1 5 1 9 1 11 1 5 1 29 1 5 1 29 47 33 25 48 45 7 18 43 19 2 27 32 17 38 54 3 14 12 56 22 41 28 36 34 44 6 47 21 55 37 9 11 26 52 24 46 4 10 1 51 40 39 30 31 53 5 35 50 2 21 29 20 35 26 45 7 10 33 5 48 6 43 41 13 30 37 18 38 21 1 25 14 1 29 1 14 1 14 1 13 ...
result:
wrong answer 9th words differ - expected: '4', found: '6'