結果

問題 No.173 カードゲーム（Medium）
ユーザー ぴろずぴろず
提出日時 2015-03-28 19:12:06
言語 Java21
(openjdk 21)
結果
AC  
実行時間 308 ms / 3,000 ms
コード長 4,733 bytes
コンパイル時間 2,915 ms
コンパイル使用メモリ 80,456 KB
実行使用メモリ 46,504 KB
最終ジャッジ日時 2024-06-29 01:35:42
合計ジャッジ時間 6,176 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 103 ms
42,768 KB
testcase_01 AC 136 ms
44,104 KB
testcase_02 AC 255 ms
45,920 KB
testcase_03 AC 253 ms
45,964 KB
testcase_04 AC 287 ms
46,504 KB
testcase_05 AC 235 ms
45,628 KB
testcase_06 AC 203 ms
45,052 KB
testcase_07 AC 216 ms
45,368 KB
testcase_08 AC 235 ms
44,856 KB
testcase_09 AC 308 ms
46,184 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no173;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	static IO io = new IO();

	static final int NUM = 50000;
	@SuppressWarnings("unchecked")
	public static void main(String[] args) {
		int n = io.nextInt();
		double[] p = io.nextDoubleArray(2);
		ArrayList<Integer>[] hand = new ArrayList[2];
		for(int i=0;i<2;i++) {
			hand[i] = new ArrayList<>();
			for(int j=0;j<n;j++) {
				hand[i].add(io.nextInt());
			}
			Collections.sort(hand[i]);
		}

		int wins = 0;

		int[] use = new int[2];
		for(int t=0;t<NUM;t++) {
			ArrayList<Integer>[] h = new ArrayList[2];
			for(int i=0;i<2;i++) {
				h[i] = new ArrayList<>(hand[i]);
			}
			int score = 0;
			for(int i=0;i<n;i++) {
				for(int j=0;j<2;j++) {
					if (h[j].size() == 1 || Math.random() < p[j]) {
						use[j] = h[j].remove(0);
					}else{
						use[j] = h[j].remove(1 + (int) (Math.random() * (h[j].size() - 1)));
					}
				}
				score += (use[0] + use[1]) * (use[0] > use[1] ? 1 : -1);
			}
			if (score > 0) {
				wins++;
			}
		}
		System.out.println((double) wins / NUM);
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(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 double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0