結果

問題 No.30 たこやき工場
ユーザー tenten
提出日時 2023-01-26 10:13:39
言語 Java
(openjdk 23)
結果
AC  
実行時間 102 ms / 5,000 ms
コード長 2,526 bytes
コンパイル時間 3,302 ms
コンパイル使用メモリ 86,064 KB
実行使用メモリ 38,676 KB
最終ジャッジ日時 2024-06-27 06:40:54
合計ジャッジ時間 4,337 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
static long[] dp;
static ArrayList<HashMap<Integer, Integer>> graph = new ArrayList<>();
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
graph.add(new HashMap<>());
}
int m = sc.nextInt();
int[] counts = new int[n];
for (int i = 0; i < m; i++) {
int p = sc.nextInt() - 1;
int q = sc.nextInt();
int r = sc.nextInt() - 1;
graph.get(p).put(r, q);
counts[r]++;
}
dp = new long[n];
Arrays.fill(dp, -1);
dp[n - 1] = 1;
StringBuilder sb = new StringBuilder();
for (int i = 0; i < n - 1; i++) {
if (counts[i] > 0) {
sb.append("0\n");
continue;
}
sb.append(dfw(i)).append("\n");
}
System.out.print(sb);
}
static long dfw(int idx) {
if (dp[idx] < 0) {
dp[idx] = 0;
for (int x : graph.get(idx).keySet()) {
dp[idx] += dfw(x) * graph.get(idx).get(x);
}
}
return dp[idx];
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0