結果

問題 No.576 E869120 and Rings
ユーザー uwiuwi
提出日時 2017-10-13 22:37:32
言語 Java21
(openjdk 21)
結果
AC  
実行時間 494 ms / 1,500 ms
コード長 3,622 bytes
コンパイル時間 3,485 ms
コンパイル使用メモリ 86,004 KB
実行使用メモリ 52,004 KB
最終ジャッジ日時 2024-11-17 11:36:18
合計ジャッジ時間 16,008 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 493 ms
51,636 KB
testcase_01 AC 453 ms
51,964 KB
testcase_02 AC 472 ms
51,856 KB
testcase_03 AC 478 ms
51,664 KB
testcase_04 AC 460 ms
51,680 KB
testcase_05 AC 493 ms
52,000 KB
testcase_06 AC 471 ms
51,832 KB
testcase_07 AC 474 ms
51,604 KB
testcase_08 AC 494 ms
52,004 KB
testcase_09 AC 459 ms
51,936 KB
testcase_10 AC 481 ms
51,888 KB
testcase_11 AC 480 ms
51,940 KB
testcase_12 AC 485 ms
51,820 KB
testcase_13 AC 451 ms
51,852 KB
testcase_14 AC 490 ms
51,768 KB
testcase_15 AC 348 ms
51,988 KB
testcase_16 AC 469 ms
51,764 KB
testcase_17 AC 480 ms
51,960 KB
testcase_18 AC 430 ms
51,696 KB
testcase_19 AC 432 ms
51,852 KB
testcase_20 AC 455 ms
51,932 KB
testcase_21 AC 434 ms
51,952 KB
testcase_22 AC 105 ms
40,672 KB
testcase_23 AC 100 ms
39,832 KB
testcase_24 AC 108 ms
40,652 KB
testcase_25 AC 107 ms
40,984 KB
testcase_26 AC 99 ms
40,032 KB
testcase_27 AC 108 ms
41,292 KB
testcase_28 AC 99 ms
40,048 KB
testcase_29 AC 112 ms
41,292 KB
権限があれば一括ダウンロードができます

ソースコード

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*2+1];
		for(int i = 0, j = 0;i < a.length*2;i++,j++){
			if(j == a.length)j -= a.length;
			cur += a[j]-'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