oj.uz

Submission #301393

# Submission time Handle Problem Language Result Execution time Memory
301393 2020-09-17T22:02:18 Z KWang31 Connecting Supertrees (IOI20_supertrees) Java 11
11 / 100
 477 ms 57712 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 = i+1; j < N; j++) {
                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++) {
            ans[i]++;//Include itself
        }
        for (int i = 0; i < N; i++) {
            ii=find(i,par1);
            if(!done[ii]){
                jj=find(ii,par0);
                if(ii!=jj){
                    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
        
        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
            }
            if(find(ii,par0)!=ii){
                leads.add(new Pair(ii,find(ii,par0)));
            }
            
        }
        
        int prevl=-1;int prevv=0; 
        int prevo=0;//Completes the cycle
        int save=0;
        for (Pair q: leads) {
            
            if(prevl!=q.l0){
                if(prevl!=-1){
                    b[prevv][prevo]=1;b[prevo][prevv]=1;
                } 
                b[q.v][q.l0]=1; b[q.l0][q.v]=1;
                prevl=q.l0; prevo=q.v; 
                
            }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

# Verdict Execution time Memory Grader output
1 Correct 79 ms 10344 KB Output is correct
2 Correct 80 ms 10228 KB Output is correct
3 Correct 80 ms 10360 KB Output is correct
4 Correct 79 ms 10232 KB Output is correct
5 Correct 80 ms 10356 KB Output is correct
6 Correct 140 ms 14312 KB Output is correct
7 Correct 447 ms 56988 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 10344 KB Output is correct
2 Correct 80 ms 10228 KB Output is correct
3 Correct 80 ms 10360 KB Output is correct
4 Correct 79 ms 10232 KB Output is correct
5 Correct 80 ms 10356 KB Output is correct
6 Correct 140 ms 14312 KB Output is correct
7 Correct 447 ms 56988 KB Output is correct
8 Correct 78 ms 10360 KB Output is correct
9 Correct 79 ms 10600 KB Output is correct
10 Correct 79 ms 10472 KB Output is correct
11 Correct 77 ms 10240 KB Output is correct
12 Correct 187 ms 15348 KB Output is correct
13 Correct 419 ms 57028 KB Output is correct
14 Correct 78 ms 10100 KB Output is correct
15 Correct 77 ms 10436 KB Output is correct
16 Correct 93 ms 10996 KB Output is correct
17 Correct 133 ms 19332 KB Output is correct
18 Incorrect 77 ms 10360 KB Answer gives possible 1 while actual possible 0
19 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 10232 KB Output is correct
2 Correct 79 ms 10360 KB Output is correct
3 Correct 78 ms 10360 KB Output is correct
4 Correct 77 ms 10232 KB Output is correct
5 Correct 80 ms 10380 KB Output is correct
6 Correct 81 ms 10220 KB Output is correct
7 Correct 79 ms 10232 KB Output is correct
8 Correct 137 ms 13844 KB Output is correct
9 Correct 442 ms 56632 KB Output is correct
10 Correct 80 ms 10356 KB Output is correct
11 Correct 82 ms 10336 KB Output is correct
12 Correct 169 ms 14848 KB Output is correct
13 Correct 477 ms 56608 KB Output is correct
14 Correct 80 ms 10216 KB Output is correct
15 Correct 75 ms 10224 KB Output is correct
16 Correct 98 ms 11000 KB Output is correct
17 Correct 127 ms 19176 KB Output is correct
18 Correct 82 ms 10344 KB Output is correct
19 Correct 77 ms 10224 KB Output is correct
20 Correct 77 ms 10360 KB Output is correct
21 Incorrect 305 ms 28760 KB Too few ways to get from 0 to 5, should be 2 found 1
22 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 10472 KB Output is correct
2 Correct 84 ms 10508 KB Output is correct
3 Correct 79 ms 10488 KB Output is correct
4 Correct 321 ms 29984 KB Output is correct
5 Correct 466 ms 56172 KB Output is correct
6 Correct 431 ms 57712 KB Output is correct
7 Correct 465 ms 56996 KB Output is correct
8 Correct 78 ms 10344 KB Output is correct
9 Incorrect 321 ms 26644 KB Too few ways to get from 0 to 5, should be 2 found 1
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 10344 KB Output is correct
2 Correct 80 ms 10228 KB Output is correct
3 Correct 80 ms 10360 KB Output is correct
4 Correct 79 ms 10232 KB Output is correct
5 Correct 80 ms 10356 KB Output is correct
6 Correct 140 ms 14312 KB Output is correct
7 Correct 447 ms 56988 KB Output is correct
8 Correct 78 ms 10360 KB Output is correct
9 Correct 79 ms 10600 KB Output is correct
10 Correct 79 ms 10472 KB Output is correct
11 Correct 77 ms 10240 KB Output is correct
12 Correct 187 ms 15348 KB Output is correct
13 Correct 419 ms 57028 KB Output is correct
14 Correct 78 ms 10100 KB Output is correct
15 Correct 77 ms 10436 KB Output is correct
16 Correct 93 ms 10996 KB Output is correct
17 Correct 133 ms 19332 KB Output is correct
18 Incorrect 77 ms 10360 KB Answer gives possible 1 while actual possible 0
19 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 10344 KB Output is correct
2 Correct 80 ms 10228 KB Output is correct
3 Correct 80 ms 10360 KB Output is correct
4 Correct 79 ms 10232 KB Output is correct
5 Correct 80 ms 10356 KB Output is correct
6 Correct 140 ms 14312 KB Output is correct
7 Correct 447 ms 56988 KB Output is correct
8 Correct 78 ms 10360 KB Output is correct
9 Correct 79 ms 10600 KB Output is correct
10 Correct 79 ms 10472 KB Output is correct
11 Correct 77 ms 10240 KB Output is correct
12 Correct 187 ms 15348 KB Output is correct
13 Correct 419 ms 57028 KB Output is correct
14 Correct 78 ms 10100 KB Output is correct
15 Correct 77 ms 10436 KB Output is correct
16 Correct 93 ms 10996 KB Output is correct
17 Correct 133 ms 19332 KB Output is correct
18 Incorrect 77 ms 10360 KB Answer gives possible 1 while actual possible 0
19 Halted 0 ms 0 KB -