結果
問題 | No.2624 Prediction by Average |
ユーザー |
![]() |
提出日時 | 2024-02-09 21:47:48 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 5,225 bytes |
コンパイル時間 | 2,528 ms |
コンパイル使用メモリ | 252,108 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-09-28 15:03:03 |
合計ジャッジ時間 | 3,020 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 5 |
ソースコード
#if __INCLUDE_LEVEL__ == 0#include __BASE_FILE__namespace {void solve() {i64 n, s;scan(n);{double x;scan(x);x *= 1000;s = static_cast<i64>(std::round(x));}i64 ans = 0;for (i64 i = 0; i <= n;) {if (i == 1000) {ans += n - i + 1;break;} else {ans += div_ceil(i * s, i64{1000}) * 1000 < i * (s + 1);++i;}}print(ans);}// [n*s/1000, n*(s+1)/1000) が整数を含む// 1000<=n なら} // namespaceint main() {std::ios::sync_with_stdio(false);std::cin.tie(nullptr);int t;scan(t);while (t--) {solve();}}#else // __INCLUDE_LEVEL__#include <bits/stdc++.h>template <std::signed_integral T>constexpr auto div_floor(T x, T y) {return x / y - ((x ^ y) < 0 && x % y);}template <std::signed_integral T>constexpr auto div_ceil(T x, T y) {return x / y + (0 <= (x ^ y) && x % y);}template <class T, class U = T>bool chmin(T& x, U&& y) {return y < x && (x = std::forward<U>(y), true);}template <class T, class U = T>bool chmax(T& x, U&& y) {return x < y && (x = std::forward<U>(y), true);}template <std::signed_integral T = int>T inf() {T ret;std::memset(&ret, 0x3f, sizeof(ret));return ret;}template <std::floating_point T>T inf() {return std::numeric_limits<T>::infinity();}template <class T>concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;template <class T>concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;namespace std {istream& operator>>(istream& is, Range auto&& r) {for (auto&& e : r) {is >> e;}return is;}istream& operator>>(istream& is, Tuple auto&& t) {return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);}ostream& operator<<(ostream& os, Range auto&& r) {for (string_view sep = ""; auto&& e : r) {os << exchange(sep, " ") << e;}return os;}ostream& operator<<(ostream& os, Tuple auto&& t) {const auto f = [&](auto&... xs) -> ostream& {[[maybe_unused]] string_view sep = "";((os << exchange(sep, " ") << xs), ...);return os;};return apply(f, t);}} // namespace std#define DEF_INC_OR_DEC(op) \auto& operator op(Range auto&& r) { \for (auto&& e : r) { \op e; \} \return r; \} \auto& operator op(Tuple auto&& t) { \std::apply([](auto&... xs) { (op xs, ...); }, t); \return t; \}DEF_INC_OR_DEC(++)DEF_INC_OR_DEC(--)#undef DEF_INC_OR_DECvoid scan(auto&&... xs) { std::cin >> std::tie(xs...); }void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }#define FWD(...) static_cast<decltype(__VA_ARGS__)&&>(__VA_ARGS__)template <class F>class fix {public:explicit fix(F f) : f_(std::move(f)) {}decltype(auto) operator()(auto&&... xs) const { return f_(std::ref(*this), FWD(xs)...); }private:F f_;};template <class T>concept LambdaExpr = std::is_placeholder_v<std::remove_cvref_t<T>> != 0 ||std::is_bind_expression_v<std::remove_cvref_t<T>>;auto operator++(LambdaExpr auto&& x, int) {return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)++; }, FWD(x));}auto operator--(LambdaExpr auto&& x, int) {return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)--; }, FWD(x));}#define DEF_UNARY_OP(op) \auto operator op(LambdaExpr auto&& x) { \return std::bind([](auto&& x) -> decltype(auto) { return op FWD(x); }, FWD(x)); \}DEF_UNARY_OP(++)DEF_UNARY_OP(--)DEF_UNARY_OP(+)DEF_UNARY_OP(-)DEF_UNARY_OP(~)DEF_UNARY_OP(!)DEF_UNARY_OP(*)DEF_UNARY_OP(&)#undef DEF_UNARY_OP#define DEF_BINARY_OP(op) \template <class T1, class T2> \requires LambdaExpr<T1> || LambdaExpr<T2> \auto operator op(T1&& x, T2&& y) { \return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x) op FWD(y); }, \FWD(x), FWD(y)); \}DEF_BINARY_OP(+=)DEF_BINARY_OP(-=)DEF_BINARY_OP(*=)DEF_BINARY_OP(/=)DEF_BINARY_OP(%=)DEF_BINARY_OP(^=)DEF_BINARY_OP(&=)DEF_BINARY_OP(|=)DEF_BINARY_OP(<<=)DEF_BINARY_OP(>>=)DEF_BINARY_OP(+)DEF_BINARY_OP(-)DEF_BINARY_OP(*)DEF_BINARY_OP(/)DEF_BINARY_OP(%)DEF_BINARY_OP(^)DEF_BINARY_OP(&)DEF_BINARY_OP(|)DEF_BINARY_OP(<<)DEF_BINARY_OP(>>)DEF_BINARY_OP(==)DEF_BINARY_OP(!=)DEF_BINARY_OP(<)DEF_BINARY_OP(>)DEF_BINARY_OP(<=)DEF_BINARY_OP(>=)DEF_BINARY_OP(&&)DEF_BINARY_OP(||)#undef DEF_BINARY_OPtemplate <class T1, class T2>requires LambdaExpr<T1> || LambdaExpr<T2>auto at(T1&& x, T2&& y) {return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x)[FWD(y)]; }, FWD(x),FWD(y));}template <int I>auto get(LambdaExpr auto&& x) {return std::bind([](auto&& x) -> decltype(auto) { return std::get<I>(FWD(x)); }, FWD(x));}inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }inline auto rep(int n) { return rep(0, n); }inline auto rep1(int l, int r) { return rep(l, r + 1); }inline auto rep1(int n) { return rep(1, n + 1); }using namespace std::literals;using namespace std::placeholders;namespace ranges = std::ranges;namespace views = std::views;using i64 = std::int64_t;#endif // __INCLUDE_LEVEL__