#410039 (C++14) No.955 ax^2+bx+c=0

提出ソース

結果

問題	No.955 ax^2+bx+c=0
ユーザー	haruki_K
提出日時	2019-12-18 13:19:31
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,034 bytes
コンパイル時間	1,637 ms
コンパイル使用メモリ	168,116 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-07-07 00:42:26
合計ジャッジ時間	3,707 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	1 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	1 ms 6,944 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	1 ms 6,944 KB
testcase_11	AC	1 ms 6,944 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	1 ms 6,944 KB
testcase_18	AC	1 ms 6,940 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	1 ms 6,944 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	1 ms 6,944 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	2 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,944 KB
testcase_29	AC	2 ms 6,944 KB
testcase_30	AC	2 ms 6,948 KB
testcase_31	AC	1 ms 6,940 KB
testcase_32	AC	1 ms 6,944 KB
testcase_33	AC	1 ms 6,944 KB
testcase_34	AC	2 ms 6,940 KB
testcase_35	AC	2 ms 6,940 KB
testcase_36	AC	2 ms 6,944 KB
testcase_37	AC	1 ms 6,944 KB
testcase_38	AC	1 ms 6,940 KB
testcase_39	AC	1 ms 6,944 KB
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	AC	2 ms 6,940 KB
testcase_47	AC	1 ms 6,944 KB
testcase_48	AC	1 ms 6,940 KB
testcase_49	AC	2 ms 6,940 KB
testcase_50	AC	1 ms 6,940 KB
testcase_51	AC	2 ms 6,940 KB
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	AC	2 ms 6,940 KB
testcase_59	AC	2 ms 6,944 KB
testcase_60	AC	1 ms 6,944 KB
testcase_61	AC	1 ms 6,940 KB
testcase_62	AC	2 ms 6,940 KB
testcase_63	AC	2 ms 6,940 KB
testcase_64	AC	1 ms 6,944 KB
testcase_65	AC	2 ms 6,944 KB
testcase_66	AC	2 ms 6,940 KB
testcase_67	AC	1 ms 6,944 KB
testcase_68	AC	1 ms 6,940 KB
testcase_69	AC	1 ms 6,940 KB
testcase_70	AC	2 ms 6,940 KB
testcase_71	AC	2 ms 6,944 KB
testcase_72	AC	1 ms 6,940 KB
testcase_73	AC	2 ms 6,944 KB
testcase_74	AC	2 ms 6,940 KB
testcase_75	AC	2 ms 6,940 KB
testcase_76	AC	2 ms 6,940 KB
testcase_77	AC	1 ms 6,940 KB
testcase_78	AC	2 ms 6,940 KB
testcase_79	AC	1 ms 6,944 KB
testcase_80	AC	1 ms 6,940 KB
testcase_81	AC	1 ms 6,940 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,944 KB
testcase_86	AC	2 ms 6,940 KB
testcase_87	AC	1 ms 6,944 KB
testcase_88	AC	2 ms 6,940 KB
testcase_89	AC	2 ms 6,944 KB
testcase_90	AC	2 ms 6,944 KB
testcase_91	AC	2 ms 6,944 KB
testcase_92	AC	2 ms 6,944 KB
testcase_93	AC	2 ms 6,944 KB
testcase_94	AC	2 ms 6,940 KB
testcase_95	AC	2 ms 6,944 KB
testcase_96	AC	1 ms 6,940 KB
testcase_97	AC	1 ms 6,940 KB
testcase_98	AC	2 ms 6,944 KB
testcase_99	AC	2 ms 6,940 KB
testcase_100	AC	2 ms 6,940 KB
testcase_101	AC	2 ms 6,944 KB
testcase_102	AC	1 ms 6,944 KB
testcase_103	AC	2 ms 6,940 KB
testcase_104	AC	2 ms 6,944 KB
testcase_105	AC	1 ms 6,940 KB
testcase_106	AC	2 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	2 ms 6,940 KB
testcase_111	AC	2 ms 6,940 KB
testcase_112	AC	1 ms 6,944 KB
testcase_113	AC	1 ms 6,944 KB
testcase_114	AC	1 ms 6,940 KB
testcase_115	AC	1 ms 6,940 KB
testcase_116	AC	2 ms 6,940 KB
testcase_117	AC	2 ms 6,940 KB
testcase_118	AC	1 ms 6,944 KB
testcase_119	AC	2 ms 6,944 KB
testcase_120	AC	1 ms 6,944 KB
testcase_121	AC	1 ms 6,940 KB
testcase_122	WA	-
testcase_123	WA	-
testcase_124	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char*) { cerr << endl; }
template <class T, class... U> void dump_impl(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; dump_impl(s, y...); }
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
template <size_t i, class T> typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream&, T const&) { }
template <size_t i = 0, class T> typename enable_if<i < tuple_size<T>::value>::type
output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get<i>(t); output_tuple<i+1,T>(os,t); }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) { return output_tuple(os,t), os; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
// <<<

int32_t main() {
    int a,b,c; cin >> a >> b >> c;

    if (a == 0) {
        if (b == 0) {
            if (c == 0) {
                quit(-1);
            } else {
                quit(0);
            }
        } else {
            cout << 1 << endl;
            cout << double(-c)/b << endl;
        }
    } else {
        __int128 d = __int128(b)*b - __int128(a)*c*4;
        if (d < 0) {
            quit(0);
        } else if (d == 0) {
            cout << 1 << endl;
            cout << double(-b)/(2*a) << endl;
        } else {
            cout << 2 << endl;
            double x = (-sqrt(double(d))-b) /(2*a);
            // double y = (+sqrt(double(d))-b) /(2*a);
            double y = double(-2*c)/(+sqrt(double(d))+b);
            if (a < 0) swap(x,y);
            cout << x << endl;
            cout << y << endl;
        }
    }

}

yukicoder

結果

テストケース

ソースコード