该问题要求处理一组几何形状，判断它们是否相交。输入包含多幅图片，每幅图片描述了最多26个形状，包括正方形、矩形、线段、三角形和多边形等。形状不能相交，若相交则需要输出相交的形状标识。输出按形状标识字母顺序，列出每个形状的相交情况。
| Time Limit: 2000MS | Memory Limit: 65536K | |
| Total Submissions: 1056 | Accepted: 442 |
Description
While creating a customer logo, ACM uses graphical utilities to draw a picture that can later be cut into special fluorescent materials. To ensure proper processing, the shapes in the picture cannot intersect. However, some logos contain such intersecting shapes. It is necessary to detect them and decide how to change the picture.
Given a set of geometric shapes, you are to determine all of their intersections. Only outlines are considered, if a shape is completely inside another one, it is not counted as an intersection.
Input
Input contains several pictures. Each picture describes at most 26 shapes, each specified on a separate line. The line begins with an uppercase letter that uniquely identifies the shape inside the corresponding picture. Then there is a kind of the shape and two or more points, everything separated by at least one space. Possible shape kinds are:
• square: Followed by two distinct points giving the opposite cor
最低0.47元/天 解锁文章
扫一扫
225
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
