oj.uz

답안 #301430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
301430 2020-09-17T23:40:34 Z KWang31 슈퍼트리 잇기 (IOI20_supertrees) Java 11
40 / 100
 527 ms 58432 KB 
import java.io.*; import java.util.*;
public class supertrees {

    static class Pair implements Comparable<Pair>{
        int v; int l0;
        public Pair(int a, int b){
            this.v=a; this.l0=b;
        }
        public int compareTo(Pair other){//Sort by l0 values
            if(this.l0>other.l0)return 1;
            if(this.l0<other.l0)return -1;
            if(this.v<other.v)return -1;
            if(this.v>other.v)return 1;
            return 0;
        }
    }
    /*
    public static void main(String[] args) throws IOException {
        // Tester code
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int N=Integer.parseInt(br.readLine());
        int[][] p=new int[N][N];
        for (int i = 0; i < N; i++) {
            StringTokenizer st=new StringTokenizer(br.readLine());
            for (int j = 0; j < N; j++) {
                p[i][j]=Integer.parseInt(st.nextToken());
            }
        }
        System.out.println(construct(p));
    }
*/
public static int construct(int[][] p){
        int N=p.length;
        
        int[][] b=new int[N][N];
        int[] rank1=new int[N];//Consider the graph of 1-edges
        int[] rank0=new int[N];//Graph of 1,2-edges
        
        int[] par1=new int[N];
        int[] par0=new int[N];
        
        for (int i =0; i < N; i++) {
            par1[i]=i; par0[i]=i; 
        }
        int ii,jj;
        for (int i = 0; i < N; i++) {
            for (int j =0; j < N; j++) {
                if(i==j)continue;
                if(p[i][j]==1){
                    ii=find(i,par1); jj=find(j,par1);
                    if(ii!=jj){
                        if(rank1[ii]<rank1[jj]){
                            par1[ii]=jj;
                        }else if(rank1[ii]==rank1[jj]){
                            par1[ii]=jj; rank1[jj]++;
                        }else{
                            par1[jj]=ii;
                        }
                    }
                    ii=find(i,par0); jj=find(j,par0);
                    if(ii!=jj){
                        if(rank0[ii]<rank0[jj]){
                            par0[ii]=jj; 
                        }else if(rank0[ii]==rank0[jj]){
                            par0[ii]=jj; rank0[jj]++;
                        }else{
                            par0[jj]=ii;
                        }
                    }
                }else if(p[i][j]==2){
                    ii=find(i,par1); jj=find(j,par1);
                    if(ii==jj){//Deals with case i)
                        return 0;
                    }
                    
                    ii=find(i,par0); jj=find(j,par0);
                    if(ii!=jj){
                        if(rank0[ii]<rank0[jj]){
                            par0[ii]=jj;
                        }else if(rank0[ii]==rank0[jj]){
                            par0[ii]=jj; rank0[jj]++;
                        }else{
                            par0[jj]=ii;
                        }
                    }
                }else if(p[i][j]==3){
                    return 0;
                }else{
                    ii=find(i,par0); jj=find(j,par0);
                    if(ii==jj)return 0;
                }
            }
        }
        //Now for every 1-2 component, we need to find number of 1-leaders
        //That is the length of cycle. I lose if its length is 2 (length 1 is just a tree)
        boolean[] done=new boolean[N];
        int[] ans=new int[N];
        
        for (int i = 0; i < N; i++) {
            ii=find(i,par1);
            if(!done[ii]){
                jj=find(ii,par0);
                
               ans[jj]++;
                
                done[ii]=true;
            }
        }
         //System.out.println(Arrays.toString(ans));
        for (int i = 0; i < N; i++) {
            if(ans[i]==2){
                return 0;
            }
        }
        
        
        TreeSet<Pair> leads=new TreeSet<>();//Include leaders of all 1-components
         int[] cnt=new int[N];
        for (int i = 0; i < N; i++) {//1-graphs
            
            ii=find(i,par1);
            if(ii!=i){
                b[i][ii]=1; b[ii][i]=1;
                
                //Same component guys don't matter
            }
            //I want to insert every root of each par1 component exactly once
            if(cnt[find(ii,par0)]<ans[find(ii,par0)]-1 && ii!=find(ii,par0)){
                leads.add(new Pair(ii,find(ii,par0)));
            }
            
        }
        
        int prevl=-1;int prevv=0; 
        //Completes the cycle
        int save=0;
        for (Pair q: leads) {
            //System.out.println(q.v+" "+q.l0+" "+prevv);
            if(prevl!=q.l0){
                if(prevl!=-1){
                    //System.out.println(prevv);
                    b[prevv][prevl]=1;b[prevl][prevv]=1;
                } 
                b[q.v][q.l0]=1; b[q.l0][q.v]=1;
                prevl=q.l0; 
                
            }else{
                b[q.v][prevv]=1; b[prevv][q.v]=1;
                
            }
            prevv=q.v; save=q.l0;
        }
        if(prevv!=save){b[prevv][save]=1; b[save][prevv]=1;}
        //Last fill
        //The leaders of every component forms a cycle as long as they're connected in the >=1 graph
        grader.build(b);
        /*
        for (int i = 0; i < N; i++) {
            System.out.println(Arrays.toString(b[i]));
        }
        */
        return 1;
    }
    
