結果
問題 | No.94 圏外です。(EASY) |
ユーザー |
![]() |
提出日時 | 2014-12-07 19:24:57 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 6 ms / 5,000 ms |
コード長 | 5,371 bytes |
コンパイル時間 | 1,746 ms |
コンパイル使用メモリ | 163,340 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-26 07:18:16 |
合計ジャッジ時間 | 2,479 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 22 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:94:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 94 | rep(i,N) scanf("%lf%lf",&P[i].x,&P[i].y); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include<bits/stdc++.h>using namespace std;#define REP(i,a,b) for(i=a;i<b;i++)#define rep(i,n) REP(i,0,n)#define mygc(c) (c)=getchar_unlocked()#define mypc(c) putchar_unlocked(c)#define ll long long#define ull unsigned llvoid reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}template<class T> void writerLn(T x){writer(x,'\n');}template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}void unionInit(int d[],int s){int i;rep(i,s)d[i]=i;}int unionGet(int d[],int n){int t=n,k;while(d[t]!=t)t=d[t];while(d[n]!=n)k=d[n],d[n]=t,n=k;return n;}int unionConnect(int d[],int a,int b){a=unionGet(d,a);b=unionGet(d,b);if(a==b)return 0;d[a]=b;return 1;}#define EPS 1e-10#define PI 3.141592653589793238462#define MAX(a,b) (((a)>(b))?(a):(b))#define MIN(a,b) (((a)<(b))?(a):(b))typedef struct struct_point{double x,y;}pnt;typedef struct struct_line{pnt a,b;}line;typedef struct struct_circle{pnt c; double r;}circle;int doubleSign(double a){if(a>EPS) return 1; if(a<-EPS) return -1; return 0;}int doubleSignR(double a,double b){ if(doubleSign(b)!=0 && doubleSign(a/b-1)==0) return 0; return doubleSign(a-b);}int pntSign(pnt a){int i=doubleSign(a.x); if(i) return i; return doubleSign(a.y);}pnt pntPlus(pnt a,pnt b){a.x+=b.x; a.y+=b.y; return a;}pnt pntMinus(pnt a,pnt b){a.x-=b.x; a.y-=b.y; return a;}pnt pntMultiple(pnt a,pnt b){pnt c; c.x=a.x*b.x-a.y*b.y; c.y=a.x*b.y+a.y*b.x; return c;}pnt pntMultipleDouble(pnt a,double k){a.x*=k; a.y*=k; return a;}int pntIsEqual(pnt a,pnt b){return pntSign(pntMinus(a,b))==0;}double pntLength(pnt a){return sqrt(a.x*a.x+a.y*a.y);}double pntLength2(pnt a){return a.x*a.x+a.y*a.y;}double pntDistance(pnt a,pnt b){return pntLength(pntMinus(a,b));}double pntDistance2(pnt a,pnt b){return pntLength2(pntMinus(a,b));}double pntArgument(pnt a){return atan2(a.y,a.x);}pnt pntNormalize(pnt a){double n=pntLength(a); a.x/=n; a.y/=n; return a;}double pntInnerProduct(pnt a,pnt b){return a.x*b.x+a.y*b.y;}double pntOuterProduct(pnt a,pnt b){return a.x*b.y-a.y*b.x;}pnt pntGenerator(double x,double y){pnt res; res.x=x; res.y=y; return res;}line pntToLine(pnt a,pnt b){line res; res.a=a; res.b=b; return res;}circle pntToCircle(pnt c,double r){circle res; res.c=c; res.r=r; return res;}int isPntInCircle(pnt p,circle c){return doubleSign(c.r-pntDistance(p,c.c))+1;}int isPntOnCircle(pnt p,circle c){if(doubleSign(pntDistance(p,c.c)-c.r)==0) return 1; return 0;}/* aがbの厳密に内部なら2 */int isCircleInCircle(circle a,circle b){return doubleSign(b.r-a.r-pntDistance(a.c,b.c))+1;}pnt pntPolar(double r,double t){pnt a; a.x=r*cos(t); a.y=r*sin(t); return a;}void pntSort(pnt d[],int s){int i,j;pnt k,t;if(s<=1)return;k=pntMultipleDouble(pntPlus(d[0],d[s-1]),1/2.0);i=-1;j=s;for(;;){while(pntSign(pntMinus(d[++i],k))==-1);while(pntSign(pntMinus(d[--j],k))==1);if(i>=j)break;t=d[i];d[i]=d[j];d[j]=t;}pntSort(d,i);pntSort(d+j+1,s-j-1);}/* 点oのまわりに点aをtだけ回転した点を返す */pnt pntRatation(pnt a,pnt o,double t){return pntPlus(pntMultiple(pntMinus(a,o),pntPolar(1.0,t)),o);}pnt pntRatationEasy(pnt a,double t){return pntMultiple(a,pntPolar(1.0,t));}int N;pnt P[200000];int ind[200000];int main(){int i, j, k;double res, tmp;reader(&N);rep(i,N) scanf("%lf%lf",&P[i].x,&P[i].y);rep(i,N) pntRatationEasy(P[i], 1);pntSort(P, N);unionInit(ind, N);rep(i,N) REP(j,i+1,N){if(pntDistance2(P[i],P[j]) <= 100+EPS) unionConnect(ind, i, j);}res = 0;rep(i,N) REP(j,i+1,N){if(unionGet(ind,i) != unionGet(ind,j)) continue;tmp = pntDistance(P[i],P[j]);res = max(res, tmp);}res += 2;if(N==0) res = 1;printf("%.10f\n",res);return 0;}