結果

問題 No.691 E869120 and Constructing Array 5
ユーザー uwi
提出日時 2018-05-23 22:10:14
言語 Java
(openjdk 23)
結果
AC  
実行時間 787 ms / 1,000 ms
コード長 5,230 bytes
コンパイル時間 4,341 ms
コンパイル使用メモリ 82,060 KB
実行使用メモリ 61,788 KB
最終ジャッジ日時 2024-06-28 16:29:48
合計ジャッジ時間 26,699 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180518;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.Random;

public class EX {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	class Datum
	{
		double v;
		int[] es;
		public Datum(double v, int[] es) {
			this.v = v;
			this.es = es;
		}
	}
	
	void solve()
	{
		for(int T = ni();T > 0;T--){
			double P = nd();
			while(true){
				Datum[] d0 = enumPairs(100, P/8, 1e-4);
				Datum[] d1 = merge(d0, d0, P/4, 1e-6);
				Datum[] d2 = merge(d1, d1, P/2, 1e-8);
				Datum[] d3 = merge(d2, d2, P, 0.9e-10);
				if(d3.length > 0){
					out.print(d3[0].es.length);
					for(int x : d3[0].es){
						out.print(" " + x);
					}
					out.println();
					break;
				}
			}
		}
	}
	
	Datum[] enumPairs(int n, double val, double eps)
	{
		Random gen = new Random();
		Datum[] ds = new Datum[n];
		int p = 0;
		while(p < n){
			int a = gen.nextInt((int)(val*val));
			// sqrt(a)+sqrt(b)=val
			double v = (val - Math.sqrt(a)) * (val - Math.sqrt(a));
			int low = (int)Math.floor(v);
			if(Math.abs(Math.sqrt(a)+Math.sqrt(low)-val) < eps){
				ds[p++] = new Datum(Math.sqrt(a) + Math.sqrt(low), new int[]{a, low});
				if(p == n)break;
			}
			int high = (int)Math.ceil(v);
			if(Math.abs(Math.sqrt(a)+Math.sqrt(high)-val) < eps){
				ds[p++] = new Datum(Math.sqrt(a) + Math.sqrt(high), new int[]{a, high});
				if(p == n)break;
			}
		}
		return ds;
	}
	
	Datum[] merge(Datum[] a, Datum[] b, double val, double eps)
	{
		Arrays.sort(a, new Comparator<Datum>() {
			public int compare(Datum a, Datum b) {
				return Double.compare(a.v, b.v);
			}
		});
		double[] avs = new double[a.length];
		for(int i = 0;i < a.length;i++){
			avs[i] = a[i].v;
		}
		
		int n = a.length;
		Datum[] ret = new Datum[2*n];
		int p = 0;
		for(Datum d : b){
			int ind = Arrays.binarySearch(avs, val-d.v);
			int low = ind >= 0 ? ind : -ind-2;
			if(low >= 0 && Math.abs(d.v + avs[low] - val) < eps){
				ret[p++] = new Datum(d.v + avs[low], merge(d.es, a[low].es));
			}
			int high = ind >= 0 ? ind : -ind-1;
			if(high < a.length && Math.abs(d.v + avs[high] - val) < eps){
				ret[p++] = new Datum(d.v + avs[high], merge(d.es, a[high].es));
			}
		}
		return Arrays.copyOf(ret, p);
	}
	
	int[] merge(int[] a, int[] b)
	{
		int[] c = Arrays.copyOf(a, a.length+b.length);
		System.arraycopy(b, 0, c, a.length, b.length);
		return c;
	}
	
	
	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 EX().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