    public static int find(int x, int[] par){
        if(par[x]==x)return x;
        int ans=find(par[x],par);
        par[x]=ans; return ans;
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 10488 KB Output is correct
2 Correct 81 ms 10344 KB Output is correct
3 Correct 81 ms 10268 KB Output is correct
4 Correct 78 ms 10344 KB Output is correct
5 Correct 79 ms 10360 KB Output is correct
6 Correct 174 ms 16116 KB Output is correct
7 Correct 452 ms 57184 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 10488 KB Output is correct
2 Correct 81 ms 10344 KB Output is correct
3 Correct 81 ms 10268 KB Output is correct
4 Correct 78 ms 10344 KB Output is correct
5 Correct 79 ms 10360 KB Output is correct
6 Correct 174 ms 16116 KB Output is correct
7 Correct 452 ms 57184 KB Output is correct
8 Correct 81 ms 10488 KB Output is correct
9 Correct 82 ms 10360 KB Output is correct
10 Correct 80 ms 10212 KB Output is correct
11 Correct 79 ms 10232 KB Output is correct
12 Correct 165 ms 16080 KB Output is correct
13 Correct 480 ms 57768 KB Output is correct
14 Correct 77 ms 10356 KB Output is correct
15 Correct 76 ms 10216 KB Output is correct
16 Correct 100 ms 11064 KB Output is correct
17 Correct 147 ms 19516 KB Output is correct
18 Correct 80 ms 10380 KB Output is correct
19 Correct 78 ms 10228 KB Output is correct
20 Correct 380 ms 25948 KB Output is correct
21 Correct 454 ms 57112 KB Output is correct
22 Correct 459 ms 56672 KB Output is correct
23 Correct 507 ms 57052 KB Output is correct
24 Correct 527 ms 57584 KB Output is correct
25 Correct 195 ms 20420 KB Output is correct
26 Correct 169 ms 20032 KB Output is correct
27 Correct 454 ms 56468 KB Output is correct
28 Correct 482 ms 56844 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 10552 KB Output is correct
2 Correct 78 ms 10488 KB Output is correct
3 Correct 88 ms 10396 KB Output is correct
4 Correct 76 ms 10232 KB Output is correct
5 Correct 92 ms 10284 KB Output is correct
6 Correct 80 ms 10448 KB Output is correct
7 Correct 83 ms 10488 KB Output is correct
8 Correct 175 ms 15860 KB Output is correct
9 Correct 452 ms 57068 KB Output is correct
10 Correct 79 ms 10232 KB Output is correct
11 Correct 80 ms 10360 KB Output is correct
12 Correct 160 ms 15976 KB Output is correct
13 Correct 479 ms 57060 KB Output is correct
14 Correct 93 ms 10252 KB Output is correct
15 Correct 79 ms 10340 KB Output is correct
16 Correct 92 ms 11156 KB Output is correct
17 Correct 130 ms 19304 KB Output is correct
18 Correct 76 ms 10232 KB Output is correct
19 Correct 77 ms 10232 KB Output is correct
20 Correct 82 ms 10348 KB Output is correct
21 Correct 347 ms 27240 KB Output is correct
22 Correct 472 ms 57000 KB Output is correct
23 Correct 464 ms 57084 KB Output is correct
24 Correct 480 ms 56976 KB Output is correct
25 Correct 208 ms 20164 KB Output is correct
26 Correct 145 ms 19176 KB Output is correct
27 Correct 476 ms 57212 KB Output is correct
28 Correct 501 ms 56600 KB Output is correct
29 Correct 215 ms 20528 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 10356 KB Output is correct
2 Correct 80 ms 10344 KB Output is correct
3 Correct 79 ms 10232 KB Output is correct
4 Correct 335 ms 25752 KB Output is correct
5 Correct 507 ms 58432 KB Output is correct
6 Correct 464 ms 56860 KB Output is correct
7 Correct 488 ms 56544 KB Output is correct
8 Correct 84 ms 10340 KB Output is correct
9 Correct 338 ms 26128 KB Output is correct
10 Correct 520 ms 57792 KB Output is correct
11 Correct 490 ms 57272 KB Output is correct
12 Correct 477 ms 56720 KB Output is correct
13 Correct 85 ms 10616 KB Output is correct
14 Correct 81 ms 10472 KB Output is correct
15 Correct 81 ms 10608 KB Output is correct
16 Incorrect 319 ms 27960 KB Too many ways to get from 23 to 253, should be 1 found no less than 2
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 10488 KB Output is correct
2 Correct 81 ms 10344 KB Output is correct
3 Correct 81 ms 10268 KB Output is correct
4 Correct 78 ms 10344 KB Output is correct
5 Correct 79 ms 10360 KB Output is correct
6 Correct 174 ms 16116 KB Output is correct
7 Correct 452 ms 57184 KB Output is correct
8 Correct 81 ms 10488 KB Output is correct
9 Correct 82 ms 10360 KB Output is correct
10 Correct 80 ms 10212 KB Output is correct
11 Correct 79 ms 10232 KB Output is correct
12 Correct 165 ms 16080 KB Output is correct
13 Correct 480 ms 57768 KB Output is correct
14 Correct 77 ms 10356 KB Output is correct
15 Correct 76 ms 10216 KB Output is correct
16 Correct 100 ms 11064 KB Output is correct
17 Correct 147 ms 19516 KB Output is correct
18 Correct 80 ms 10380 KB Output is correct
19 Correct 78 ms 10228 KB Output is correct
20 Correct 380 ms 25948 KB Output is correct
21 Correct 454 ms 57112 KB Output is correct
22 Correct 459 ms 56672 KB Output is correct
23 Correct 507 ms 57052 KB Output is correct
24 Correct 527 ms 57584 KB Output is correct
25 Correct 195 ms 20420 KB Output is correct
26 Correct 169 ms 20032 KB Output is correct
27 Correct 454 ms 56468 KB Output is correct
28 Correct 482 ms 56844 KB Output is correct
29 Correct 82 ms 10552 KB Output is correct
30 Correct 78 ms 10488 KB Output is correct
31 Correct 88 ms 10396 KB Output is correct
32 Correct 76 ms 10232 KB Output is correct
33 Correct 92 ms 10284 KB Output is correct
34 Correct 80 ms 10448 KB Output is correct
35 Correct 83 ms 10488 KB Output is correct
36 Correct 175 ms 15860 KB Output is correct
37 Correct 452 ms 57068 KB Output is correct
38 Correct 79 ms 10232 KB Output is correct
39 Correct 80 ms 10360 KB Output is correct
40 Correct 160 ms 15976 KB Output is correct
41 Correct 479 ms 57060 KB Output is correct
42 Correct 93 ms 10252 KB Output is correct
43 Correct 79 ms 10340 KB Output is correct
44 Correct 92 ms 11156 KB Output is correct
45 Correct 130 ms 19304 KB Output is correct
46 Correct 76 ms 10232 KB Output is correct
47 Correct 77 ms 10232 KB Output is correct
48 Correct 82 ms 10348 KB Output is correct
49 Correct 347 ms 27240 KB Output is correct
50 Correct 472 ms 57000 KB Output is correct
51 Correct 464 ms 57084 KB Output is correct
52 Correct 480 ms 56976 KB Output is correct
53 Correct 208 ms 20164 KB Output is correct
54 Correct 145 ms 19176 KB Output is correct
55 Correct 476 ms 57212 KB Output is correct
56 Correct 501 ms 56600 KB Output is correct
57 Correct 215 ms 20528 KB Output is correct
58 Correct 78 ms 10228 KB Output is correct
59 Correct 81 ms 10104 KB Output is correct
60 Correct 97 ms 11024 KB Output is correct
61 Correct 130 ms 19300 KB Output is correct
62 Correct 82 ms 10480 KB Output is correct
63 Correct 81 ms 10488 KB Output is correct
64 Correct 81 ms 10344 KB Output is correct
65 Incorrect 340 ms 24460 KB Too many ways to get from 11 to 175, should be 1 found no less than 2
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 10488 KB Output is correct
2 Correct 81 ms 10344 KB Output is correct
3 Correct 81 ms 10268 KB Output is correct
4 Correct 78 ms 10344 KB Output is correct
5 Correct 79 ms 10360 KB Output is correct
6 Correct 174 ms 16116 KB Output is correct
7 Correct 452 ms 57184 KB Output is correct
8 Correct 81 ms 10488 KB Output is correct
9 Correct 82 ms 10360 KB Output is correct
10 Correct 80 ms 10212 KB Output is correct
11 Correct 79 ms 10232 KB Output is correct
12 Correct 165 ms 16080 KB Output is correct
13 Correct 480 ms 57768 KB Output is correct
14 Correct 77 ms 10356 KB Output is correct
15 Correct 76 ms 10216 KB Output is correct
16 Correct 100 ms 11064 KB Output is correct
17 Correct 147 ms 19516 KB Output is correct
18 Correct 80 ms 10380 KB Output is correct
19 Correct 78 ms 10228 KB Output is correct
20 Correct 380 ms 25948 KB Output is correct
21 Correct 454 ms 57112 KB Output is correct
22 Correct 459 ms 56672 KB Output is correct
23 Correct 507 ms 57052 KB Output is correct
24 Correct 527 ms 57584 KB Output is correct
25 Correct 195 ms 20420 KB Output is correct
26 Correct 169 ms 20032 KB Output is correct
27 Correct 454 ms 56468 KB Output is correct
28 Correct 482 ms 56844 KB Output is correct
29 Correct 82 ms 10552 KB Output is correct
30 Correct 78 ms 10488 KB Output is correct
31 Correct 88 ms 10396 KB Output is correct
32 Correct 76 ms 10232 KB Output is correct
33 Correct 92 ms 10284 KB Output is correct
34 Correct 80 ms 10448 KB Output is correct
35 Correct 83 ms 10488 KB Output is correct
36 Correct 175 ms 15860 KB Output is correct
37 Correct 452 ms 57068 KB Output is correct
38 Correct 79 ms 10232 KB Output is correct
39 Correct 80 ms 10360 KB Output is correct
40 Correct 160 ms 15976 KB Output is correct
41 Correct 479 ms 57060 KB Output is correct
42 Correct 93 ms 10252 KB Output is correct
43 Correct 79 ms 10340 KB Output is correct
44 Correct 92 ms 11156 KB Output is correct
45 Correct 130 ms 19304 KB Output is correct
46 Correct 76 ms 10232 KB Output is correct
47 Correct 77 ms 10232 KB Output is correct
48 Correct 82 ms 10348 KB Output is correct
49 Correct 347 ms 27240 KB Output is correct
50 Correct 472 ms 57000 KB Output is correct
51 Correct 464 ms 57084 KB Output is correct
52 Correct 480 ms 56976 KB Output is correct
53 Correct 208 ms 20164 KB Output is correct
54 Correct 145 ms 19176 KB Output is correct
55 Correct 476 ms 57212 KB Output is correct
56 Correct 501 ms 56600 KB Output is correct
57 Correct 215 ms 20528 KB Output is correct
58 Correct 83 ms 10356 KB Output is correct
59 Correct 80 ms 10344 KB Output is correct
60 Correct 79 ms 10232 KB Output is correct
61 Correct 335 ms 25752 KB Output is correct
62 Correct 507 ms 58432 KB Output is correct
63 Correct 464 ms 56860 KB Output is correct
64 Correct 488 ms 56544 KB Output is correct
65 Correct 84 ms 10340 KB Output is correct
66 Correct 338 ms 26128 KB Output is correct
67 Correct 520 ms 57792 KB Output is correct
68 Correct 490 ms 57272 KB Output is correct
69 Correct 477 ms 56720 KB Output is correct
70 Correct 85 ms 10616 KB Output is correct
71 Correct 81 ms 10472 KB Output is correct
72 Correct 81 ms 10608 KB Output is correct
73 Incorrect 319 ms 27960 KB Too many ways to get from 23 to 253, should be 1 found no less than 2
74 Halted 0 ms 0 KB -