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

• 問題: No.30 たこやき工場
• ユーザー: holeguma
• 提出日時: 2015-08-31 03:55:38
• 言語: Java21 (openjdk 21)
• 結果: WA
• 実行時間: -
• コード長: 3,034 bytes
• コンパイル時間: 2,116 ms
• コンパイル使用メモリ: 82,036 KB
• 実行使用メモリ: 531,508 KB
• 最終ジャッジ日時: 2024-07-18 16:43:48
• 合計ジャッジ時間: 8,272 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	55 ms; 49,876 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	MLE	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-

ソースコード

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 int[] purchase=new int[MAX_N+1];
static MyArrayList[] list=new MyArrayList[MAX_N+1];

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();
while(M-->0){
int p=ir.nextInt()-1;
int q=ir.nextInt();
int r=ir.nextInt()-1;
list[r].add(new Edge(p,q));
}
bfs(N-1);
for(int i=0;i<N-1;i++) out.println(purchase[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 void bfs(int s){
Deque<Integer> que=new ArrayDeque<Integer>();
purchase[s]=1;
que.offerLast(s);
while(!que.isEmpty()){
int cur=que.pollFirst();
MyArrayList array=list[cur];
if(array.size()==0) continue;
for(int i=0;i<array.size();i++){
Edge e=array.get(i);
purchase[e.to]+=purchase[cur]*e.cost;
purchase[cur]=0;
que.offerLast(e.to);
}
}
}

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;
}
}
}