結果
問題 | No.2643 Many Range Sums Problems |
ユーザー |
![]() |
提出日時 | 2024-02-19 23:19:35 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 520 ms / 8,000 ms |
コード長 | 4,306 bytes |
コンパイル時間 | 2,952 ms |
コンパイル使用メモリ | 260,192 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-09-29 03:02:02 |
合計ジャッジ時間 | 9,388 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 34 |
ソースコード
#if __INCLUDE_LEVEL__ == 0#include __BASE_FILE__namespace {void solve() {int n;i64 K;scan(n, K);std::vector<int> r(n);std::vector<i64> b(n);for (const int i : rep(n)) {scan(r[i], b[i]);}for (const int k : rep(n)) {const bool ans = [&] {std::vector<std::array<i64, 2>> c(n);std::vector<std::array<i64, 2>> s(n + 1);for (const int i : rep(n) | views::reverse) {if (i == k) {c[i] = {0, 1};} else {c[i] = {b[i], 0};}// for (const int j : rep(i + 1, r[i])) {// c[i][0] -= c[j][0];// c[i][1] -= c[j][1];// }if (i != k) {c[i][0] -= s[i + 1][0] - s[r[i]][0];c[i][1] -= s[i + 1][1] - s[r[i]][1];}s[i][0] = c[i][0] + s[i + 1][0];s[i][1] = c[i][1] + s[i + 1][1];}i64 lo = -inf();i64 hi = inf();for (const int i : rep(n)) {// 0 <= c[i][0] + c[i][1] * x <= K// -c[i][0] <= c[i][1] * x <= K - c[i][0]if (c[i][1] == 0) {if (c[i][0] < 0 || K < c[i][0]) {return false;}} else if (0 < c[i][1]) {chmax(lo, div_ceil(-c[i][0], c[i][1]));chmin(hi, div_floor(K - c[i][0], c[i][1]));} else if (c[i][1] < 0) {chmax(lo, div_ceil(K - c[i][0], c[i][1]));chmin(hi, div_floor(-c[i][0], c[i][1]));} else {std::abort();}}return lo <= hi && (lo <= K || 0 <= hi);}();print(ans ? "Yes" : "No");}}} // namespaceint main() {std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout << std::setprecision(DBL_DECIMAL_DIG);solve();}#else // __INCLUDE_LEVEL__#include <bits/stdc++.h>constexpr auto div_floor(auto x, auto y) { return x / y - ((x ^ y) < 0 && x % y != 0); }constexpr auto div_ceil(auto x, auto y) { return x / y + (0 <= (x ^ y) && x % y != 0); }constexpr auto floor(auto x, auto y) { return div_floor(x, y) * y; }constexpr auto floor(auto x, auto y, auto z) { return floor(x - z, y) + z; }constexpr auto ceil(auto x, auto y) { return div_ceil(x, y) * y; }constexpr auto ceil(auto x, auto y, auto z) { return ceil(x - z, y) + z; }constexpr auto modulo(auto x, auto y) { return x - floor(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 stdvoid scan(auto&&... xs) { std::cin >> std::tie(xs...); }void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }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), std::forward<decltype(xs)>(xs)...);}private:F f_;};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); }namespace ranges = std::ranges;namespace views = std::views;using i64 = std::int64_t;#endif // __INCLUDE_LEVEL__