結果
問題 | No.1223 I hate Golf |
ユーザー |
|
提出日時 | 2020-09-11 21:27:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 5,388 bytes |
コンパイル時間 | 2,255 ms |
コンパイル使用メモリ | 195,224 KB |
最終ジャッジ日時 | 2025-01-14 09:58:17 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
ソースコード
#include <bits/stdc++.h>using ll = long long;using uint = unsigned int;using ull = unsigned long long;using ld = long double;template<typename T> using max_heap = std::priority_queue<T>;template<typename T> using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;constexpr int popcount(const ull v) { return v ? __builtin_popcountll(v) : 0; }constexpr int log2p1(const ull v) { return v ? 64 - __builtin_clzll(v) : 0; }constexpr int lsbp1(const ull v) { return __builtin_ffsll(v); }constexpr int clog(const ull v) { return v ? log2p1(v - 1) : 0; }constexpr ull ceil2(const ull v) { return 1ULL << clog(v); }constexpr ull floor2(const ull v) { return v ? (1ULL << (log2p1(v) - 1)) : 0ULL; }constexpr bool btest(const ull mask, const int ind) { return (mask >> ind) & 1ULL; }template<typename T> void bset(T& mask, const int ind) { mask |= ((T)1 << ind); }template<typename T> void breset(T& mask, const int ind) { mask &= ~((T)1 << ind); }template<typename T> void bflip(T& mask, const int ind) { mask ^= ((T)1 << ind); }template<typename T> void bset(T& mask, const int ind, const bool b) { (b ? bset(mask, ind) : breset(mask, 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); }template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};template<typename T> constexpr T TEN(const int n) { return n == 0 ? T{1} : TEN<T>(n - 1) * T{10}; }template<typename F> struct fix : F{fix(F&& f) : F{std::forward<F>(f)} {}template<typename... Args> auto operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }};template<typename T, int n, int i = 0>auto nd_array(int const (&szs)[n], const T x = T{}){if constexpr (i == n) {return x;} else {return std::vector(szs[i], nd_array<T, n, i + 1>(szs, x));}}class printer{public:printer(std::ostream& os_ = std::cout) : os{os_} { os << std::fixed << std::setprecision(15); }template<typename T> int operator()(const T& v) { return os << v, 0; }template<typename T> int operator()(const std::vector<T>& vs){for (int i = 0; i < (int)vs.size(); i++) { os << (i ? " " : ""), this->operator()(vs[i]); }return 0;}template<typename T> int operator()(const std::vector<std::vector<T>>& vss){for (int i = 0; i < (int)vss.size(); i++) { os << (0 <= i or i + 1 < (int)vss.size() ? "\n" : ""), this->operator()(vss[i]); }return 0;}template<typename T, typename... Args> int operator()(const T& v, const Args&... args) { return this->operator()(v), os << ' ', this->operator()(args...), 0; }template<typename... Args> int ln(const Args&... args) { return this->operator()(args...), os << '\n', 0; }template<typename... Args> int el(const Args&... args) { return this->operator()(args...), os << std::endl, 0; }template<typename... Args> int fmt(const std::string& s, const Args&... args) { return rec(s, 0, args...); }private:int rec(const std::string& s, int index) { return os << s.substr(index, s.size()), 0; }template<typename T, typename... Args> int rec(const std::string& s, int index, const T& v, const Args&... args) { return index == s.size() ? 0 :s[index] == '%' ? (this->operator()(v), rec(s, index + 1, args...)) : (os << s[index], rec(s, index + 1, v, args...)); }std::ostream& os;};printer out;class scanner{public:scanner(std::istream& is_ = std::cin) : is{is_} { is.tie(nullptr), std::ios::sync_with_stdio(false); }template<typename T> T val(){T v;return is >> v, v;}template<typename T> T val(const T offset) { return val<T>() - offset; }template<typename T> std::vector<T> vec(const int n){std::vector<T> vs(n);for (auto& v : vs) { v = val<T>(); }return vs;}template<typename T> std::vector<T> vec(const int n, const T offset){std::vector<T> vs(n);for (auto& v : vs) { v = val<T>(offset); }return vs;}template<typename T> std::vector<std::vector<T>> vvec(const int n0, const int n1){std::vector<std::vector<T>> vss(n0);for (auto& vs : vss) { vs = vec<T>(n1); }return vss;}template<typename T> std::vector<std::vector<T>> vvec(const int n0, const int n1, const T offset){std::vector<std::vector<T>> vss(n0);for (auto& vs : vss) { vs = vec<T>(n1, offset); }return vss;}template<typename... Args> auto tup() { return std::tuple<std::decay_t<Args>...>{val<Args>()...}; }template<typename... Args> auto tup(const Args&... offsets) { return std::tuple<std::decay_t<Args>...>{val<Args>(offsets)...}; }private:std::istream& is;};scanner in;# define SHOW(...) static_cast<void>(0)int main(){const auto [N, K, T] = in.tup<ll, ll, ll>();out.ln(std::abs(N) <= K * T ? "Yes" : "No");return 0;}