#409713 (C++17) No.955 ax^2+bx+c=0

提出ソース

結果

問題	No.955 ax^2+bx+c=0
ユーザー	Pachicobue
提出日時	2019-12-18 00:43:13
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	25,192 bytes
コンパイル時間	3,559 ms
コンパイル使用メモリ	242,160 KB
実行使用メモリ	4,508 KB
最終ジャッジ日時	2023-09-21 05:29:46
合計ジャッジ時間	7,525 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

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

テストケース

テストケース表示

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

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

ソースコード

raw source code

#include <bits/stdc++.h>
// created [2019/12/18] 00:09:13
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32   = int32_t;
using i64   = int64_t;
using u32   = uint32_t;
using u64   = uint64_t;
using uint  = unsigned int;
using usize = std::size_t;
using ll    = long long;
using ull   = unsigned long long;
using ld    = long double;
template<typename T, usize n>
using arr = T (&)[n];
template<typename T, usize n>
using c_arr = const T (&)[n];
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };

template<typename T>
T in()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename Uint, usize n, usize i>
T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }
template<typename T, typename Uint, usize n, usize i>
auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs)
{
    const usize s = (usize)szs[i];
    std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);
    for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }
    return ans;
}
template<typename T, typename Uint, usize n>
auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }
template<typename... Types>
auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }
struct io_init
{
    io_init()
    {
        std::cin.tie(nullptr), std::ios::sync_with_stdio(false);
        std::cout << std::fixed << std::setprecision(20);
    }
} hogechan;

template<typename T>
int out(const T& v) { return std::cout << v, 0; }
template<typename T>
int out(const std::vector<T>& v)
{
    for (usize i = 0; i < v.size(); i++) {
        if (i > 0) { std::cout << ' '; }
        out(v[i]);
    }
    return std::cout << "\n", 0;
}
template<typename T1, typename T2>
int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }
template<typename T, typename... Args>
int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }
template<typename... Args>
int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }
template<typename... Args>
void outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }
#    define SHOW(...) static_cast<void>(0)
constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }

