Circuits

Code

public class Circuits

{

    public int howLong(String[] connects, String[] costs) {

        int N = connects.length;

        int cost[][] = new int[N][N];

        for(int i=0; i<N; i++)

            if(!connects[i].equals("")) {

                String t1[] = connects[i].split(" ");

                String t2[] = costs[i].split(" ");

                for(int j=0; j<t1.length; j++) {

                    int t = Integer.parseInt(t1[j]);

                    int c = Integer.parseInt(t2[j]);

                    cost[i][t] = c;

                }

            }

        for(int k=0; k<N; k++)

        for(int i=0; i<N; i++)

        for(int j=0; j<N; j++)

            if(cost[i][k]!=0 && cost[k][j]!=0 && cost[i][j]<cost[i][k]+cost[k][j])

                cost[i][j] = cost[i][k]+cost[k][j];

        

        int ans = 0;

        for(int i=0; i<N; i++)

        for(int j=0; j<N; j++)

            if(cost[i][j] > ans) ans = cost[i][j];

        

        return ans;

    }

}

Explanation

if(cost[i][k]!=0 && cost[k][j]!=0 && cost[i][j]<cost[i][k]+cost[k][j])

                cost[i][j] = cost[i][k]+cost[k][j];

칩에 있는 모든 부품들의 회선을 탐색하고 cost가 있다면 비교 후에 해당 회선에 최대값을 저장한다.

References

https://community.topcoder.com/stat?c=problem_solution&cr=266571&rd=4494&pm=1593