結果
問題 | No.1236 長針と短針 |
ユーザー | r1933 |
提出日時 | 2020-09-26 12:36:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,359 bytes |
コンパイル時間 | 2,509 ms |
コンパイル使用メモリ | 210,764 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-28 23:11:04 |
合計ジャッジ時間 | 3,437 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | WA | - |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | WA | - |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | WA | - |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | WA | - |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 2 ms
5,376 KB |
ソースコード
#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 &initValue, size_t sz) { return vector<T>(sz, initValue); } template <class T, class... Args> inline auto makeVector(const T &initValue, size_t sz, Args... args) { return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, 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 ioinit() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); clog << fixed << setprecision(10); } // }}} End Header // Real {{{ const long double EPS = 1e-10; const long double PI = acos(-1); struct Real { long double x; Real(long double x = 0) : x(x) {} Real(const Real& rhs) { x = rhs.x; } Real operator+(const Real& rhs) const { return Real(x + rhs.x); } Real& operator+=(const Real& rhs) { return x += rhs.x, *this; } Real operator-(const Real& rhs) const { return Real(x - rhs.x); } Real& operator-=(const Real& rhs) { return x -= rhs.x, *this; } Real operator*(const Real& rhs) const { return Real(x * rhs.x); } Real& operator*=(const Real& rhs) { return x *= rhs.x, *this; } Real operator/(const Real& rhs) const { return Real(x / rhs.x); } Real& operator/=(const Real& rhs) { return x /= rhs.x, *this; } Real operator-() const { return Real(-x); } Real& operator++() { return ++x, *this; } Real& operator--() { return --x, *this; } Real operator++(int) { Real tmp(x); return ++x, tmp; } Real operator--(int) { Real tmp(x); return --x, tmp; } bool operator==(const Real& rhs) const { return fabs(x - rhs.x) < EPS; } bool operator!=(const Real& rhs) const { return !(*this == rhs); } bool operator<(const Real& rhs) const { return (*this == rhs) ? false : x < rhs.x; } bool operator>(const Real& rhs) const { return (*this == rhs) ? false : x > rhs.x; } bool operator<=(const Real& rhs) const { return (*this == rhs) ? true : x < rhs.x; } bool operator>=(const Real& rhs) const { return (*this == rhs) ? true : x > rhs.x; } template <class T> explicit operator T() const { return static_cast<T>(x); } friend istream& operator>>(istream& is, Real& rhs) { is >> rhs.x; return is; } friend ostream& operator<<(ostream& os, const Real& rhs) { os << rhs.x; return os; } friend Real pow(const Real& n, const Real& p) { return pow(n.x, p.x); } friend Real pow(Real n, intmax_t p) { Real ret = 1; for (; p > 0; p >>= 1) { if (p & 1) ret *= n; n *= n; } return ret; } friend Real abs(const Real& rhs) { return abs(rhs.x); } friend Real sin(const Real& rhs) { return sin(rhs.x); } friend Real cos(const Real& rhs) { return cos(rhs.x); } friend Real tan(const Real& rhs) { return tan(rhs.x); } friend Real asin(const Real& rhs) { return asin(rhs.x); } friend Real acos(const Real& rhs) { return acos(rhs.x); } friend Real atan(const Real& rhs) { return atan(rhs.x); } friend Real atan2(const Real& lhs, const Real& rhs) { return atan2(lhs.x, rhs.x); } friend Real sqrt(const Real& rhs) { return sqrt(rhs.x); } friend Real ceil(const Real& rhs) { return ceil(rhs.x); } friend Real floor(const Real& rhs) { return floor(rhs.x); } friend Real round(const Real& rhs) { return round(rhs.x); } }; using real_t = Real; real_t operator""_r(long double value) { return value; }; // }}} signed main() { ioinit(); var(real_t, A, B); if (B == 0.0_r) { return output(0), 0; } const real_t ang_A = 30.0_r * A + 0.5_r * B; const real_t ang_B = 6.0_r * B; intmax_t res; if (ang_A >= ang_B) { res = intmax_t((ang_A - ang_B) * 60 / 5.5); } else { res = intmax_t((360.0_r - ang_B + ang_A) * 60 / 5.5); } output(res); return 0; }