QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#187286 | #3854. Radar | Nax_hueux# | WA | 0ms | 2388kb | C++14 | 2.8kb | 2023-09-24 16:05:53 | 2023-09-24 16:05:55 |
Judging History
answer
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cctype>
#define y0 _y0
#define y1 _y1
using namespace std;
inline int read(){
int x=0,f=0; char c=getchar();
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=x*10+(c^'0'),c=getchar();
return f?-x:x;
}
const int maxn=100010;
int cir[maxn];
struct Point{
double x,y;
bool operator<(const Point &p)const{
return atan2(y,x)<atan2(p.y,p.x);
}
};
typedef Point Line;
Line line[maxn];
int R,F,N;
int get1_cir(int x,int y){
int l=1,r=R;
while(l<r){
int mid=l+r+1>>1;
if(1ll*cir[mid]*cir[mid]>=1ll*x*x+1ll*y*y) r=mid-1;
else l=mid;
}
return cir[l];
}
int get2_cir(int x,int y){
int l=1,r=R;
while(l<r){
int mid=l+r+1>>1;
if(1ll*cir[mid]*cir[mid]>=1ll*x*x+1ll*y*y) r=mid-1;
else l=mid;
}
if(l<R) return cir[l+1];
return cir[l];
}
Line get1_line(int x,int y){
Line res=(Line){x,y};
int l=1,r=F;
while(l<r){
int mid=l+r+1>>1;
if(res<line[mid]) r=mid-1;
else l=mid;
}
if(l==1&&res<line[l]) return line[F];
return line[l];
}
Line get2_line(int x,int y){
Line res=(Line){x,y};
int l=1,r=F;
while(l<r){
int mid=l+r+1>>1;
if(res<line[mid]) r=mid-1;
else l=mid;
}
if(l<F) return line[l+1];
if(line[F]<res) return line[1];
return line[l];
}
Point getp(int r,Line l){
// printf("getp %d (%.1lf, %.1lf)\n",r,l.x,l.y);
double x=l.x,y=l.y;
if(fabs(x)<1e-8){
if(y>0) return (Point){0,r};
else return (Point){0,-r};
}
if(x>0){
double xx=r*cos(atan(y/x)),yy=r*sin(atan(y/x));
// printf("= (%.2lf, %.2lf)\n",xx,yy);
return (Point){xx,yy};
} else{
double xx=-r*cos(atan(y/x)),yy=-r*sin(atan(y/x));
// printf("= (%.2lf, %.2lf)\n",xx,yy);
return (Point){xx,yy};
}
}
inline double getdis(Point p,Point q){
return sqrt((p.x-q.x)*(p.x-q.x)+(p.y-q.y)*(p.y-q.y));
}
int main(){
R=read(),F=read(),N=read();
for(int i=1;i<=R;i++) cir[i]=read();
sort(cir+1,cir+R+1);
for(int i=1;i<=F;i++) line[i].x=read(),line[i].y=read();
sort(line+1,line+F+1);
while(N--){
int x=read(),y=read();
int r1=get1_cir(x,y),r2=get2_cir(x,y);
// printf("r1 = %d, r2 = %d\n",r1,r2);
Line l1=get1_line(x,y),l2=get2_line(x,y);
// printf("l1 = (%.1lf, %.1lf), l2 = (%.1lf, %.1lf)",l1.x,l1.y,l2.x,l2.y);
Point p1=getp(r1,l1),p2=getp(r2,l1),p3=getp(cir[1],l1),p4=getp(r1,l2),p5=getp(r2,l2),p6=getp(cir[1],l2);
Point q=(Point){x,y};
double dis1=getdis(p1,q),
dis2=getdis(p2,q),
dis3=getdis(p3,q),
dis4=getdis(p4,q),
dis5=getdis(p5,q),
dis6=getdis(p6,q);
printf("%.12lf\n",min(min(min(min(min(dis1,dis2),dis3),dis4),dis5),dis6));
}
return 0;
}
/*
3 7 5
2
4
7
8 4
2 8
-1 5
-7 2
-4 -4
1 -8
6 -3
3 -1
8 1
2 6
-5 2
-1 -1
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 2388kb
input:
3 8 4 2 4 7 1 0 2 1 0 1 -1 1 -5 -2 -5 -6 -2 -7 6 -1 -1 -1 3 1 -5 -3 8 1
output:
0.605291072917 0.977772290466 1.551845105402 1.414213562373
result:
ok 4 numbers
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 2216kb
input:
1 8 32 7 0 1 1 0 0 -1 -1 0 1 -1 -1 1 -1 -1 1 1 20 10 10 20 -20 10 10 -20 -10 20 20 -10 -10 -20 -20 -10 2 1 1 2 -2 1 1 -2 -1 2 2 -1 -1 -2 -2 -1 5 0 0 5 -5 0 0 -5 5 5 5 -5 -5 5 -5 -5 9 0 0 9 -9 0 0 -9 9 9 9 -9 -9 9 -9 -9
output:
15.874985099258 15.874985099258 15.874985099258 15.874985099258 15.874985099258 15.874985099258 15.874985099258 16.401219466857 4.929656701046 4.929656701046 4.929656701046 4.929656701046 4.929656701046 4.929656701046 4.929656701046 5.099019513593 2.000000000000 2.000000000000 2.000000000000 2.00000...
result:
wrong answer 8th numbers differ - expected: '15.8749851', found: '16.4012195', error = '0.0331487'