結果
問題 | No.2776 Bigger image |
ユーザー |
👑 ![]() |
提出日時 | 2024-06-07 21:35:38 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,451 bytes |
コンパイル時間 | 2,866 ms |
コンパイル使用メモリ | 246,660 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-07 21:35:42 |
合計ジャッジ時間 | 3,614 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 1 ms
6,944 KB |
testcase_11 | AC | 2 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,940 KB |
testcase_17 | AC | 2 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 2 ms
6,940 KB |
testcase_24 | AC | 2 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,944 KB |
testcase_28 | AC | 2 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; template <typename T = long long> struct Rational { T num, den; Rational() : num(0), den(1) {} Rational(const T num, const T den = 1) : num(num), den(den) { // assert(den != 0); reduce(); } template <typename Real = long double> Real to_real() const { return static_cast<Real>(num) / den; } Rational& operator+=(const Rational& x) { const T g = std::gcd(den, x.den); num = num * (x.den / g) + x.num * (den / g); den *= x.den / g; reduce(); return *this; } Rational& operator-=(const Rational& x) { return *this += -x; } Rational& operator*=(const Rational& x) { const T g1 = std::gcd(num, x.den), g2 = std::gcd(den, x.num); num = (num / g1) * (x.num / g2); den = (den / g2) * (x.den / g1); reduce(); return *this; } Rational& operator/=(const Rational& x) { return *this *= Rational(x.den, x.num); } auto operator<=>(const Rational& x) const { return num * x.den <=> x.num * den; } bool operator==(const Rational& x) const { return num == x.num && den == x.den; } Rational& operator++() { if ((num += den) == 0) den = 1; return *this; } Rational operator++(int) { const Rational res = *this; ++*this; return res; } Rational& operator--() { if ((num -= den) == 0) den = 1; return *this; } Rational operator--(int) { const Rational res = *this; --*this; return res; } Rational operator+() const { return *this; } Rational operator-() const { return Rational(-num, den); } Rational operator+(const Rational& x) const { return Rational(*this) += x; } Rational operator-(const Rational& x) const { return Rational(*this) -= x; } Rational operator*(const Rational& x) const { return Rational(*this) *= x; } Rational operator/(const Rational& x) const { return Rational(*this) /= x; } friend std::ostream& operator<<(std::ostream& os, const Rational& x) { if (x.den == 1) return os << x.num; return os << x.num << '/' << x.den; } private: void reduce() { const T g = std::gcd(num, den); num /= g; den /= g; if (den < 0) { num = -num; den = -den; } } }; using rational = Rational<ll>; rational area(const int a, const int b, const int h, const int w) { return h * b <= w * a ? rational(ll{h} * h * b, a) : rational(ll{w} * a * w, b); } int main() { int a, b, h, w; cin >> a >> b >> h >> w; const rational x = area(a, b, h, w), y = area(b, a, h, w); if (x > y) { cout << "Non-rotating\n"; } else if (x < y) { cout << "Rotating\n"; } else { cout << "Same\n"; } return 0; }