P8505 - Laser Alarm

内存限制：128 MB 时间限制：3 S 标准输入输出

题目类型：传统评测方式：文本比较上传者：

提交：1 通过：1

The museum in Byteland has plenty of jewels on display, secured by

laser alarms. Each laser alarm can be considered as a segment in the 3D space. In this task, your job is to test the quality of the laser alarm system. You need to find a plane such that it touches the most laser alarms. Note that if the plane touches the endpoint of a segment, it should also be counted.

The first line contains a single integer ( $1 \leq T \leq 10$ ), the number of test cases. For each test case:

The first line contains a single integer ( $1 \leq n \leq 50$ ), denoting the number of laser alarms.

Each of the following lines contains six integers $x_{i}$ , $y_{i}$ , $z_{i}$ , $_{'}$ , $_{'}$ and $_{'}$ ( $1 \leq x_{i}, y_{i}, z_{i}, x_{i'}, y_{i'}, z_{i'} \leq 100$ ), describing a segment that connects $(x_i,y_i,z_i)$ and $(x_i',y_i',z_i')$ . It is guaranteed that the two endpoints of each segment do not coincide.

For each test case, output a single line containing an integer, denoting the maximum possible number of laser alarms that can be touched.

1
4
1 1 1 1 1 2
1 1 10 1 1 11
1 10 1 1 10 2
10 1 1 10 1 2

2022 杭电多校第三场

8505: Laser Alarm

题目描述

输入格式

输出格式

输入样例复制

输出样例复制

分类标签