-
Notifications
You must be signed in to change notification settings - Fork 34
/
Copy pathA.java
66 lines (61 loc) · 1.99 KB
/
A.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
import java.io.PrintStream;
import java.util.*;
import java.util.stream.Collectors;
/**
* Codejam 2012 Round 1C
* Problem A. Diamond Inheritance
*/
public class Main {
private String solve(Scanner scanner) {
int n=scanner.nextInt();
ArrayList<Integer>[] lists=new ArrayList[n];
for (int i=0;i<n;i++) lists[i]=new ArrayList<>();
boolean[][] able=new boolean[n][n];
for (int i=0;i<n;i++) {
able[i][i]=true;
int k=scanner.nextInt();
while (k-->0) {
int x=scanner.nextInt()-1;
lists[i].add(x);
able[i][x]=true;
}
}
for (int k=0;k<n;k++) {
for (int i=0;i<n;i++) {
for (int j=0;j<n;j++) {
if (able[i][k] && able[k][j])
able[i][j]=true;
}
}
}
for (int i=0;i<n;i++) {
ArrayList<Integer> list=lists[i];
for (int u=0;u<list.size();u++) {
for (int v=u+1;v<list.size();v++) {
for (int w=0;w<n;w++) {
if (able[list.get(u)][w] && able[list.get(v)][w])
return "Yes";
}
}
}
}
return "No";
}
public static void main(String[] args) throws Exception {
System.setOut(new PrintStream("output.txt"));
Scanner scanner=new Scanner(System.in);
int times=scanner.nextInt();
long start=System.currentTimeMillis();
for (int t=1;t<=times;t++) {
try {
System.out.println(String.format("Case #%d: %s", t, new Main().solve(scanner)));
}
catch (Throwable e) {
System.err.println("ERROR in case #"+t);
e.printStackTrace();
}
}
long end=System.currentTimeMillis();
System.err.println(String.format("Time used: %.3fs", (end-start)/1000.0));
}
}