template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }
template<typename T, typename Uint, usize n, usize i>
auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{})
{
    const usize s = (usize)szs[i];
    return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));
}
template<typename T, typename Uint, usize n>
auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }
using namespace std;
template<int acc> class AMP : public deque<int>
{
private:
    static constexpr int root = 5;
    static constexpr int MOD_ = 924844033;

    static void trim_digit(AMP& num)
    {
        while ((int)num.size() >= 1 && num.back() == 0) num.pop_back();
        if ((int)num.size() == 1 && num[0] == 0) {
            num.zero = true;
            return;
        }
        while ((int)num.size() < acc) num.push_front(0), num.ex--;
        while ((int)num.size() > acc + 1) num.pop_front(), num.ex++;
        rounding(num);
    }
    static void rounding(AMP& num)
    {
        if ((int)num.size() != acc + 1) return;
        if (num[0] >= 5) {
            int pos = 1;
            do {
                num[pos]++;
                if (num[pos] != 10) break;
                num[pos] = 0;
            } while (++pos <= acc);
            if (pos == acc + 1) num.push_back(1), num.pop_back(), num.ex++;
        }
        num.pop_front(), num.ex++;
    }
    static bool abs_less(const AMP& a, const AMP& b)
    {
        if (a.ex != b.ex) return a.ex < b.ex;
        for (int index = acc - 1; index >= 0; index--) {
            if (a[index] != b[index]) return a[index] < b[index];
        }
        return false;
    }
    static void num_sbst(AMP& a, const AMP& b)
    {
        a.resize(acc), a.zero = false, a.ex = b.ex;
        for (int i = 0; i < acc; i++) a[i] = b[i];
    }
    static void add(const AMP& a, const AMP& b, AMP& res)
    {
        int diff = a.ex - b.ex, carry = 0;
        if (abs(diff) > acc) return (diff > 0) ? num_sbst(res, a) : num_sbst(res, b);
        if (diff >= 0) {
            num_sbst(res, a);
            if (diff) res.push_front(0), res.ex--;
            for (int i = !diff; i <= acc; i++) {
                int val        = res[i - !diff] + (i <= acc - diff ? b[i + diff - 1] : 0) + carry;
                carry          = val / 10;
                res[i - !diff] = val % 10;
            }
            if (carry) res.push_back(1);
        } else {
            num_sbst(res, b);
            res.push_front(0), res.ex--;
            for (int i = 0; i <= acc; i++) {
                int val = res[i] + (i <= acc + diff ? a[i - diff - 1] : 0) + carry;
                carry   = val / 10;
                res[i]  = val % 10;
            }
            if (carry) res.push_back(1);
        }
        trim_digit(res);
    }
    static void sub(const AMP& a, const AMP& b, AMP& res)
    {
        int diff = a.ex - b.ex, carry = 0;
        num_sbst(res, a);
        if (diff > acc) return;
        if (diff) {
            res.push_front(0), res.ex--;
            int carry = 0;
            for (int i = 0; i <= acc; i++) {
                int val = res[i] - carry - (i <= acc - diff ? b[i + diff - 1] : 0);
                if (val < 0) {
                    carry = 1, val += 10;
                } else {
                    carry = 0;
                }
                res[i] = val;
            }
        } else {
            for (int i = 0; i < acc; i++) {
                int val = res[i] - carry - b[i];
                if (val < 0) {
                    carry = 1, val += 10;
                } else {
                    carry = 0;
                }
                res[i] = val;
            }
        }
        trim_digit(res);
    }
    static int add_(const int x, const int y) { return (x + y < MOD_) ? x + y : x + y - MOD_; }
    static int mul_(const int x, const int y) { return (long long)x * y % MOD_; }
    static int power(int x, int n)
    {
        int res = 1;
        while (n > 0) {
            if (n & 1) res = mul_(res, x);
            x = mul_(x, x);
            n >>= 1;
        }
        return res;
    }
    static int inverse(const int x) { return power(x, MOD_ - 2); }
    static void ntt(vector<int>& a, const bool rev = false)
    {
        int i, j, k, s, t, v, w, wn;
        const int size   = (int)a.size();
        const int height = (int)log2(2 * size - 1);
        for (i = 0; i < size; i++) {
            j = 0;
            for (k = 0; k < height; k++) j |= (i >> k & 1) << (height - 1 - k);
            if (i < j) std::swap(a[i], a[j]);
        }
        for (i = 1; i < size; i *= 2) {
            w = power(root, (MOD_ - 1) / (i * 2));
            if (rev) w = inverse(w);
            for (j = 0; j < size; j += i * 2) {
                wn = 1;
                for (k = 0; k < i; k++) {
                    s = a[j + k], t = mul_(a[j + k + i], wn);
                    a[j + k]     = add_(s, t);
                    a[j + k + i] = add_(s, MOD_ - t);
                    wn           = mul_(wn, w);
                }
            }
        }
        if (rev) {
            v = inverse(size);
            for (i = 0; i < size; i++) a[i] = mul_(a[i], v);
        }
    }
    static void mul(const AMP& a, const AMP& b, AMP& res)
    {
        const int size = (int)a.size() + (int)b.size() - 1;
        int t          = 1;
        while (t < size) t <<= 1;
        vector<int> A(t, 0), B(t, 0);
        for (int i = 0; i < (int)a.size(); i++) A[i] = a[i];
        for (int i = 0; i < (int)b.size(); i++) B[i] = b[i];
        ntt(A), ntt(B);
        for (int i = 0; i < t; i++) A[i] = mul_(A[i], B[i]);
        ntt(A, true);
        res.resize(size);
        int carry = 0;
        for (int i = 0; i < size; i++) {
            int val = A[i] + carry;
            carry   = val / 10;
            res[i]  = val % 10;
        }
        if (carry) res.push_back(carry);
        trim_digit(res);
    }

    class MPI : public deque<int>
    {
    public:
        MPI() { push_back(0); }
        inline static void trim_digit(MPI& num)
        {
            while (num.back() == 0 && (int)num.size() >= 2) num.pop_back();
        }
        bool isZero() const
        {
            return (int)size() == 1 && (*this)[0] == 0;
        }
        static void add(const MPI& a, const MPI& b, MPI& res)
        {
            res    = a;
            int mx = (int)max(a.size(), b.size());
            res.resize(mx, 0);
            int carry = 0;
            for (int i = 0; i < mx; i++) {
                int val = res[i] + ((i < (int)b.size()) ? b[i] : 0) + carry;
                carry   = val / 10;
                res[i]  = val % 10;
            }
            if (carry) res.push_back(1);
        }
        static void sub(const MPI& a, const MPI& b, MPI& res)
        {
            res       = a;
            int carry = 0;
            for (int i = 0; i < (int)res.size(); i++) {
                int val = res[i] - carry - ((i < (int)b.size()) ? b[i] : 0);
                if (val < 0) {
                    carry = 1, val += 10;
                } else {
                    carry = 0;
                }
                res[i] = val;
            }
            trim_digit(res);
        }
        bool operator<(const MPI& another) const
        {
            if (size() != another.size()) return size() < another.size();
            for (int index = (int)size() - 1; index >= 0; index--) {
                if ((*this)[index] != another[index]) return (*this)[index] < another[index];
            }
            return false;
        }
        static bool div_geq(const MPI& mod, const MPI& num)
        {
            if ((int)mod.size() != (int)num.size()) return (int)mod.size() > (int)num.size();
            int n = (int)mod.size();
            for (int i = 0; i < n; i++) {
                if (mod[n - 1 - i] != num[n - 1 - i]) {
                    return mod[n - 1 - i] > num[n - 1 - i];
                }
            }
            return true;
        }
        static void div_(const MPI& a, const MPI& b, MPI& res)
        {
            vector<MPI> mult(9);
            MPI mod;
            mult[0] = b;
            for (int i = 0; i < 8; i++) add(mult[i], b, mult[i + 1]);
            for (int i = (int)a.size() - 1; i >= 0; i--) {
                if (mod.isZero()) {
                    mod.back() = a[i];
                } else {
                    mod.push_front(a[i]);
                }
                if (div_geq(mod, b)) {
                    int l = 0, r = 9;
                    while (r - l > 1) {
                        int mid = (l + r) / 2;
                        if (mod < mult[mid]) {
                            r = mid;
                        } else {
                            l = mid;
                        }
                    }
                    MPI mod_ = mod;
                    sub(mod_, mult[l], mod);
                    res.push_front(l + 1);
                } else {
                    res.push_front(0);
                }
            }
            trim_digit(res);
        }
    };

    static void mpi_AMP(MPI& a, const AMP& b)
    {
        if (b.zero) {
            a = MPI();
            return;
        }
        int n = (int)b.size();
        a.resize(n);
        for (int i = 0; i < n; i++) a[i] = b[i];
    }

    static void AMP_mpi(AMP& a, const MPI& b)
    {
        if (b.isZero()) {
            a = AMP();
            return;
        }
        int n = (int)b.size();
        a.resize(n);
        for (int i = 0; i < n; i++) a[i] = b[i];
    }

public:
    friend ostream& operator<<(ostream& os, const AMP& num)
    {
        if (num.zero) {
            os << "0.";
            for (int i = 0; i < acc - 1; i++) os << '0';
            os << "+e0";
            return os;
        }
        if (num.sign) os << '-';
        os << num.back() << '.';
        for (int i = 0; i < acc - 1; i++) os << num[acc - 2 - i];
        os << 'e';
        if (num.ex + acc - 1 >= 0) os << '+';
        os << num.ex + acc - 1;
        return os;
    }

    friend istream& operator>>(istream& is, AMP& num)
    {
        string s;
        is >> s;
        num = AMP(s);
        return is;
    }

    void print_decimal(int decimal) const
    {
        if (zero) {
            cout << "0.";
            for (int i = 0; i < decimal; i++) cout << '0';
        }
        if (sign) cout << '-';
        for (int i = max(ex + acc - 1, 0LL); i >= -decimal; i--) {
            cout << ((i - ex >= 0 || i - ex >= acc) ? (*this)[i - ex] : '0');
            if (i == 0) cout << '.';
        }
    }

    double to_double() const
    {
        if (zero) { return 0.0; }
        double res = 0.0, d = 1.0;
        for (int i = 0; i < acc; i++) {
            res += (*this)[i] * d, d *= 10.0;
        }
        return res * pow(10.0, ex);
    }

    AMP& operator=(long long num)
    {
        *this = AMP(num);
        return *this;
    }

    bool operator<(const AMP& num) const
    {
        if (zero) return !num.zero && !num.sign;
        if (num.zero) return sign;
        if (sign ^ num.sign) return sign;
        if (ex != num.ex) return (ex < num.ex) ^ sign;
        for (int index = acc - 1; index >= 0; index--) {
            if ((*this)[index] != num[index]) return ((*this)[index] < num[index]) ^ sign;
        }
        return false;
    }

    bool operator<(const long long num) const
    {
        return *this < AMP(num);
    }

    friend bool operator<(const long long num, const AMP& another)
    {
        return AMP(num) < another;
    }

    bool operator>(const AMP& num) const
    {
        return num < *this;
    }

    bool operator>(const long long num) const
    {
        return *this > AMP(num);
    }

    friend bool operator>(const long long num, const AMP& another)
    {
        return AMP(num) > another;
    }

    bool operator<=(const AMP& num) const
    {
        return !(*this > num);
    }

    bool operator<=(const long long num) const
    {
        return *this <= AMP(num);
    }

    friend bool operator<=(const long long num, const AMP& another)
    {
        return AMP(num) <= another;
    }

    bool operator>=(const AMP& num) const
    {
        return !(*this < num);
    }

    bool operator>=(const long long num) const
    {
        return *this >= AMP(num);
    }

    friend bool operator>=(const long long num, const AMP& another)
    {
        return AMP(num) >= another;
    }

    bool operator==(const AMP& num) const
    {
        if (zero || num.zero) return zero && num.zero;
        if (sign ^ num.sign) return false;
        if (ex != num.ex) return false;
        for (int index = acc - 1; index >= 0; index--) {
            if ((*this)[index] != num[index]) return false;
        }
        return true;
    }

    bool operator==(const long long num) const
    {
        return *this == AMP(num);
    }

    friend bool operator==(const long long num, const AMP& another)
    {
        return AMP(num) == another;
    }

    bool operator!=(const AMP& num) const
    {
        return !(*this == num);
    }

    bool operator!=(const long long num) const
    {
        return *this != AMP(num);
    }

    friend bool operator!=(const long long num, const AMP& another)
    {
        return AMP(num) != another;
    }

    explicit operator bool() const noexcept { return !zero; }
    bool operator!() const noexcept { return !static_cast<bool>(*this); }

    explicit operator int() const noexcept { return (int)this->to_ll(); }
    explicit operator long long() const noexcept { return this->to_ll(); }

    AMP operator+() const
    {
        return *this;
    }

    AMP operator-() const
    {
        AMP res  = *this;
        res.sign = !sign;
        return res;
    }

    friend AMP abs(const AMP& num)
    {
        AMP res  = num;
        res.sign = false;
        return res;
    }

    AMP operator+(const AMP& num) const
    {
        if (zero) {
            AMP res = num;
            return res;
        }
        if (num.zero) {
            AMP res = *this;
            return res;
        }
        AMP res;
        res.sign = sign;
        if (sign != num.sign) {
            if (abs_less(*this, num)) {
                res.sign = num.sign;
                sub(num, *this, res);
                return res;
            } else {
                sub(*this, num, res);
                return res;
            }
        }
        add(*this, num, res);
        return res;
    }

    AMP operator+(long long num) const
    {
        return *this + AMP(num);
    }

    friend AMP operator+(long long a, const AMP& b)
    {
        return b + a;
    }

    AMP& operator+=(const AMP& num)
    {
        *this = *this + num;
        return *this;
    }

    AMP& operator+=(long long num)
    {
        *this = *this + num;
        return *this;
    }

    AMP& operator++()
    {
        return *this += 1;
    }

    AMP operator++(int)
    {
        AMP res = *this;
        *this += 1;
        return res;
    }

    AMP operator-(const AMP& num) const
    {
        if (zero) {
            AMP res  = num;
            res.sign = !res.sign;
            return res;
        }
        if (num.zero) {
            AMP res = *this;
            return res;
        }
        AMP res;
        res.sign = sign;
        if (sign != num.sign) {
            add(*this, num, res);
            return res;
        }
        if (abs_less(*this, num)) {
            res.sign = !sign;
            sub(num, *this, res);
        } else {
            sub(*this, num, res);
        }
        return res;
    }

    AMP operator-(long long num) const
    {
        return *this - AMP(num);
    }

    friend AMP operator-(long long a, const AMP& b)
    {
        return AMP(a) - b;
    }

    AMP& operator-=(const AMP& num)
    {
        *this = *this - num;
        return *this;
    }

    AMP& operator-=(long long num)
    {
        *this = *this - num;
        return *this;
    }

    AMP& operator--()
    {
        return *this -= 1;
    }

    AMP operator--(int)
    {
        AMP res = *this;
        *this -= 1;
        return res;
    }

    AMP operator*(const AMP& num) const
    {
        if (zero || num.zero) return AMP();
        AMP res;
        res.zero = false;
        res.sign = (sign ^ num.sign);
        res.ex   = ex + num.ex;
        mul(*this, num, res);
        return res;
    }

    AMP operator*(long long num) const
    {
        return *this * AMP(num);
    }

    friend AMP operator*(long long a, const AMP& b)
    {
        return b * a;
    }

    AMP& operator*=(const AMP& num)
    {
        *this = *this * num;
        return *this;
    }

    AMP& operator*=(long long num)
    {
        *this = *this * num;
        return *this;
    }

    AMP operator/(const AMP& num) const
    {
        assert(!num.zero);
        if (zero) { return AMP(); }
        MPI kp, res_, num_;
        mpi_AMP(num_, num);
        AMP res;
        res.zero = false;
        res.sign = (sign ^ num.sign);
        res.ex   = ex - num.ex;
        mpi_AMP(kp, *this);
        if (abs_less(*this, num)) kp.push_front(0), res.ex--;
        for (int i = 0; i < acc; i++) kp.push_front(0), res.ex--;
        MPI::div_(kp, num_, res_);
        AMP_mpi(res, res_);
        trim_digit(res);
        return res;
    }

    AMP operator/(long long num) const
    {
        return *this / AMP(num);
    }

    friend AMP operator/(long long a, const AMP& b)
    {
        return AMP(a) / b;
    }

    AMP& operator/=(const AMP& num)
    {
        *this = *this / num;
        return *this;
    }

    AMP& operator/=(long long num)
    {
        *this = *this / num;
        return *this;
    }

    AMP div2() const
    {
        if (zero) return AMP();
        AMP res   = *this;
        int carry = 0;
        for (int i = acc - 1; i >= 0; i--) {
            int val = (*this)[i] + carry * 10;
            carry   = val % 2;
            if (i != acc - 1 || val >= 2) {
                res[i] = val / 2;
            } else {
                res[i] = 0;
            }
        }
        if (carry) res.push_front(5), res.ex--;
        trim_digit(res);
        return res;
    }

    friend AMP sqrt(AMP x)
    {
        if (x <= AMP(0)) return AMP();
        AMP s = 1, t = x;
        while (s < t) {
            s = s + s, t = t.div2();
        }
        do {
            t = s, s = (x / s + s).div2();
        } while (s < t);
        trim_digit(t);
        return t;
    }

    friend AMP log10(const AMP& x)
    {
        assert(x > AMP(0));
        return AMP(acc + x.ex);
    }

    friend AMP pow(AMP a, long long b)
    {
        if (a.zero) return AMP();
        assert(b >= 0);
        AMP res(1);
        while (b) {
            if (b % 2) res *= a;
            a *= a;
            b = b / 2;
        }
        return res;
    }

    bool sign, zero;
    long long ex;

    AMP() : zero(true) {}

    AMP(long long val) : sign(false), zero(false), ex(0)
    {
        if (val == 0) {
            zero = true;
            return;
        }
        if (val < 0) sign = true, val = -val;
        while (val) push_back(val % 10), val /= 10;
        trim_digit(*this);
    }

    AMP(const string& s) : sign(false), zero(false), ex(0)
    {
        if (s.empty() || s == "0") {
            zero = true;
            return;
        }
        if (s[0] == '-') sign = true;
        for (int i = (int)s.size() - 1; i >= sign; i--) {
            if (s[i] == '.') {
                ex = i + 1 - (int)s.size();
            } else {
                push_back(s[i] - '0');
            }
        }
        trim_digit(*this);
    }
};
int main()
{
    using ld             = AMP<256>;
    const auto [A, B, C] = in_t<ll, ll, ll>();
    const auto [a, b, c] = std::tuple<ld, ld, ld>(A, B, C);
    if (A == 0) {
        if (B == 0) {
            if (C == 0) {
                return outln(-1);
            } else {
                return outln(0);
            }
        } else {
            outln(1);
            outln((-c / b).to_double());
            return 0;
        }
    } else {
        const ll D = B * B - 4LL * A * C;
        const ld d = D;
        if (D < 0) {
            return outln(0);
        } else if (D == 0) {
            outln(1);
            outln((-b / (2 * a)).to_double());
            return 0;
        } else {
            const ld s = sqrt(d);
            outln(2);
            ld x1 = (-b + s) / (2 * a);
            ld x2 = (-b - s) / (2 * a);
            if (x1 > x2) { std::swap(x1, x2); }
            outln(x1.to_double());
            outln(x2.to_double());
            return 0;
        }
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード