首页 > ACM题库 > HDU-杭电 > hdu 2663 Tetrahedroid待解决[解题报告]C++
2014
02-12

hdu 2663 Tetrahedroid待解决[解题报告]C++

Tetrahedroid

问题描述 :

You are given a tetrahedroid and a point P outside it. How many faces can be seen from P?
A face can be seen form P means that if you connect P and any point in this face (exclude the boundary) with a line segment, the line segment does not intersect with other faces of the tetrahedroid.

输入:

The input contains multiple test cases.
The first line contains a number T describing the number of test cases.
For each test case:
The first 4 lines describe the tetrahedroid in the format below:
Ax, Ay, Az
Bx, By, Bz
Cx, Cy, Cz
Dx, Dy, Dz
After that comes 1 line describing the point P in the format below:
Px, Py, Pz

输出:

The input contains multiple test cases.
The first line contains a number T describing the number of test cases.
For each test case:
The first 4 lines describe the tetrahedroid in the format below:
Ax, Ay, Az
Bx, By, Bz
Cx, Cy, Cz
Dx, Dy, Dz
After that comes 1 line describing the point P in the format below:
Px, Py, Pz

样例输入:

2 
0 0 0 
0 0 1 
0 1 0 
1 0 0 
-1 -1 -1 
0 0 0 
0 0 1 
0 1 0 
1 0 0 
1 1 1 

样例输出:

3 
1 


  1. 第23行:
    hash = -1是否应该改成hash[s ] = -1

    因为是要把从字符串s的start位到当前位在hash中重置

    修改提交后能accept,但是不修改居然也能accept

  2. Often We don’t set up on weblogs, but I would like to condition that this established up really forced me individually to do this! considerably outstanding publish

  3. 有两个重复的话结果是正确的,但解法不够严谨,后面重复的覆盖掉前面的,由于题目数据限制也比较严,所以能提交通过。已更新算法