結果
問題 | No.1898 Battle and Exchange |
ユーザー | noshi91 |
提出日時 | 2023-12-01 21:34:59 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,160 ms / 5,000 ms |
コード長 | 5,075 bytes |
コンパイル時間 | 1,586 ms |
コンパイル使用メモリ | 108,044 KB |
実行使用メモリ | 17,428 KB |
最終ジャッジ日時 | 2024-09-26 15:55:14 |
合計ジャッジ時間 | 22,449 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 | AC | 3 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 3 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 10 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 3 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 3 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 10 ms
5,376 KB |
testcase_18 | AC | 47 ms
6,016 KB |
testcase_19 | AC | 89 ms
7,552 KB |
testcase_20 | AC | 53 ms
7,936 KB |
testcase_21 | AC | 260 ms
14,848 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 3 ms
5,376 KB |
testcase_25 | AC | 3 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 4 ms
5,376 KB |
testcase_28 | AC | 5 ms
5,376 KB |
testcase_29 | AC | 10 ms
5,376 KB |
testcase_30 | AC | 3 ms
5,376 KB |
testcase_31 | AC | 2 ms
5,376 KB |
testcase_32 | AC | 75 ms
7,552 KB |
testcase_33 | AC | 162 ms
11,008 KB |
testcase_34 | AC | 53 ms
6,912 KB |
testcase_35 | AC | 103 ms
9,088 KB |
testcase_36 | AC | 82 ms
8,448 KB |
testcase_37 | AC | 30 ms
5,376 KB |
testcase_38 | AC | 1,160 ms
17,428 KB |
testcase_39 | AC | 192 ms
14,912 KB |
testcase_40 | AC | 800 ms
16,088 KB |
testcase_41 | AC | 141 ms
14,116 KB |
testcase_42 | AC | 12 ms
5,376 KB |
testcase_43 | AC | 111 ms
11,648 KB |
testcase_44 | AC | 2 ms
5,376 KB |
testcase_45 | AC | 23 ms
5,376 KB |
testcase_46 | AC | 128 ms
7,296 KB |
testcase_47 | AC | 16 ms
5,376 KB |
testcase_48 | AC | 17 ms
5,376 KB |
testcase_49 | AC | 5 ms
5,376 KB |
testcase_50 | AC | 5 ms
5,376 KB |
testcase_51 | AC | 5 ms
5,376 KB |
testcase_52 | AC | 6 ms
5,376 KB |
testcase_53 | AC | 27 ms
5,504 KB |
testcase_54 | AC | 35 ms
6,016 KB |
testcase_55 | AC | 63 ms
6,272 KB |
testcase_56 | AC | 38 ms
6,272 KB |
testcase_57 | AC | 970 ms
16,000 KB |
testcase_58 | AC | 491 ms
16,128 KB |
testcase_59 | AC | 344 ms
16,000 KB |
testcase_60 | AC | 548 ms
16,000 KB |
ソースコード
//#define NDEBUG #pragma warning(disable : 4146) #include <algorithm> #include <cassert> #include <cstddef> #include <cstdint> #include <iomanip> #include <ios> #include <iostream> #include <utility> #include <vector> #include<tuple> namespace n91 { using i32 = std::int32_t; using i64 = std::int64_t; using u32 = std::uint32_t; using u64 = std::uint64_t; using isize = std::ptrdiff_t; using usize = std::size_t; using f64 = double; struct rep { struct itr { usize i; constexpr itr(const usize i) noexcept : i(i) {} void operator++() noexcept { ++i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; const itr f, l; constexpr rep(const usize f, const usize l) noexcept : f(std::min(f, l)), l(l) {} constexpr auto begin() const noexcept { return f; } constexpr auto end() const noexcept { return l; } }; struct revrep { struct itr { usize i; constexpr itr(const usize i) noexcept : i(i) {} void operator++() noexcept { --i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; const itr f, l; constexpr revrep(const usize f, const usize l) noexcept : f(l - 1), l(std::min(f, l) - 1) {} constexpr auto begin() const noexcept { return f; } constexpr auto end() const noexcept { return l; } }; template <class T> auto md_vec(const usize n, const T &value) { return std::vector<T>(n, value); } template <class... Args> auto md_vec(const usize n, Args... args) { return std::vector<decltype(md_vec(args...))>(n, md_vec(args...)); } template <class T> constexpr T difference(const T &a, const T &b) noexcept { return a < b ? b - a : a - b; } template <class T> void chmin(T &a, const T &b) noexcept { if (b < a) a = b; } template <class T> void chmax(T &a, const T &b) noexcept { if (a < b) a = b; } template <class F> class rec_lambda { F f; public: rec_lambda(F &&f_) : f(std::forward<F>(f_)) {} template <class... Args> auto operator()(Args &&... args) const { return f(*this, std::forward<Args>(args)...); } }; template <class T> T scan() { T ret; std::cin >> ret; return ret; } constexpr char eoln = '\n'; i64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0); } i64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); } #ifdef N91_LOCAL #define OJ_LOCAL(a, b) b #else #define OJ_LOCAL(a, b) a #endif } // namespace n91 #include <cassert> #include <cstdint> namespace binary_search_impl { using i64 = std::int64_t; template <class F> i64 binary_search(F f, i64 left, i64 right) { assert(left <= right); while (left != right) { const i64 mid = left + (right - left) / 2; if (f(mid)) { left = mid + 1; } else { right = mid; } } return left; } } // namespace binary_search_impl // first false using binary_search_impl::binary_search; #include <array> #include <queue> namespace n91 { void main_() { const usize n = scan<usize>(); const usize m = scan<usize>(); auto g = md_vec(2 * n, 0, usize()); for (const usize i : rep(0, m)) { usize u = scan<usize>() - 1; usize v = scan<usize>() - 1; std::tie(u, v) = std::minmax({u, v}); if (u == 0) { g[0].push_back(v); g[v].push_back(n); } else { g[u].push_back(v); g[v].push_back(u); } } for (const usize i : rep(1, n)) { g[i].push_back(n + i); } std::vector<std::array<u32, 4>> c(2 * n); for (const usize i : rep(0, n)) { for (const usize j : rep(0, 3)) { std::cin >> c[i][j]; } std::sort(c[i].begin(), c[i].end() - 1); c[i][3] = c[i][2]; c[n + i] = c[i]; c[n + i][3] = c[n + i][1]; } const auto fail = [&](u32 x) -> bool { struct node { usize v; u32 w; bool operator<(const node &r) const { return w > r.w; } }; std::priority_queue<node> que; std::vector<bool> visited(2 * n, false); const auto push = [&](const usize v) { if (!visited[v]) { visited[v] = true; que.push({v, c[v][0] + c[v][1] + c[v][2]}); } }; std::array<u32, 3> d = {x, 1, 1}; push(0); while (!que.empty()) { const auto [v, w] = que.top(); que.pop(); if (d[0] + d[1] + d[2] <= w) { return true; } if (v == n - 1) { return false; } { u32 t = c[v][3]; for (auto &e : d) { std::tie(t, e) = std::minmax({t, e}); } } for (const usize u : g[v]) { push(u); } } assert(false); return true; }; const u32 res = binary_search(fail, 1, 3e8); std::cout << res << " " << 1 << " " << 1 << eoln; } } // namespace n91 int main() { //* std::ios::sync_with_stdio(false); std::cin.tie(nullptr); //*/ std::cout << std::fixed << std::setprecision(20); n91::main_(); return 0; }