結果

問題 No.1196 A lazy student
ユーザー uwiuwi
提出日時 2020-08-22 16:53:55
言語 Java21
(openjdk 21)
結果
AC  
実行時間 151 ms / 1,000 ms
コード長 4,031 bytes
コンパイル時間 4,201 ms
コンパイル使用メモリ 82,664 KB
実行使用メモリ 85,728 KB
最終ジャッジ日時 2024-04-23 11:01:18
合計ジャッジ時間 5,289 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
50,688 KB
testcase_01 AC 49 ms
50,720 KB
testcase_02 AC 49 ms
50,520 KB
testcase_03 AC 50 ms
50,276 KB
testcase_04 AC 51 ms
49,944 KB
testcase_05 AC 51 ms
50,048 KB
testcase_06 AC 52 ms
50,052 KB
testcase_07 AC 52 ms
50,332 KB
testcase_08 AC 92 ms
52,644 KB
testcase_09 AC 112 ms
55,444 KB
testcase_10 AC 110 ms
55,164 KB
testcase_11 AC 102 ms
41,380 KB
testcase_12 AC 45 ms
36,584 KB
testcase_13 AC 46 ms
37,336 KB
testcase_14 AC 44 ms
37,008 KB
testcase_15 AC 151 ms
85,728 KB
testcase_16 AC 130 ms
74,284 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package gioku2020day1;
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 O {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	double P, Q, R;
	char[] s;
	int pos, len;
	
	void solve()
	{
		int n = ni();
		P = nd(); Q = nd(); R = nd();
		s = ns(n);
		len = n;
		
		out.println((int)((expr()+1e-11)*100));
		assert len == n;
	}
	
	double expr()
	{
		double O = expr2();
		while(pos < len && s[pos] == 'o'){
			pos += 2;
			double A = expr2();
			O = 1-(1-O) * (1-A);
			O = O * (1-R) + (1-O) * R;
		}
		return O;
	}
	
	double expr2()
	{
		double A = expr3();
		while(pos < len && s[pos] == 'a'){
			pos += 3;
			double X = expr3();
			A = A * X;
			A = A * (1-R) + (1-A) * R;
		}
		return A;
	}
	
	double expr3()
	{
		if(s[pos] == '('){
			// ()
			pos++;
			double X = expr();
			assert s[pos] == ')';
			pos++;
			return X;
		}else if(s[pos] == 'r'){
			// random
			pos += 7;
			double X = expr();
			double Y = expr();
			assert s[pos] == ')';
			pos++;
			return X * Y * P + (1-X*Y) * Q;
		}else{
			return term();
		}
	}
	
	double term()
	{
		if(s[pos] == 'Y'){
			pos += 3;
			return 1.;
		}else{
			assert s[pos] == 'N';
			pos += 2;
			return 0.;
		}
	}
	
	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 O().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