UVA 152-Tree's a Crowd(暴力求解三维坐标求最短距离)
来源:互联网 发布:淘宝樊小林捕鼠 编辑:程序博客网 时间:2024/06/04 19:09
Description
Tree's a Crowd
Dr William Larch, noted plant psychologist and inventor of the phrase ``Think like a tree--Think Fig'' has invented a new classification system for trees. This is a complicated system involving a series of measurements which are then combined to produce three numbers (in the range [0, 255]) for any given tree. Thus each tree can be thought of as occupying a point in a 3-dimensional space. Because of the nature of the process, measurements for a large sample of trees are likely to be spread fairly uniformly throughout the whole of the available space. However Dr Larch is convinced that there are relationships to be found between close neighbours in this space. To test this hypothesis, he needs a histogram of the numbers of trees that have closest neighbours that lie within certain distance ranges.
Write a program that will read in the parameters of up to 5000 trees and determine how many of them have closest neighbours that are less than 1 unit away, how many with closest neighbours 1 or more but less than 2 units away, and so on up to those with closest neighbours 9 or more but less than 10 units away. Thus if is the distance between the i'th point and its nearest neighbour(s) and , with j and k integers and k = j+1, then this point (tree) will contribute 1 to the j'th bin in the histogram (counting from zero). For example, if there were only two points 1.414 units apart, then the histogram would be 0, 2, 0, 0, 0, 0, 0, 0, 0, 0.
Input and Output
Input will consist of a series of lines, each line consisting of 3 numbers in the range [0, 255]. The file will be terminated by a line consisting of three zeroes.
Output will consist of a single line containing the 10 numbers representing the desired counts, each number right justified in a field of width 4.
Sample input
10 10 010 10 010 10 110 10 310 10 610 10 1010 10 1510 10 2110 10 2810 10 3610 10 450 0 0
Sample output
2 1 1 1 1 1 1 1 1 1
题意:给出多组树的三维坐标,让你求一棵树到其他树之间的最短距离,然后统计所有的树的最短距离在分别在0-9之间的个数
#include <stdio.h>#include <math.h>#include <string.h>#include <stdlib.h>#include <algorithm>using namespace std;const int inf=0x3f3f3f;struct node{ double x,y,z;}q[100010];int main(){ int i,j; int cnt=0; int minx,dis; double x,y,z; int sum[10]; while(~scanf("%lf %lf %lf",&x,&y,&z)) { if(x==0&&y==0&&z==0) break; else { q[cnt].x=x; q[cnt].y=y; q[cnt].z=z; cnt++; } } memset(sum,0,sizeof(sum)); for(i=0;i<cnt;i++) { minx=inf; for(j=0;j<cnt;j++) { if(i!=j) { dis=sqrt((q[j].x-q[i].x)*(q[j].x-q[i].x)+(q[j].y-q[i].y)*(q[j].y-q[i].y)+(q[j].z-q[i].z)*(q[j].z-q[i].z)); minx=min(minx,dis); } } if(minx<10) sum[minx]++; } for(i=0;i<10;i++) printf("%4d",sum[i]); printf("\n"); return 0;}
- UVA 152-Tree's a Crowd(暴力求解三维坐标求最短距离)
- UVa 152 Tree's a Crowd (暴力)
- UVA Tree's a Crowd(三维空间的点求最短距离)
- UVa OJ 152-Tree's a Crowd
- uva 152 Tree's a Crowd
- UVA 152 - Tree's a Crowd
- UVa 152 - Tree's a Crowd
- uva 152 - Tree's a Crowd
- UVA-152- Tree's a Crowd
- UVA 152 - Tree's a Crowd
- UVa 152 - Tree's a Crowd
- uva 152 Tree's a Crowd
- UVa 152 - Tree's a Crowd
- UVA 152 Tree's a Crowd
- UVa - 152 - Tree's a Crowd
- uva 152 - Tree's a Crowd
- uva 152 Tree's a Crowd
- uva - 152 - Tree's a Crowd
- 自己动手实现批量重命名命令
- HDOJ 2124 Repair the Wall
- 【BZOJ】【P2295】【POJ Challenge】【我爱你啊】【题解】【水题】
- 2014-2015 HHUC 跨年二分专题 解题报告
- 秀色书文软件 发布
- UVA 152-Tree's a Crowd(暴力求解三维坐标求最短距离)
- jvm的happens-before原则
- Leetcode -- Merge k Sorted Lists
- 游戏中时间管理器
- C++标准库---transform()
- android AR项目总结
- Android判断当前Service是否是重启的Servcie
- 重构.改善既有代码的设计
- day05_java数组的操作