Submission #300162

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
300162	2020-09-16 22:01:19	model_code	Connecting Supertrees (IOI20_supertrees)	Java	96 / 100	549 ms	61620 KiB

supertrees

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
// yanhao-st5
import java.util.ArrayList;
import java.util.Arrays;
class supertrees {
  int n;
  int construct(int[][] p) {
    n = p.length;
    ArrayList<ArrayList<Integer>> components1 = new ArrayList<>();
    ArrayList<ArrayList<Integer>> components2 = new ArrayList<>();
    for(int i=0; i<n; i++) components1.add(new ArrayList<>());
    for(int i=0; i<n; i++) components2.add(new ArrayList<>());
    int[] parent1 = new int[n];
    int[] parent2 = new int[n];
    for(int i=0; i<n; i++) {
      parent1[i] = i;
      parent2[i] = i;
    }
    
    for(int i=0; i<n; i++) {
      for(int j=0; j<n; j++) {
        if(p[i][j]==1) {
          parent1[i] = j;
          components1.get(j).add(i);
          break;
        }
      }
    }
    for(int i=0; i<n; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 19 / 19
• Subtask 4: 35 / 35
• Subtask 5: 21 / 21
• Subtask 6: 0 / 4