結果

問題 No.1814 Uribo Road (Easy)
ユーザー watarimaycry2watarimaycry2
提出日時 2022-08-11 22:55:41
言語 Java21
(openjdk 21)
結果
AC  
実行時間 418 ms / 2,000 ms
コード長 6,594 bytes
コンパイル時間 2,878 ms
コンパイル使用メモリ 91,680 KB
実行使用メモリ 71,392 KB
最終ジャッジ日時 2023-10-22 04:17:19
合計ジャッジ時間 15,497 ms
ジャッジサーバーID
（参考情報） 		judge9 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 102 ms
59,280 KB
testcase_01 AC 122 ms
59,536 KB
testcase_02 AC 104 ms
59,272 KB
testcase_03 AC 113 ms
59,224 KB
testcase_04 AC 101 ms
59,276 KB
testcase_05 AC 105 ms
59,484 KB
testcase_06 AC 114 ms
61,344 KB
testcase_07 AC 104 ms
59,244 KB
testcase_08 AC 109 ms
60,876 KB
testcase_09 AC 161 ms
61,448 KB
testcase_10 AC 133 ms
61,188 KB
testcase_11 AC 189 ms
62,096 KB
testcase_12 AC 237 ms
60,816 KB
testcase_13 AC 203 ms
62,568 KB
testcase_14 AC 277 ms
65,260 KB
testcase_15 AC 187 ms
62,304 KB
testcase_16 AC 205 ms
62,432 KB
testcase_17 AC 202 ms
62,404 KB
testcase_18 AC 202 ms
62,388 KB
testcase_19 AC 206 ms
62,412 KB
testcase_20 AC 300 ms
65,688 KB
testcase_21 AC 240 ms
62,768 KB
testcase_22 AC 368 ms
68,420 KB
testcase_23 AC 303 ms
65,376 KB
testcase_24 AC 332 ms
67,748 KB
testcase_25 AC 337 ms
68,260 KB
testcase_26 AC 368 ms
67,972 KB
testcase_27 AC 401 ms
69,992 KB
testcase_28 AC 398 ms
69,824 KB
testcase_29 AC 409 ms
69,752 KB
testcase_30 AC 394 ms
69,128 KB
testcase_31 AC 418 ms
71,392 KB
testcase_32 AC 243 ms
62,888 KB
testcase_33 AC 147 ms
61,084 KB
testcase_34 AC 127 ms
61,120 KB
testcase_35 AC 241 ms
62,612 KB
testcase_36 AC 228 ms
65,116 KB
testcase_37 AC 234 ms
62,632 KB
testcase_38 AC 286 ms
65,636 KB
testcase_39 AC 198 ms
62,132 KB
testcase_40 AC 225 ms
62,488 KB
testcase_41 AC 332 ms
67,728 KB
testcase_42 AC 288 ms
65,476 KB
testcase_43 AC 259 ms
64,248 KB
testcase_44 AC 291 ms
65,920 KB
testcase_45 AC 176 ms
61,940 KB
testcase_46 AC 323 ms
67,508 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//見なくていいよ　ここから------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			try{
				BufferedReader br = new BufferedReader(new InputStreamReader(System.in, "UTF-8"));
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object... t){System.err.print("debug:");System.err.println(Arrays.deepToString(t));}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		StringBuilder sb = new StringBuilder("");
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof long[]){
			long[] tmp = (long[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof int[]){
			int[] tmp = (int[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof ArrayList){
			ArrayList tmp = (ArrayList)list;
			if(tmp.size() == 0){
				return "";
			}
			sb.append(tmp.get(0));
			for(int i = 1; i < tmp.size(); i++){
				sb.append(joinString).append(tmp.get(i));
			}
			return sb.toString();
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	static ArrayList<String> myconv(String str, String no){
		return new ArrayList<String>(Arrays.asList(str.split(no)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//見なくていいよ　ここまで------------------------------------------
	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
	static void solve(){//ここがメイン関数
		int N = nextInt();
		int M = nextInt();
		int K = nextInt();
		int[][] V = new int[N + 1007][N + 1007];
		for(int i = 1; i <= N; i++){
			Arrays.fill(V[i], 1000000000);
			V[i][i] = 0;
		}
		ArrayList<Integer> klist = nextIntArray(K);
		Collections.sort(klist);
		HashMap<Integer, Edge> E = new HashMap<>();
		HashMap<Integer, Integer> Eno = new HashMap<>();
		String ks = "";
		int now = 0;
		for(int i = 1; i <= M; i++){
			int A = nextInt();
			int B = nextInt();
			int C = nextInt();
			V[A][B] = C;
			V[B][A] = C;
			if(klist.contains(i)){
				E.put(i, new Edge(A, B, C));
				Eno.put(now, i);
				ks += now;
				now++;
			}
		}

		for(int k = 1; k <= N; k++){
			for(int i = 1; i <= N; i++){
				for(int j = 1; j <= N; j++){
					V[i][j] = Math.min(V[i][j], V[i][k] + V[k][j]);
				}
			}
		}
		
		int output = 1000000000;
		while(!ks.equals("Final")){
			for(int i = 0; i < (1 << K); i++){
				ArrayList<Edge> select = new ArrayList<>();
				for(int j = 0; j < K; j++){
					Edge key = E.get(Eno.get(ks.charAt(j) - '0'));
					if((i & (1 << j)) != 0){
						select.add(new Edge(key.A, key.B, key.C));
					}else{
						select.add(new Edge(key.B, key.A, key.C));
					}
				}
				int sum = 0;
				for(int j = 0; j < K; j++){
					sum += select.get(j).C;
					if(j < K - 1){
						sum += V[select.get(j).B][select.get(j + 1).A];
					}
				}
				sum += V[1][select.get(0).A];
				sum += V[select.get(K - 1).B][N];
				output = Math.min(output, sum);
			}
			
			ks = nextPermutation(ks);
		}
		myout(output);
	}
	//メソッド追加エリア　ここから

static class Edge{
	int A;
	int B;
	int C;
	Edge(int A, int B, int C){
		this.A = A;
		this.B = B;
		this.C = C;
	}
	public String toString(){
		return "A : " + A + ", B : " + B;
	}
}

static String nextPermutation(String s){
    ArrayList<Character> list = new ArrayList<>();
    for (int i = 0; i < s.length(); i++) list.add(s.charAt(i));
    int pivotPos = -1;
    char pivot = 0;
    for (int i = list.size() - 2; i >= 0; i--) {
        if (list.get(i) < list.get(i + 1)) {
            pivotPos = i;
            pivot = list.get(i);
            break;
        }
    }
    //s is order by asc
    if (pivotPos == -1 && pivot == 0) return "Final";
    int L = pivotPos + 1;
    int R = list.size() - 1;
    int minPos = -1;
    char min = Character.MAX_VALUE;
    for (int i = R; i >= L; i--) {
        if (pivot < list.get(i) && list.get(i) < min) {
            min = list.get(i);
            minPos = i;
        }
    }
    Collections.swap(list, pivotPos, minPos);
    Collections.sort(list.subList(L, R+1));
    StringBuilder sb = new StringBuilder();
    for (int i = 0; i < list.size(); i++) sb.append(list.get(i));
    return sb.toString();
}

	//メソッド追加エリア　ここまで
}
0