|
|
package class_2022_03_3_week;
|
|
|
|
|
|
import java.util.HashMap;
|
|
|
|
|
|
// 来自银联编程比赛
|
|
|
// 为了不断提高用户使用的体验，开发团队正在对产品进行全方位的开发和优化。
|
|
|
// 已知开发团队共有若干名成员，skills[i] 表示第 i 名开发人员掌握技能列表。
|
|
|
// 如果两名成员各自拥有至少一门对方未拥有的技能，则这两名成员可以「合作开发」。
|
|
|
// 请返回当前有多少对开发成员满足「合作开发」的条件。
|
|
|
// 由于答案可能很大，请你返回答案对 10^9 + 7 取余的结果。
|
|
|
// 测试链接 : https://leetcode-cn.com/contest/cnunionpay-2022spring/problems/lCh58I/
|
|
|
public class Code07_CoopDevelop {
|
|
|
|
|
|
public static long mod = 1000000007L;
|
|
|
|
|
|
public static int coopDevelop(int[][] skills) {
|
|
|
int n = skills.length;
|
|
|
// key : 子集
|
|
|
// value : 个数
|
|
|
HashMap<Long, Long> noFullSetsNums = new HashMap<>();
|
|
|
for (int[] people : skills) {
|
|
|
fillNoFullMap(people, 0, 0, true, noFullSetsNums);
|
|
|
}
|
|
|
HashMap<Long, Long> cntsNums = new HashMap<>();
|
|
|
long minus = 0L;
|
|
|
for (int[] people : skills) {
|
|
|
long status = 0L;
|
|
|
for (int skill : people) {
|
|
|
status = (status << 10) | skill;
|
|
|
}
|
|
|
minus += noFullSetsNums.getOrDefault(status, 0L);
|
|
|
minus += cntsNums.getOrDefault(status, 0L);
|
|
|
cntsNums.put(status, cntsNums.getOrDefault(status, 0L) + 1);
|
|
|
}
|
|
|
long ans = (long) n * (long) (n - 1) / 2L;
|
|
|
return (int) ((ans - minus) % mod);
|
|
|
}
|
|
|
|
|
|
public static void fillNoFullMap(int[] people, int i, long status, boolean full,
|
|
|
HashMap<Long, Long> noFullSetsNums) {
|
|
|
if (i == people.length) {
|
|
|
if (!full) {
|
|
|
noFullSetsNums.put(status, noFullSetsNums.getOrDefault(status, 0L) + 1);
|
|
|
}
|
|
|
} else {
|
|
|
fillNoFullMap(people, i + 1, status, false, noFullSetsNums);
|
|
|
fillNoFullMap(people, i + 1, (status << 10) | people[i], full, noFullSetsNums);
|
|
|
}
|
|
|
}
|
|
|
|
|
|
}
|
