#57683 (Java) No.298 話の伝達

• 問題: No.298 話の伝達
• ユーザー: holeguma
• 提出日時: 2015-11-06 23:45:17
• 言語: Java (openjdk 23)
• 結果: WA
• 実行時間: -
• コード長: 4,082 bytes
• コンパイル時間: 4,418 ms
• コンパイル使用メモリ: 82,584 KB
• 実行使用メモリ: 56,012 KB
• 最終ジャッジ日時: 2024-09-13 13:55:27
• 合計ジャッジ時間: 7,075 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
other	AC * 9 WA * 12

ソースコード

import java.io.InputStream;
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.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigDecimal;
import java.math.BigInteger;
    
public class Main{
 
static PrintWriter out;
static InputReader ir;
 
static void solve(){
 int n=ir.nextInt();
 int m=ir.nextInt();
 int[] from=new int[m],to=new int[m],cost=new int[m];
 for(int i=0;i<m;i++){
  from[i]=ir.nextInt();
  to[i]=ir.nextInt();
  cost[i]=ir.nextInt();
 }
 make_graph(n,from,to,cost);
 Deque<Integer> que=new ArrayDeque<>();
 que.offerLast(0);
 double[] pos=new double[n];
 pos[0]=0.0;
 for(int i=1;i<n;i++) pos[i]=1.0;
 while(!que.isEmpty()){
  int now=que.pollFirst();
  for(int i=0;i<graph[now].size();i++){
   int next=graph[now].get(i).to;
   pos[next]*=(1-(1-pos[now])*(double)graph[now].get(i).cost/100);
   que.offerLast(next);
  }
 }
 out.printf("%.12f\n",1.0-pos[n-1]);
}

static AdjacencyList[] graph;

public static void make_graph(int v,int[] from,int[] to,int[] cost){
 graph=new AdjacencyList[v];
 for(int i=0;i<v;i++)
  graph[i]=new AdjacencyList();
 for(int i=0;i<from.length;i++){
  graph[from[i]].add(new Edge(to[i],cost[i]));
 }
}

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

static class AdjacencyList extends ArrayList<Edge>{}

public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}

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; this.curbuf=this.lenbuf=0;}
 
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }

 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
 
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
 
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
 
 public boolean hasNext(){skip(); return hasNextByte();}
 
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
 
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  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() {
  if(!hasNext()) throw new NoSuchElementException();
  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 double nextDouble(){return Double.parseDouble(next());}

 public BigInteger nextBigInteger(){return new BigInteger(next());}

 public BigDecimal nextBigDecimal(){return new BigDecimal(next());}

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

 public long[] nextLongArray(int n){
  long[] a=new long[n];
  for(int i=0;i<n;i++) a[i]=nextLong();
  return a;
 }

 public char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}