結果
問題 | No.955 ax^2+bx+c=0 |
ユーザー | trineutron |
提出日時 | 2019-12-07 18:38:26 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,343 bytes |
コンパイル時間 | 1,269 ms |
コンパイル使用メモリ | 168,084 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-06 23:30:20 |
合計ジャッジ時間 | 3,433 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | AC | 1 ms
6,944 KB |
testcase_10 | AC | 1 ms
6,944 KB |
testcase_11 | AC | 1 ms
6,944 KB |
testcase_12 | AC | 1 ms
6,940 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 1 ms
6,944 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,944 KB |
testcase_23 | AC | 1 ms
6,940 KB |
testcase_24 | AC | 1 ms
6,940 KB |
testcase_25 | AC | 1 ms
6,940 KB |
testcase_26 | AC | 2 ms
6,944 KB |
testcase_27 | AC | 2 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,940 KB |
testcase_29 | AC | 2 ms
6,940 KB |
testcase_30 | AC | 1 ms
6,940 KB |
testcase_31 | AC | 1 ms
6,940 KB |
testcase_32 | AC | 1 ms
6,940 KB |
testcase_33 | AC | 1 ms
6,944 KB |
testcase_34 | AC | 2 ms
6,944 KB |
testcase_35 | AC | 2 ms
6,940 KB |
testcase_36 | AC | 1 ms
6,940 KB |
testcase_37 | AC | 1 ms
6,940 KB |
testcase_38 | AC | 2 ms
6,940 KB |
testcase_39 | AC | 1 ms
6,940 KB |
testcase_40 | AC | 2 ms
6,944 KB |
testcase_41 | AC | 2 ms
6,944 KB |
testcase_42 | AC | 2 ms
6,940 KB |
testcase_43 | AC | 2 ms
6,944 KB |
testcase_44 | AC | 1 ms
6,944 KB |
testcase_45 | AC | 1 ms
6,944 KB |
testcase_46 | AC | 1 ms
6,940 KB |
testcase_47 | AC | 2 ms
6,940 KB |
testcase_48 | AC | 2 ms
6,944 KB |
testcase_49 | AC | 2 ms
6,940 KB |
testcase_50 | AC | 2 ms
6,940 KB |
testcase_51 | AC | 1 ms
6,940 KB |
testcase_52 | AC | 2 ms
6,940 KB |
testcase_53 | AC | 2 ms
6,940 KB |
testcase_54 | AC | 2 ms
6,940 KB |
testcase_55 | AC | 1 ms
6,944 KB |
testcase_56 | AC | 2 ms
6,944 KB |
testcase_57 | AC | 2 ms
6,940 KB |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 1 ms
6,940 KB |
testcase_61 | AC | 1 ms
6,944 KB |
testcase_62 | AC | 1 ms
6,944 KB |
testcase_63 | AC | 2 ms
6,944 KB |
testcase_64 | AC | 2 ms
6,944 KB |
testcase_65 | AC | 2 ms
6,940 KB |
testcase_66 | AC | 2 ms
6,940 KB |
testcase_67 | AC | 1 ms
6,940 KB |
testcase_68 | AC | 2 ms
6,940 KB |
testcase_69 | AC | 2 ms
6,944 KB |
testcase_70 | AC | 1 ms
6,944 KB |
testcase_71 | AC | 2 ms
6,940 KB |
testcase_72 | AC | 2 ms
6,940 KB |
testcase_73 | AC | 1 ms
6,944 KB |
testcase_74 | AC | 1 ms
6,940 KB |
testcase_75 | AC | 1 ms
6,944 KB |
testcase_76 | AC | 1 ms
6,940 KB |
testcase_77 | AC | 1 ms
6,944 KB |
testcase_78 | AC | 1 ms
6,940 KB |
testcase_79 | AC | 1 ms
6,944 KB |
testcase_80 | AC | 2 ms
6,940 KB |
testcase_81 | AC | 1 ms
6,944 KB |
testcase_82 | AC | 1 ms
6,940 KB |
testcase_83 | AC | 2 ms
6,940 KB |
testcase_84 | AC | 2 ms
6,940 KB |
testcase_85 | AC | 2 ms
6,940 KB |
testcase_86 | AC | 2 ms
6,944 KB |
testcase_87 | AC | 1 ms
6,940 KB |
testcase_88 | AC | 1 ms
6,944 KB |
testcase_89 | AC | 1 ms
6,940 KB |
testcase_90 | AC | 1 ms
6,944 KB |
testcase_91 | AC | 2 ms
6,944 KB |
testcase_92 | AC | 1 ms
6,944 KB |
testcase_93 | AC | 2 ms
6,940 KB |
testcase_94 | AC | 2 ms
6,944 KB |
testcase_95 | AC | 2 ms
6,940 KB |
testcase_96 | AC | 2 ms
6,940 KB |
testcase_97 | AC | 2 ms
6,944 KB |
testcase_98 | AC | 2 ms
6,940 KB |
testcase_99 | AC | 1 ms
6,944 KB |
testcase_100 | AC | 1 ms
6,944 KB |
testcase_101 | AC | 1 ms
6,940 KB |
testcase_102 | AC | 1 ms
6,944 KB |
testcase_103 | AC | 1 ms
6,940 KB |
testcase_104 | AC | 1 ms
6,940 KB |
testcase_105 | AC | 1 ms
6,944 KB |
testcase_106 | AC | 1 ms
6,940 KB |
testcase_107 | AC | 1 ms
6,944 KB |
testcase_108 | AC | 1 ms
6,940 KB |
testcase_109 | AC | 1 ms
6,944 KB |
testcase_110 | AC | 1 ms
6,944 KB |
testcase_111 | AC | 2 ms
6,948 KB |
testcase_112 | AC | 2 ms
6,944 KB |
testcase_113 | AC | 2 ms
6,944 KB |
testcase_114 | AC | 1 ms
6,944 KB |
testcase_115 | AC | 1 ms
6,940 KB |
testcase_116 | AC | 1 ms
6,944 KB |
testcase_117 | AC | 1 ms
6,940 KB |
testcase_118 | AC | 1 ms
6,944 KB |
testcase_119 | AC | 2 ms
6,940 KB |
testcase_120 | AC | 1 ms
6,940 KB |
testcase_121 | AC | 2 ms
6,940 KB |
testcase_122 | AC | 2 ms
6,944 KB |
testcase_123 | AC | 1 ms
6,940 KB |
testcase_124 | AC | 2 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; int64_t a, b, c, det; double f(double x) { double plus = 0.0, minus = 0.0, ax2 = a * x * x, bx = b * x; if (ax2 >= 0) { plus += ax2; } else { minus += ax2; } if (bx >= 0) { plus += bx; } else { minus += bx; } if (c >= 0) { plus += c; } else { minus += c; } return plus + minus; } int main() { cin >> a >> b >> c; assert(-1000000000 <= a && a <= 1000000000); assert(-1000000000 <= b && b <= 1000000000); assert(-1000000000 <= c && c <= 1000000000); det = b * b - 4 * a * c; cout << setprecision(17); if (a == 0) { if (b == 0) { if (c == 0) { cout << -1 << endl; } else { cout << 0 << endl; } } else { cout << 1 << endl; cout << (double) -c / b << endl; } } else { if (det < 0) { cout << 0 << endl; } else if (det == 0) { cout << 1 << endl; cout << (double) -b / (2 * a) << endl; } else { cout << 2 << endl; double lower_bound = -10000000000, upper_bound = (double) -b / (2 * a); while (lower_bound < upper_bound) { double half = (lower_bound + upper_bound) / 2; if (f(lower_bound) == 0) break; if (f(lower_bound) * f(half) < 0) { if (upper_bound == half) break; upper_bound = half; } else { if (lower_bound == half) break; lower_bound = half; } } cout << lower_bound << endl; lower_bound = (double) -b / (2 * a); upper_bound = 10000000000; while (lower_bound < upper_bound) { double half = (lower_bound + upper_bound) / 2; if (f(lower_bound) == 0) break; if (f(lower_bound) * f(half) < 0) { if (upper_bound == half) break; upper_bound = half; } else { if (lower_bound == half) break; lower_bound = half; } } cout << lower_bound << endl; } } }