結果
問題 | No.955 ax^2+bx+c=0 |
ユーザー | uwi |
提出日時 | 2019-12-18 14:48:03 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,429 bytes |
コンパイル時間 | 3,539 ms |
コンパイル使用メモリ | 87,544 KB |
実行使用メモリ | 56,180 KB |
最終ジャッジ日時 | 2024-07-07 00:46:34 |
合計ジャッジ時間 | 17,055 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 98 ms
53,764 KB |
testcase_01 | AC | 111 ms
53,960 KB |
testcase_02 | AC | 46 ms
50,024 KB |
testcase_03 | AC | 44 ms
50,348 KB |
testcase_04 | AC | 45 ms
50,320 KB |
testcase_05 | AC | 45 ms
50,412 KB |
testcase_06 | AC | 45 ms
50,320 KB |
testcase_07 | AC | 44 ms
50,388 KB |
testcase_08 | AC | 45 ms
50,324 KB |
testcase_09 | AC | 45 ms
50,044 KB |
testcase_10 | AC | 47 ms
50,296 KB |
testcase_11 | AC | 48 ms
50,248 KB |
testcase_12 | AC | 46 ms
50,368 KB |
testcase_13 | AC | 45 ms
50,284 KB |
testcase_14 | AC | 104 ms
54,184 KB |
testcase_15 | AC | 107 ms
53,596 KB |
testcase_16 | AC | 110 ms
53,768 KB |
testcase_17 | AC | 102 ms
52,620 KB |
testcase_18 | AC | 114 ms
53,904 KB |
testcase_19 | AC | 117 ms
54,076 KB |
testcase_20 | AC | 104 ms
53,704 KB |
testcase_21 | AC | 103 ms
53,780 KB |
testcase_22 | AC | 109 ms
53,964 KB |
testcase_23 | AC | 115 ms
53,776 KB |
testcase_24 | AC | 91 ms
52,632 KB |
testcase_25 | AC | 111 ms
53,768 KB |
testcase_26 | AC | 110 ms
53,912 KB |
testcase_27 | AC | 108 ms
53,664 KB |
testcase_28 | AC | 89 ms
52,472 KB |
testcase_29 | AC | 104 ms
53,888 KB |
testcase_30 | AC | 90 ms
52,912 KB |
testcase_31 | AC | 98 ms
52,832 KB |
testcase_32 | AC | 91 ms
52,636 KB |
testcase_33 | AC | 92 ms
53,064 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | AC | 105 ms
53,784 KB |
testcase_59 | AC | 103 ms
54,056 KB |
testcase_60 | AC | 47 ms
50,356 KB |
testcase_61 | AC | 45 ms
50,324 KB |
testcase_62 | AC | 103 ms
53,888 KB |
testcase_63 | AC | 88 ms
52,724 KB |
testcase_64 | AC | 44 ms
50,256 KB |
testcase_65 | AC | 88 ms
52,724 KB |
testcase_66 | AC | 44 ms
50,216 KB |
testcase_67 | AC | 103 ms
53,992 KB |
testcase_68 | AC | 44 ms
50,052 KB |
testcase_69 | AC | 87 ms
52,864 KB |
testcase_70 | AC | 88 ms
52,560 KB |
testcase_71 | AC | 44 ms
49,940 KB |
testcase_72 | AC | 44 ms
50,420 KB |
testcase_73 | AC | 102 ms
53,972 KB |
testcase_74 | AC | 104 ms
53,884 KB |
testcase_75 | AC | 44 ms
50,288 KB |
testcase_76 | AC | 43 ms
50,108 KB |
testcase_77 | AC | 111 ms
54,144 KB |
testcase_78 | AC | 88 ms
52,468 KB |
testcase_79 | AC | 104 ms
53,800 KB |
testcase_80 | AC | 47 ms
49,912 KB |
testcase_81 | AC | 110 ms
53,776 KB |
testcase_82 | AC | 109 ms
53,780 KB |
testcase_83 | AC | 104 ms
54,120 KB |
testcase_84 | AC | 103 ms
54,132 KB |
testcase_85 | AC | 112 ms
54,104 KB |
testcase_86 | AC | 105 ms
54,036 KB |
testcase_87 | AC | 103 ms
53,856 KB |
testcase_88 | AC | 90 ms
52,608 KB |
testcase_89 | AC | 103 ms
53,872 KB |
testcase_90 | AC | 103 ms
53,844 KB |
testcase_91 | AC | 108 ms
53,904 KB |
testcase_92 | AC | 45 ms
50,296 KB |
testcase_93 | AC | 46 ms
50,400 KB |
testcase_94 | AC | 92 ms
52,616 KB |
testcase_95 | AC | 92 ms
53,052 KB |
testcase_96 | AC | 114 ms
54,000 KB |
testcase_97 | AC | 101 ms
53,948 KB |
testcase_98 | AC | 94 ms
53,052 KB |
testcase_99 | AC | 100 ms
52,876 KB |
testcase_100 | AC | 45 ms
49,888 KB |
testcase_101 | AC | 107 ms
53,860 KB |
testcase_102 | WA | - |
testcase_103 | AC | 90 ms
52,868 KB |
testcase_104 | WA | - |
testcase_105 | WA | - |
testcase_106 | AC | 107 ms
53,880 KB |
testcase_107 | WA | - |
testcase_108 | WA | - |
testcase_109 | AC | 87 ms
52,564 KB |
testcase_110 | WA | - |
testcase_111 | AC | 106 ms
55,792 KB |
testcase_112 | WA | - |
testcase_113 | AC | 109 ms
53,752 KB |
testcase_114 | AC | 105 ms
54,132 KB |
testcase_115 | AC | 101 ms
53,884 KB |
testcase_116 | AC | 96 ms
52,932 KB |
testcase_117 | WA | - |
testcase_118 | WA | - |
testcase_119 | AC | 93 ms
52,604 KB |
testcase_120 | AC | 90 ms
52,636 KB |
testcase_121 | AC | 96 ms
54,352 KB |
testcase_122 | WA | - |
testcase_123 | AC | 93 ms
53,180 KB |
testcase_124 | WA | - |
ソースコード
package adv2019; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; // sqrtを正確に求めないといけない系? public class D17 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { long a = nl(), b = nl(), c = nl(); long[][] res = solveQuad(a, b, c); if(res == null){ out.println(-1); }else{ out.println(res.length); for(long[] u : res){ out.printf("%.14f\n", (u[0] + u[1] * Math.sqrt(u[2])) / u[3]); } } } public static long[][] solveQuad(long A, long B, long C) { if(A == 0){ if(B == 0){ return C == 0 ? null : new long[0][]; }else{ return new long[][]{reducex(new long[]{-C, 0, 0, B})}; } } long D = B*B-4*A*C; if(D < 0){ return new long[0][]; }else if(D == 0){ return new long[][]{reducex(new long[]{-B, 0, 0, 2L*A})}; }else{ if(A > 0){ return new long[][]{ reducex(new long[]{-B, -1, D, 2L*A}), reducex(new long[]{-B, 1, D, 2L*A}) }; }else{ return new long[][]{ reducex(new long[]{-B, 1, D, 2L*A}), reducex(new long[]{-B, -1, D, 2L*A}) }; } } } public static long gcd(long a, long b) { while (b > 0) { long c = a; a = b; b = c % b; } return a; } public static long[] reducex(long[] f) { long g = gcd(f[0], f[3]); for(long p = 2;p*p <= g;p++){ if(g % p == 0 && f[2] % (p*p) == 0){ f[2] /= p*p; g /= p; f[0] /= p; f[3] /= p; } } return f; // // f[2] < 0 ?? // if(f[2] == 0)f[1] = 0; // if(f[1] == 0)f[2] = 0; // if(f[2] == 0 || f[1] == 0){ // // normal fraction // if(f[3] == 0) { // n/0 // f[0] = 1; // }else if(f[0] == 0) { // 0/n // f[3] = 1; // }else { // if(f[3] < 0) { // -a/-b ->a/b // f[0] = -f[0]; // f[3] = -f[3]; // } // long a = Math.abs(f[0]), b = f[3]; // while (b > 0) { // long c = a; // a = b; // b = c % b; // } // f[0] /= a; // f[3] /= a; // } // }else{ // for(long p = 2;p * p <= f[2];p++){ // while(f[2] % (p*p) == 0){ // f[1] *= p; // f[2] /= p*p; // } // } // if(f[3] == 0) { // n/0 // f[0] = 1; // f[1] = f[2] = 0; // }else { // if(f[3] < 0) { // -a/-b ->a/b // f[0] = -f[0]; // f[1] = -f[1]; // f[3] = -f[3]; // } // long a = Math.abs(f[0]), b = f[3]; // while (b > 0) { // long c = a; // a = b; // b = c % b; // } // b = Math.abs(f[1]); // while (b > 0) { // long c = a; // a = b; // b = c % b; // } // // f[0] /= a; // f[1] /= a; // f[3] /= a; // } // } // return f; } 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 D17().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)); } }