需要多少张钱

Problem Description
Given two clustering algorithms, the old and the new, you want to find the difference between their results.
A clustering algorithm takes many member entities as input and partition them into clusters. In this problem, a member entity must be clustered into exactly one cluster. However, we don’t have any pre-knowledge of the clusters, so different algorithms may produce different number of clusters as well as different cluster IDs. One thing we are sure about is that the memberIDs are stable, which means that the same member ID across different algorithms indicates the same member entity.
To compare two clustering algorithms, we care about three kinds of relationship between the old clusters and the new clusters: split, merge and 1:1. Please refer to the figure below.

Let’s explain them with examples. Say in the old result, m0, m1, m2 are clustered into one cluster c0, but in the new result, m0 and m1 are clustered into c0, but m2 alone is clustered into c1. We denote the relationship like the following:
● In the old, c0 = [m0, m1, m2]
● In the new, c0 = [m0, m1], c1 = [m2]
There is no other members in the new c0 and c1. Then we say the old c0 is split into new c0 and new c1. A few more examples:
● In the old, c0 = [m0, m1, m2]
● In the new, c0 = [m0, m1, m2].
This is 1:1.
● In the old, c0 = [m0, m1], c1 = [m2]
● In the new, c0 = [m0, m1, m2]
This is merge. Please note, besides these relationship, there is another kind called “n:n”:
● In the old, c0 = [m0, m1], c1 = [m2, m3]
● In the new, c0 = [m0, m1, m2], c1 = [m3]
We don’t care about n:n.
In this problem, we will give you two sets of clustering results, each describing the old and the new. We want to know the total number of splits, merges, and 1:1 respectively.

翻译:
问题描述
给定两个聚类算法，旧的和新的，您希望找到它们的结果之间的差异。
聚类算法将许多成员实体作为输入并将它们分成簇。 在此问题中，必须将成员实体集群到一个集群中。 但是，我们对集群没有任何预先知识，因此不同的算法可能会产生不同数量的集群以及不同的集群ID。 我们确定的一件事是memberID是稳定的，这意味着不同算法中的相同成员ID表示相同的成员实体。
为了比较两种聚类算法，我们关注旧聚类和新聚类之间的三种关系：拆分，合并和1：1。

让我们用例子来解释它们。 比较旧的结果，m0，m1，m2聚集成一个簇c0，但在新结果中，m0和m1聚集成c0，但m2单独聚集成c1。 我们表示如下关系：
●在旧的，c0 = [m0，m1，m2]
●在新的中，c0 = [m0，m1]，c1 = [m2]
新c0和c1中没有其他成员。 然后我们说旧的c0被分成新的c0和新的c1。 还有一些例子：
●在旧的，c0 = [m0，m1，m2]
●在新的中，c0 = [m0，m1，m2]。
这是1：1。
●在旧的，c0 = [m0，m1]，c1 = [m2]
●在新的中，c0 = [m0，m1，m2]
这是合并。 请注意，除了这些关系，还有另一种叫做“n：n”：
●在旧的，c0 = [m0，m1]，c1 = [m2，m3]
●在新的中，c0 = [m0，m1，m2]，c1 = [m3]
我们不关心n：n。
在这个问题中，我们将给出两组聚类结果，每组都描述旧的和新的。 我们想分别知道拆分，合并和1：1的总数。