結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー 37zigen37zigen
提出日時 2021-01-21 23:47:30
言語 Java21
(openjdk 21)
結果
AC  
実行時間 903 ms / 2,500 ms
コード長 3,716 bytes
コンパイル時間 2,890 ms
コンパイル使用メモリ 80,112 KB
実行使用メモリ 93,676 KB
最終ジャッジ日時 2024-06-09 06:30:53
合計ジャッジ時間 19,747 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,544 KB
testcase_01 AC 68 ms
38,380 KB
testcase_02 AC 52 ms
36,708 KB
testcase_03 AC 53 ms
36,328 KB
testcase_04 AC 55 ms
36,808 KB
testcase_05 AC 51 ms
36,280 KB
testcase_06 AC 56 ms
36,736 KB
testcase_07 AC 52 ms
36,396 KB
testcase_08 AC 98 ms
40,756 KB
testcase_09 AC 93 ms
38,732 KB
testcase_10 AC 100 ms
40,412 KB
testcase_11 AC 94 ms
40,092 KB
testcase_12 AC 91 ms
40,336 KB
testcase_13 AC 336 ms
66,444 KB
testcase_14 AC 416 ms
71,844 KB
testcase_15 AC 425 ms
71,632 KB
testcase_16 AC 313 ms
63,668 KB
testcase_17 AC 263 ms
60,036 KB
testcase_18 AC 541 ms
81,184 KB
testcase_19 AC 540 ms
81,204 KB
testcase_20 AC 530 ms
81,248 KB
testcase_21 AC 548 ms
81,268 KB
testcase_22 AC 542 ms
81,240 KB
testcase_23 AC 210 ms
52,176 KB
testcase_24 AC 180 ms
46,648 KB
testcase_25 AC 397 ms
67,256 KB
testcase_26 AC 456 ms
76,224 KB
testcase_27 AC 370 ms
64,848 KB
testcase_28 AC 336 ms
63,880 KB
testcase_29 AC 348 ms
63,892 KB
testcase_30 AC 326 ms
63,960 KB
testcase_31 AC 264 ms
60,064 KB
testcase_32 AC 283 ms
59,132 KB
testcase_33 AC 447 ms
76,280 KB
testcase_34 AC 482 ms
75,328 KB
testcase_35 AC 512 ms
81,972 KB
testcase_36 AC 381 ms
71,784 KB
testcase_37 AC 287 ms
58,716 KB
testcase_38 AC 349 ms
67,484 KB
testcase_39 AC 361 ms
67,676 KB
testcase_40 AC 348 ms
67,596 KB
testcase_41 AC 354 ms
67,476 KB
testcase_42 AC 342 ms
67,532 KB
testcase_43 AC 431 ms
92,548 KB
testcase_44 AC 267 ms
67,744 KB
testcase_45 AC 903 ms
93,676 KB
testcase_46 AC 94 ms
49,044 KB
testcase_47 AC 52 ms
36,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	final long p=(long)1e9+7;
	
	class Edge {
		int src, dst;
		long dist, cnt;
		
		public Edge(int src, int dst, long dist, long cnt) {
			this.src = src;
			this.dst = dst;
			this.dist = dist;
			this.cnt = cnt;
		}
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt()+1;
		int M=sc.nextInt();
		ArrayList<Edge>[] g=new ArrayList[N];
		ArrayList<Edge>[] grev=new ArrayList[N];

		for (int i=0;i<g.length;++i) g[i]=new ArrayList<>();
		for (int i=0;i<g.length;++i) grev[i]=new ArrayList<>();

		for (int i=0;i<M;++i) {
			int u=sc.nextInt();
			int v=sc.nextInt();
			int l=sc.nextInt();
			int a=sc.nextInt();
			g[u].add(new Edge(u, v, l, a));
			grev[v].add(new Edge(v, u, l, a));
		}
		long[] ans=new long[N];
		long[] cnt=new long[N];
		cnt[N-1]=1;
		int[] state=new int[N];
		boolean[] a=new boolean[N];
		boolean[] b=new boolean[N];
		
		dfs0(0,g,a);
		dfs0(N-1,grev,b);
		for (int i=0;i<N;++i) a[i] &= b[i];
		
		Arrays.fill(state, 0);
		dfs(0, g, ans, state, cnt, a);
		System.out.println(ans[0]);
	}
	
	void dfs0(int cur, ArrayList<Edge>[] g, boolean[] valid) {
		valid[cur]=true;
		for (Edge e:g[cur]) {
			if (!valid[e.dst]) dfs0(e.dst,g,valid);
		}
	}
	
	void dfs(int cur, ArrayList<Edge>[] g, long[] ans, int[] state, long[] cnt, boolean[] ok) {
		state[cur]=1;
		for (Edge e:g[cur]) if (ok[e.dst]) {
			if (state[e.dst]==1) {
				System.out.println("INF");
				System.exit(0);
			}
			if (state[e.dst]==0) dfs(e.dst,g,ans,state,cnt,ok);
		}
		for (Edge e:g[cur]) if (ok[e.dst]){
			cnt[cur]+=cnt[e.dst]*e.cnt%p;
			cnt[cur]%=p;
			ans[cur]+=ans[e.dst]*e.cnt%p+cnt[e.dst]*e.cnt%p*e.dist%p;
			ans[cur]%=p;
		}
		state[cur]=2;
	}
	
	
	
	void tr(Object...objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

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