本文介绍了N-交点的概念，即在N维空间中坐标均为非负整数的位置。两个N-交点若在单一维度上坐标相差1，则认为它们相邻。N-有趣空间是由相邻N-交点组成的路径集合。N-可信迷宫则是在N-有趣空间中，指定起点和终点的路径。输入文件包含多个N-可信迷宫的描述，包括维度n、起始和结束点坐标，以及相邻交点的路径。输出应标明每个迷宫是否可以从起点到达终点。
Problem Description
An n-tersection is defined as a location in n-dimensional space, n being a positive integer, having all non-negative integer coordinates. For example, the location (1,2,3) represents an n-tersection in three dimensional space. Two n-tersections are said to be adjacent if they have the same number of dimensions and their coordinates differ by exactly 1 in a single dimension only. For example, (1,2,3) is adjacent to (0,2,3) and (2,2,3) and (1,2,4), but not to (2,3,3) or (3,2,3) or (1,2). An n-teresting space is defined as a collection of paths between adjacent n-tersections.
Finally, an n-credible maze is defined as an n-teresting space combined with two specific n-tersections in that space, one o
订阅专栏 解锁全文
扫一扫
1310
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
