結果

問題 No.662 スロットマシーン
ユーザー uwiuwi
提出日時 2018-03-09 22:26:01
言語 Java21
(openjdk 21)
結果
AC  
実行時間 182 ms / 2,000 ms
コード長 3,963 bytes
コンパイル時間 4,261 ms
コンパイル使用メモリ 87,580 KB
実行使用メモリ 56,604 KB
最終ジャッジ日時 2024-10-10 05:16:09
合計ジャッジ時間 8,151 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 129 ms
53,800 KB
testcase_01 AC 130 ms
53,840 KB
testcase_02 AC 124 ms
53,976 KB
testcase_03 AC 132 ms
54,068 KB
testcase_04 AC 133 ms
54,300 KB
testcase_05 AC 125 ms
53,992 KB
testcase_06 AC 136 ms
54,060 KB
testcase_07 AC 140 ms
54,100 KB
testcase_08 AC 153 ms
54,096 KB
testcase_09 AC 181 ms
56,496 KB
testcase_10 AC 160 ms
56,140 KB
testcase_11 AC 171 ms
56,384 KB
testcase_12 AC 163 ms
56,220 KB
testcase_13 AC 180 ms
56,508 KB
testcase_14 AC 176 ms
56,536 KB
testcase_15 AC 156 ms
56,604 KB
testcase_16 AC 124 ms
53,784 KB
testcase_17 AC 158 ms
56,412 KB
testcase_18 AC 182 ms
56,576 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180309;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = 5;
		String[] names = new String[n];
		int[] gain = new int[n];
		for(int i = 0;i < n;i++){
			names[i] = ns();
			gain[i] = ni();
		}
		int n1 = ni();
		int[] f1 = new int[n1];
		for(int i = 0;i < n1;i++){
			String name = ns();
			for(int j = 0;j < n;j++){
				if(name.equals(names[j])){
					f1[j]++;
				}
			}
		}
		int n2 = ni();
		int[] f2 = new int[n2];
		for(int i = 0;i < n2;i++){
			String name = ns();
			for(int j = 0;j < n;j++){
				if(name.equals(names[j])){
					f2[j]++;
				}
			}
		}
		int n3 = ni();
		int[] f3 = new int[n3];
		for(int i = 0;i < n3;i++){
			String name = ns();
			for(int j = 0;j < n;j++){
				if(name.equals(names[j])){
					f3[j]++;
				}
			}
		}
		
		long[] anss = new long[n];
		double all = 0;
		for(int i = 0;i < n;i++){
			long v = (long)f1[i]*f2[i]*f3[i]*5L;
			anss[i] = v;
			all += v*gain[i];
		}
		out.printf("%.14f\n", (double)all/n1/n2/n3);
		for(long v : anss){
			out.println(v);
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new B().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0