#46621 (Java21) No.30 たこやき工場

• 問題: No.30 たこやき工場
• ユーザー: holeguma
• 提出日時: 2015-08-31 04:33:44
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 71 ms / 5,000 ms
• コード長: 3,023 bytes
• コンパイル時間: 2,503 ms
• コンパイル使用メモリ: 86,944 KB
• 実行使用メモリ: 61,352 KB
• 最終ジャッジ日時: 2024-06-01 02:58:01
• 合計ジャッジ時間: 4,322 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	61 ms; 58,936 KB
testcase_01	AC	61 ms; 59,276 KB
testcase_02	AC	61 ms; 58,980 KB
testcase_03	AC	63 ms; 58,900 KB
testcase_04	AC	62 ms; 61,352 KB
testcase_05	AC	64 ms; 59,076 KB
testcase_06	AC	62 ms; 59,000 KB
testcase_07	AC	61 ms; 59,028 KB
testcase_08	AC	62 ms; 59,032 KB
testcase_09	AC	71 ms; 59,300 KB
testcase_10	AC	67 ms; 59,328 KB
testcase_11	AC	63 ms; 59,416 KB
testcase_12	AC	62 ms; 59,536 KB
testcase_13	AC	62 ms; 59,112 KB
testcase_14	AC	64 ms; 59,316 KB
testcase_15	AC	65 ms; 59,284 KB
testcase_16	AC	63 ms; 58,952 KB

ソースコード

import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.PriorityQueue;
import java.math.BigInteger;
    
public class Main{

static final InputStream in=System.in;
static final PrintWriter out=new PrintWriter(System.out);
static final int INF=Integer.MAX_VALUE/2;
static final long LINF=Long.MAX_VALUE/2;
static int N,M,MAX_N=1000;
static MyArrayList[] list=new MyArrayList[MAX_N+1];
static long[][] dp=new long[MAX_N][MAX_N];

public static void main(String[] args) throws IOException{
InputReader ir=new InputReader(in);
N=ir.nextInt();
M=ir.nextInt();
for(int i=0;i<N;i++){
list[i]=new MyArrayList();
Arrays.fill(dp[i],Long.MIN_VALUE);
}
while(M-->0){
int p=ir.nextInt()-1;
int q=ir.nextInt();
int r=ir.nextInt()-1;
list[r].add(new Edge(p,q));
}
for(int i=0;i<N-1;i++) out.println(dfs(N-1,i));
out.flush();
}

static class Edge{
int to;
int cost;
public Edge(int to,int cost){
this.to=to; this.cost=cost;
}
}

static class MyArrayList extends ArrayList<Edge>{}

public static long dfs(int i,int j){
if(dp[i][j]>=0) return dp[i][j];
if(i==j) return 1;
MyArrayList array=list[i];
if(list[j].size()!=0) return dp[i][j]=0;
if(array.size()==0) return dp[i][j]=0;
long res=0;
for(int k=0;k<array.size();k++){
Edge e=array.get(k);
res+=dfs(e.to,j)*e.cost;
}
return dp[i][j]=res;
}

static class InputReader {
private InputStream in;
private byte[] buffer=new byte[1024];
private int curbuf;
private int lenbuf;

public InputReader(InputStream in) {this.in=in;}
  
public int readByte() {
if(lenbuf==-1) throw new InputMismatchException();
if(curbuf>=lenbuf){
curbuf= 0;
try{
lenbuf=in.read(buffer);
}
catch (IOException e) {
throw new InputMismatchException();
}
if(lenbuf<=0)
return -1;
}
return buffer[curbuf++];
}

public boolean isSpaceChar(int c){return !(c>=33&&c<=126);}

private int skip() {int b; while((b = readByte())!=-1&&isSpaceChar(b)); return b;}

public String next() {
int b=skip();
StringBuilder sb=new StringBuilder();
while(!isSpaceChar(b)){
sb.appendCodePoint(b);
b=readByte();
}
return sb.toString();
}
 
public int nextInt() {
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
int res=0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}

public long nextLong() {
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
long res = 0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}

public int[] toIntArray(int n){
int[] a=new int[n];
for(int i=0;i<n;i++) a[i]=nextInt();
return a;
}
}
}