Uvalive 4954 Lawn mower

来源:互联网 发布:淘宝买的ios付费游戏 编辑:程序博客网 时间:2024/06/06 20:25
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;int N,M;double W,x[1010],y[1010];bool f1,f2;int main(){while(scanf("%d%d%lf",&N,&M,&W)!=EOF){if(N==0&&M==0&&W==0){break;}//cout<<"test: "<<N<<" "<<M<<" "<<W<<"\n";f1=f2=true;for(int i=1;i<=N;i++){scanf("%lf",&x[i]);}x[0]=-W/2;x[N+1]=75+W/2;//cout<<"test: "<<x[0]<<" "<<x[N+1]<<"\n";sort(x,x+N+2);////for(int i=0;i<N+2;i++) cout<<x[i]<<" ";//cout<<"\n";//for(int i=0;i<N+1;i++){if(x[i+1]-x[i]>W){f1=false;break;}}for(int i=1;i<=M;i++){scanf("%lf",&y[i]);}y[0]=-W/2;y[M+1]=100+W/2;//cout<<"test: "<<y[0]<<" "<<y[M+1]<<"\n";sort(y,y+M+2);////for(int i=0;i<M+2;i++) cout<<y[i]<<" ";//cout<<"\n";//for(int i=0;i<M+1;i++){if(y[i+1]-y[i]>W){f2=false;break;}}if(f1&&f2){printf("YES\n");}else printf("NO\n");}}

0 0
原创粉丝点击