結果
問題 | No.8072 Sum of sqrt(x) |
ユーザー | uwi |
提出日時 | 2020-09-12 16:37:30 |
言語 | Java21 (openjdk 21) |
結果 |
OLE
|
実行時間 | - |
コード長 | 4,368 bytes |
コンパイル時間 | 4,442 ms |
コンパイル使用メモリ | 82,580 KB |
実行使用メモリ | 37,184 KB |
最終ジャッジ日時 | 2024-06-10 15:36:37 |
合計ジャッジ時間 | 44,691 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
36,936 KB |
testcase_01 | AC | 45 ms
36,900 KB |
testcase_02 | AC | 45 ms
37,064 KB |
testcase_03 | AC | 46 ms
36,976 KB |
testcase_04 | AC | 43 ms
37,184 KB |
testcase_05 | AC | 43 ms
36,860 KB |
testcase_06 | AC | 45 ms
37,000 KB |
testcase_07 | OLE | - |
testcase_08 | OLE | - |
testcase_09 | OLE | - |
testcase_10 | OLE | - |
testcase_11 | OLE | - |
testcase_12 | OLE | - |
testcase_13 | OLE | - |
testcase_14 | OLE | - |
testcase_15 | OLE | - |
testcase_16 | OLE | - |
testcase_17 | OLE | - |
testcase_18 | OLE | - |
testcase_19 | OLE | - |
testcase_20 | OLE | - |
testcase_21 | OLE | - |
testcase_22 | OLE | - |
testcase_23 | OLE | - |
testcase_24 | OLE | - |
testcase_25 | OLE | - |
testcase_26 | OLE | - |
testcase_27 | OLE | - |
testcase_28 | OLE | - |
testcase_29 | OLE | - |
ソースコード
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_3 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int[] a = new int[40]; int[] h = new int[40]; StringBuilder sb = new StringBuilder(); for(int T = ni();T > 0;T--){ long x = nl(); // 00 * 11 if(x != 0) { for (int i = 14; i >= 0; i--) { h[i] = (int) (x % 100); x /= 100; } double t = 0; double u = 0; for (int i = 0; i < 35; i++) { for (int s = t == 0 ? (int)Math.sqrt(u) : (int)(u/t);s >= 0;s--){ if ((t + s) * s <= u) { a[i + 5] += s; u = (u - (t + s) * s) * 100 + h[i]; t = (t + 2 * s) * 10; break; } } } for (int i = 39; i >= 1; i--) { if (a[i] >= 10) { a[i] -= 10; a[i - 1]++; } } } int nzf = -1; for (int i = 0; i < 40; i++) { if (nzf == -1 && a[i] != 0) { nzf = i; } if(nzf == -1 && i == 20){ nzf = 20; } if(nzf != -1){ if(i <= nzf + 18){ sb.append(a[i]); }else{ break; } } if(i == 20){ 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_3().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)); } }