该问题描述了一个基于Euler的拼写机器，它按照一系列指令在平面上画图，形成不相交的线段。任务是计算所有线段最终形成的连通区域数量。输入包含多组测试用例，每组用例给出一系列坐标指令，输出是每个测试用例的连通区域数。
Problem Description
Little Joey invented a scrabble machine that he called Euler, after the great mathematician. In his primary school Joey heard about the nice story of how Euler started the study about graphs. The problem in that story was - let me remind you - to draw a graph on a paper without lifting your pen, and finally return to the original position. Euler proved that you could do this if and only if the (planar) graph you created has the following two properties: (1) The graph is connected; and (2) Every vertex in the graph has even degree.
Joey's Euler machine works exactly like this. The device consists of a pencil touching the paper, and a control center issuing a sequence of instructio
订阅专栏 解锁全文
扫一扫
752
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
