結果

問題 No.468 役に立つ競技プログラミング実践編
ユーザー uafr_csuafr_cs
提出日時 2017-11-01 23:33:46
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,566 ms / 2,000 ms
コード長 3,962 bytes
コンパイル時間 2,542 ms
コンパイル使用メモリ 80,760 KB
実行使用メモリ 157,936 KB
最終ジャッジ日時 2023-08-14 16:18:31
合計ジャッジ時間 24,447 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
52,680 KB
testcase_01 AC 79 ms
53,668 KB
testcase_02 AC 88 ms
52,740 KB
testcase_03 AC 92 ms
53,036 KB
testcase_04 AC 76 ms
53,036 KB
testcase_05 AC 100 ms
52,956 KB
testcase_06 AC 92 ms
52,948 KB
testcase_07 AC 90 ms
53,760 KB
testcase_08 AC 89 ms
53,916 KB
testcase_09 AC 91 ms
54,184 KB
testcase_10 AC 89 ms
53,092 KB
testcase_11 AC 88 ms
53,080 KB
testcase_12 AC 89 ms
53,792 KB
testcase_13 AC 90 ms
54,136 KB
testcase_14 AC 173 ms
57,056 KB
testcase_15 AC 173 ms
56,608 KB
testcase_16 AC 168 ms
57,388 KB
testcase_17 AC 174 ms
57,104 KB
testcase_18 AC 184 ms
56,944 KB
testcase_19 AC 178 ms
56,572 KB
testcase_20 AC 163 ms
56,836 KB
testcase_21 AC 174 ms
57,988 KB
testcase_22 AC 169 ms
57,848 KB
testcase_23 AC 182 ms
59,340 KB
testcase_24 AC 1,566 ms
155,728 KB
testcase_25 AC 1,514 ms
146,652 KB
testcase_26 AC 1,522 ms
144,640 KB
testcase_27 AC 1,211 ms
144,696 KB
testcase_28 AC 1,264 ms
144,788 KB
testcase_29 AC 1,190 ms
144,692 KB
testcase_30 AC 1,495 ms
157,936 KB
testcase_31 AC 1,149 ms
148,036 KB
testcase_32 AC 1,204 ms
144,816 KB
testcase_33 AC 1,533 ms
156,192 KB
testcase_34 AC 801 ms
128,800 KB
testcase_35 AC 115 ms
53,820 KB
testcase_36 AC 86 ms
53,012 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.StringTokenizer;
import java.util.Map.Entry;
import java.util.Scanner;

public class Main {
	
	public static final long INF = Long.MAX_VALUE / 2 - 1;
	
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		
		final int N = sc.nextInt();
		final int M = sc.nextInt();
		
		ArrayList<HashMap<Integer, Long>> fwd_adj = new ArrayList<HashMap<Integer, Long>>();
		ArrayList<HashMap<Integer, Long>> rev_adj = new ArrayList<HashMap<Integer, Long>>();
		for(int i = 0; i < N; i++){
			fwd_adj.add(new HashMap<Integer, Long>());
			rev_adj.add(new HashMap<Integer, Long>());
		}
		
		int[] in_degs = new int[N];
		int[] out_degs = new int[N];
		for(int i = 0; i < M; i++){
			final int A = sc.nextInt();
			final int B = sc.nextInt();
			final long C = sc.nextLong();
			
			fwd_adj.get(A).put(B, C);
			rev_adj.get(B).put(A, C);
			
			in_degs[B]++;
			out_degs[A]++;
		}
		
		long[] max_path = new long[N];
		long[] rev_max_path = new long[N];
		Arrays.fill(max_path, -1);
		Arrays.fill(rev_max_path, -1);
		max_path[0] = 0;
		
		LinkedList<Integer> queue = new LinkedList<>();
		for(int i = 0; i < N; i++){
			if(in_degs[i] != 0){ continue; }
			queue.add(i);
		}
		while(!queue.isEmpty()){
			final int node = queue.poll();
			
			for(final Entry<Integer, Long> entry : fwd_adj.get(node).entrySet()){
				final int next = entry.getKey();
				final long cost = max_path[node] + entry.getValue();
				
				if(max_path[next] < 0 || max_path[next] < cost){
					max_path[next] = cost;
				}
				
				in_degs[next]--;
				if(in_degs[next] == 0){ queue.add(next); }
			}
		}
		
		rev_max_path[N - 1] = max_path[N - 1];
		for(int i = 0; i < N; i++){
			if(out_degs[i] != 0){ continue; }
			queue.add(i);
		}
		while(!queue.isEmpty()){
			final int node = queue.poll();
			
			for(final Entry<Integer, Long> entry : rev_adj.get(node).entrySet()){
				final int prev = entry.getKey();
				final long cost = rev_max_path[node] - entry.getValue();
				
				if(rev_max_path[prev] < 0 || rev_max_path[prev] > cost){
					rev_max_path[prev] = cost;
				}
				
				out_degs[prev]--;
				if(out_degs[prev] == 0){ queue.add(prev); }
			}
		}
		
		int count = 0;
		for(int i = 0; i < N; i++){
			if(max_path[i] != rev_max_path[i]){
				count++;
			}
		}
		System.out.println(max_path[N-1] + " " + count + "/" + N);
		//System.out.println(Arrays.toString(max_path));
		//System.out.println(Arrays.toString(rev_max_path));
		
	}
	
	public static class Scanner implements Closeable {
		private BufferedReader br;
		private StringTokenizer tok;

		public Scanner(InputStream is) throws IOException {
			br = new BufferedReader(new InputStreamReader(is));
		}

		private void getLine() throws IOException {
			while (!hasNext()) {
				tok = new StringTokenizer(br.readLine());
			}
		}

		private boolean hasNext() {
			return tok != null && tok.hasMoreTokens();
		}

		public String next() throws IOException {
			getLine();
			return tok.nextToken();
		}

		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) throws IOException {
			final int[] ret = new int[n];
			for (int i = 0; i < n; i++) {
				ret[i] = this.nextInt();
			}
			return ret;
		}

		public long[] nextLongArray(int n) throws IOException {
			final long[] ret = new long[n];
			for (int i = 0; i < n; i++) {
				ret[i] = this.nextLong();
			}
			return ret;
		}

		public void close() throws IOException {
			br.close();
		}
	}
}
0