結果

問題 No.3072 Sum of sqrt(x)
ユーザー uwiuwi
提出日時 2020-09-12 18:20:34
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,274 ms / 2,000 ms
コード長 4,558 bytes
コンパイル時間 4,444 ms
コンパイル使用メモリ 81,972 KB
実行使用メモリ 119,284 KB
最終ジャッジ日時 2024-06-24 16:39:27
合計ジャッジ時間 151,732 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,744 KB
testcase_01 AC 54 ms
37,032 KB
testcase_02 AC 54 ms
37,116 KB
testcase_03 AC 53 ms
36,868 KB
testcase_04 AC 54 ms
37,024 KB
testcase_05 AC 54 ms
36,772 KB
testcase_06 AC 55 ms
37,164 KB
testcase_07 AC 1,171 ms
118,436 KB
testcase_08 AC 524 ms
115,800 KB
testcase_09 AC 991 ms
119,148 KB
testcase_10 AC 1,039 ms
117,632 KB
testcase_11 AC 1,202 ms
117,940 KB
testcase_12 AC 1,212 ms
118,540 KB
testcase_13 AC 1,274 ms
118,292 KB
testcase_14 AC 1,179 ms
118,612 KB
testcase_15 AC 1,249 ms
118,380 KB
testcase_16 AC 1,209 ms
117,700 KB
testcase_17 AC 1,083 ms
118,588 KB
testcase_18 AC 1,128 ms
118,160 KB
testcase_19 AC 1,141 ms
118,428 KB
testcase_20 AC 1,220 ms
117,436 KB
testcase_21 AC 1,178 ms
118,452 KB
testcase_22 AC 1,141 ms
117,980 KB
testcase_23 AC 1,077 ms
118,188 KB
testcase_24 AC 1,131 ms
118,600 KB
testcase_25 AC 1,062 ms
118,120 KB
testcase_26 AC 1,165 ms
118,320 KB
testcase_27 AC 972 ms
119,284 KB
testcase_28 AC 1,042 ms
118,600 KB
testcase_29 AC 1,130 ms
118,228 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package extra;

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 P3072_4 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int[] a = new int[20];
		int[] h = new int[20];
		StringBuilder sb = new StringBuilder();
		for(int T = ni();T > 0;T--){
			long x = nl(); // 00 * 11
			if(x != 0) {
				for (int i = 7; i >= 0; i--) {
					h[i] = (int) (x % 10000);
					x /= 10000;
				}
				double t = 0;
				double u = 0;
				for (int i = 0; i < 18; i++) {
					for (int s = t == 0 ? (int)Math.sqrt(u) : (int)(u/t);s >= 0;s--){
						if ((t + s) * s <= u) {
							a[i + 2] += s;
							u = (u - (t + s) * s) * 10000 + h[i];
							t = (t + 2 * s) * 100;
							break;
						}
					}
				}
				for (int i = 19; i >= 1; i--) {
					if (a[i] >= 100) {
						a[i] -= 100;
						a[i - 1]++;
					}
				}

			}
			int nzf = -1;
			boolean first = true;
			for (int i = 0; i < 20; i++) {
				if (nzf == -1 && a[i] != 0) {
					nzf = i;
				}
				if(nzf == -1 && i == 10){
					nzf = 10;
				}
				if(nzf != -1){
					if(i <= nzf + 8){
						if(a[i] < 10){
							if(first){
								sb.append(a[i]);
							}else {
								sb.append(0).append(a[i]);
							}
						}else {
							sb.append(a[i]);
						}
					}else{
						break;
					}
					first = false;
				}
				if(i == 10){
					sb.append(".");
					//					out.print(".");
				}
			}
			sb.append("\n");
			//			out.println();
		}
		out.print(sb);
	}
	
	void run() throws Exception
	{
//		int n = 1000000, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(Math.abs(gen.nextLong() % 1000000000000000000L) + " ");
//		}
//		INPUT = sb.toString();

		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 P3072_4().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