提出 #2926440

---

ソースコード 拡げる

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#define esp 1e-10
#define PI acos(-1)
using namespace std;
struct Point{
    double x,y;
    Point(double _x=0,double _y=0):x(_x),y(_y){}
};
typedef Point Vector;
Vector operator + (Vector A,Vector B){
    return Vector(A.x+B.x,A.y+B.y);
}
Vector operator - (Vector A,Vector B){
    return Vector(A.x-B.x,A.y-B.y);
}
Vector operator * (Vector A,double d){
    return Vector(A.x*d,A.y*d);
}
Vector operator / (Vector A,double d){
    return Vector(A.x/d,A.y/d);
}
bool operator < (const Point &A,const Point &B){
    return A.x<B.x||(A.x==B.x&&A.y<B.y);
}
int dcmp(double x){
    if(fabs(x)<esp)return 0;
    return x<0?-1:1;
}
bool operator == (const Point &A,const Point &B){
    return dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)==0;
}
double Dot(Vector A,Vector B){        //点乘
    return (A.x*B.x+A.y*B.y);
}
double Length(Vector A){              //向量的长度
    return sqrt(Dot(A,A));
}
double angle(Vector v){               //向量的极角：从x轴正方向转到该向量的弧度，逆时针-正，顺时针-负
    return atan2(v.y,v.x);
}
double Cross(Vector A,Vector B){      //叉乘
    return (A.x*B.y-A.y*B.x);
}
Vector Rotate(Vector A,double rad){   //向量逆时针旋转rad弧度
    return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));
}

const int maxn=105;
int N;
double H,W,R;
Point P[maxn];
bool Check(Point P1,Point P2,double limit,double rad){
    Point C=P1+Vector(1,0);
    P2=P1+Rotate(P2-P1,-rad);
    double _max=max(P1.x,P2.x),_min=min(P1.x,P2.x);
    for(int i=0;i<N;i++){
        Point p=P1+Rotate(P[i]-P1,-rad);
        if(p==P1||p==P2)continue;
        if(Cross(C-P1,p-P1)<0)return 0;
        if(Cross(p-P2,C-P1)<0)return 0;
        _min=min(_min,p.x);
        _max=max(_max,p.x);
    }
    return _max-_min<=limit;
}
bool solve(){
    double d,_maxd=0,_maxlimit=sqrt(W*W+H*H);
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++)if(i!=j){
            _maxd=max(d=Length(P[i]-P[j]),_maxd);
            if(_maxd>_maxlimit)return 0;
            double rad=angle(P[j]-P[i]);
            if(H<=d&&Check(P[i],P[j],W,rad-asin(H/d)))return 1;
            if(W<=d&&Check(P[i],P[j],H,rad-asin(W/d)))return 1;
        }
    }
    return _maxd<=min(H,W);
}
int main(){
    while(~scanf("%d%lf%lf%lf",&N,&H,&W,&R)){
        H-=2*R;W-=2*R;
        for(int i=0;i<N;i++)scanf("%lf%lf",&P[i].x,&P[i].y);
        printf((H>0&&W>0)&&(N==1||solve())?"Yes\n":"No\n");
    }
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:88:60: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         for(int i=0;i<N;i++)scanf("%lf%lf",&P[i].x,&P[i].y);
                                                            ^

ジャッジ結果