結果

問題 No.576 E869120 and Rings
ユーザー uwiuwi
提出日時 2017-10-13 22:34:41
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,572 bytes
コンパイル時間 3,845 ms
コンパイル使用メモリ 83,904 KB
実行使用メモリ 63,844 KB
最終ジャッジ日時 2024-04-28 17:36:09
合計ジャッジ時間 12,955 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 302 ms
63,456 KB
testcase_01 AC 301 ms
63,660 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 301 ms
63,416 KB
testcase_05 AC 303 ms
63,432 KB
testcase_06 AC 290 ms
63,448 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 292 ms
63,624 KB
testcase_10 AC 307 ms
63,668 KB
testcase_11 AC 301 ms
63,656 KB
testcase_12 AC 297 ms
63,532 KB
testcase_13 AC 291 ms
63,592 KB
testcase_14 AC 308 ms
63,684 KB
testcase_15 AC 244 ms
63,332 KB
testcase_16 AC 308 ms
63,160 KB
testcase_17 AC 315 ms
63,168 KB
testcase_18 AC 276 ms
63,480 KB
testcase_19 AC 283 ms
63,476 KB
testcase_20 AC 279 ms
63,388 KB
testcase_21 AC 274 ms
63,516 KB
testcase_22 AC 124 ms
53,956 KB
testcase_23 AC 123 ms
53,696 KB
testcase_24 AC 126 ms
53,968 KB
testcase_25 AC 127 ms
53,712 KB
testcase_26 AC 124 ms
53,772 KB
testcase_27 AC 123 ms
53,628 KB
testcase_28 WA -
testcase_29 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest171013;
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 A {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		char[] a = ns(n);
		double low = 0, high = 1;
		for(int rep = 0;rep < 50;rep++){
			double h = (low+high)/2;
			if(ok(h, a, K)){
				low = h;
			}else{
				high = h;
			}
		}
		out.printf("%.14f\n", low);
	}
	
	boolean ok(double h, char[] a, int K)
	{
		double min = Double.POSITIVE_INFINITY;
		double cur = 0;
		double[] cum = new double[a.length+1];
		for(int i = 0;i < a.length;i++){
			cur += a[i]-'0' - h;
			cum[i+1] = cur;
			if(i+1-K >= 0)min = Math.min(min, cum[i+1-K]);
			if(cur > min)return true;
		}
		return false;
	}
	
	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 A().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