結果

問題 No.1342 Calculation
ユーザー r1933r1933
提出日時 2021-01-16 14:30:44
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 7,546 bytes
コンパイル時間 2,485 ms
コンパイル使用メモリ 212,344 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-05-05 16:53:41
合計ジャッジ時間 2,632 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream &is, Container &vs) {
    for (auto &v: vs) is >> v;
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << " ";
    output(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream &os, const Container &vs) {
    static constexpr const char *delim[] = {" ", ""};
    for (auto it = begin(vs); it != end(vs); ++it) {
        os << delim[it == begin(vs)] << *it;
    }
    return os;
}

template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") {
    for (auto it = Begin; it != End; ++it) {
        cout << ((it == Begin) ? "" : delim) << *it;
    }
    cout << last;
}

template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
    return vector<T>(sz, init_value);
}

template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}

void operator|=(vector<bool>::reference lhs, const bool rhs) {
    lhs = lhs | rhs;
}

void ioinit() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
    clog << fixed << setprecision(10);
}
// }}} End Header

// Fraction {{{
class Fraction {
private:
    constexpr static inline intmax_t gcd(intmax_t a, intmax_t b) {
        return b == 0 ? abs(a) : gcd(b, a % b);
    }

public:
    intmax_t numerator, denominator;

    Fraction() {
        numerator = 0;
        denominator = 1;
    }

    Fraction(intmax_t n, intmax_t d) {
        if (n == 0) {
            numerator = 0;
            denominator = 1;
        } else {
            int sign = ((n < 0) == (d < 0) ? 1 : -1);
            n = abs(n), d = abs(d);

            intmax_t g = gcd(n, d);
            numerator = sign * n / g;
            denominator = d / g;
        }
    }

    operator intmax_t() { return numerator / denominator; }
    operator double() { return (double) numerator / denominator; }
};

Fraction operator+(const Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator + rhs.numerator * lhs.denominator,
         lhs.denominator * rhs.denominator
        );
    return ret;
}

Fraction operator+=(Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator + rhs.numerator * lhs.denominator,
         lhs.denominator * rhs.denominator
        );
    lhs = ret;
    return lhs;
}

Fraction operator-(const Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator - rhs.numerator * lhs.denominator,
         lhs.denominator * rhs.denominator
        );
    return ret;
}

Fraction operator-=(Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator - rhs.numerator * lhs.denominator,
         lhs.denominator * rhs.denominator
        );
    lhs = ret;
    return lhs;
}

Fraction operator*(const Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.numerator,
         lhs.denominator * rhs.denominator
        );
    return ret;
}

Fraction operator*=(Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.numerator,
         lhs.denominator * rhs.denominator
        );
    lhs = ret;
    return lhs;
}

Fraction operator/(const Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator,
         lhs.denominator * rhs.numerator
        );
    return ret;
}

Fraction operator/=(Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator,
         lhs.denominator * rhs.numerator
        );
    lhs = ret;
    return lhs;
}

bool operator<(const Fraction &lhs, const Fraction &rhs) {
    const intmax_t lhs_numerator = lhs.numerator * rhs.denominator;
    const intmax_t rhs_numerator = rhs.numerator * lhs.denominator;
    return lhs_numerator < rhs_numerator;
}

bool operator>(const Fraction &lhs, const Fraction &rhs) { return rhs < lhs; }

bool operator<=(const Fraction &lhs, const Fraction &rhs) { return !(lhs > rhs); }

bool operator>=(const Fraction &lhs, const Fraction &rhs) { return !(lhs < rhs); }

bool operator==(const Fraction &lhs, const Fraction &rhs) { return !(lhs < rhs) && !(lhs > rhs); }

bool operator!=(const Fraction &lhs, const Fraction &rhs) { return (lhs < rhs) || (lhs > rhs); }

ostream& operator<<(ostream &os, const Fraction &a) {
    if (a.denominator == 1) {
        os << a.numerator;
    } else {
        os << a.numerator << '/' << a.denominator;
    }
    return os;
}
// }}}

signed main() {
    ioinit();

    Fraction a(19, 47), b(28, 43);
    dump((a + b) * Fraction(1, 27));
    output(((a + b) * Fraction(1, 27)).numerator);
    return 0;
}
0