ccf java高速公路_CCF-201712-4-行车路线-JAVA

importjava.util.ArrayList;importjava.util.Arrays;importjava.util.Iterator;importjava.util.LinkedList;importjava.util.List;importjava.util.Scanner;public classMain {public static intn, m;public static boolean[] mFinalVex; //判断当前节点是否使用

public static double[] mShortPath; //存储到达当前路径的最短距离

public static List> list; //类似于邻接矩阵 存储图

public static voidmain(String[] args) {

Scanner input= newScanner(System.in);

n=input.nextInt();

m=input.nextInt();

list= new ArrayList>(n);for (int i = 0; i < n; i++) {

list.add(new LinkedList());

}inttype;intstart;intend;doublelength;for (int i = 0; i < m; i++) {

type=input.nextInt();

start=input.nextInt();

end=input.nextInt();

length=input.nextInt();

list.get(start- 1).add(new EDGE(type, start - 1, end - 1, length));

list.get(end- 1).add(new EDGE(type, end - 1, start - 1, length));

}

mDijkstra();

System.out.println((long) mShortPath[n - 1]);

input.close();

}private static voidmDijkstra() {double[] trail = new double[n]; //存储到达当前节点连续走的小路长度

mFinalVex = new boolean[n];

mShortPath= new double[n];int index = -1; //表示当前选择并处理某个节点

EDGE tmp;

Arrays.fill(mFinalVex,false);

Arrays.fill(mShortPath, Integer.MAX_VALUE);//初始化都是无穷大

Arrays.fill(trail, 0);

mShortPath[0] = 0;while (!mFinalVex[n - 1]) { //当未搜索到最后一点的时候

index =min(mShortPath);if (index == -1) {break;

}//加入之后开始遍历更新存储长度的数组

LinkedList edges =list.get(index);

Iterator it =edges.iterator();while(it.hasNext()) {

tmp=it.next();int j =tmp.end;if (mFinalVex[j]) { //如果已经被用过了

continue;

}if (tmp.type == 1) {double eee = trail[index] +tmp.length;double sum = mShortPath[index] - (int) Math.pow(trail[index], 2) + (int) Math.pow(eee, 2);if (sum

mShortPath[j]=sum;

trail[j]=eee;

}

}else{double sum = mShortPath[index] +tmp.length;if (sum

mShortPath[j]=sum;

trail[j]= 0;

}

}

}

}

}private static int min(double[] arr) {int index = -1;for (int i = 0; i < n; i++) {if (!mFinalVex[i]) {

index=i;break;

}

}if (index == -1) {returnindex;

}for (int i = 0; i < n; i++) {if (!mFinalVex[i] && arr[index] >arr[i]) {

index=i;

}

}

mFinalVex[index]= true; //表明将当前节点加入到已用节点里面

returnindex;

}

}classEDGE {public inttype;public intstart;public intend;public doublelength;public EDGE(int type, int start, int end, doublelength) {super();this.type =type;this.start =start;this.end =end;this.length =length;

}

}