結果
問題 | No.1194 Replace |
ユーザー | KoD |
提出日時 | 2020-08-22 15:05:05 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 5,226 bytes |
コンパイル時間 | 1,148 ms |
コンパイル使用メモリ | 92,240 KB |
実行使用メモリ | 814,204 KB |
最終ジャッジ日時 | 2024-10-15 09:22:19 |
合計ジャッジ時間 | 4,672 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | RE | - |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | MLE | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
ソースコード
#line 1 "main.cpp" /** * @title Template */ #include <iostream> #include <algorithm> #include <utility> #include <numeric> #include <vector> #include <array> #include <cassert> #include <stack> #line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp" template <class T, class U> constexpr bool chmin(T &lhs, const U &rhs) { if (lhs > rhs) { lhs = rhs; return true; } return false; } template <class T, class U> constexpr bool chmax(T &lhs, const U &rhs) { if (lhs < rhs) { lhs = rhs; return true; } return false; } /** * @title Chmin/Chmax */ #line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp" #line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp" class range { public: class iterator { private: int64_t M_position; public: constexpr iterator(int64_t position) noexcept: M_position(position) { } constexpr void operator ++ () noexcept { ++M_position; } constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; } constexpr int64_t operator * () const noexcept { return M_position; } }; class reverse_iterator { private: int64_t M_position; public: constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { } constexpr void operator ++ () noexcept { --M_position; } constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; } constexpr int64_t operator * () const noexcept { return M_position; } }; private: const iterator M_first, M_last; public: constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { } constexpr iterator begin() const noexcept { return M_first; } constexpr iterator end() const noexcept { return M_last; } constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } }; /** * @title Range */ #line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp" #include <type_traits> #include <iterator> #line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp" template <class T> class rev_impl { public: using iterator = decltype(std::rbegin(std::declval<T>())); private: const iterator M_begin; const iterator M_end; public: constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { } constexpr iterator begin() const noexcept { return M_begin; } constexpr iterator end() const noexcept { return M_end; } }; template <class T> constexpr decltype(auto) rev(T &&cont) { return rev_impl<T>(std::forward<T>(cont)); } /** * @title Reverser */ #line 2 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp" #line 4 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp" template <class Func> struct fix_point_impl: private Func { explicit constexpr fix_point_impl(Func &&func): Func(std::forward<Func>(func)) { } template <class... Args> constexpr decltype(auto) operator () (Args &&... args) const { return Func::operator()(*this, std::forward<Args>(args)...); } }; template <class Func> constexpr decltype(auto) fix_point(Func &&func) { return fix_point_impl<Func>(std::forward<Func>(func)); } /** * @title Lambda Recursion */ #line 19 "main.cpp" using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; constexpr i32 inf32 = (i32(1) << 30) - 1; constexpr i64 inf64 = (i64(1) << 62) - 1; int main() { i32 N, M; std::cin >> N >> M; std::vector<std::vector<i32>> graph(N), revgraph(N); for (auto i: range(0, M)) { i32 u, v; std::cin >> u >> v; --u; --v; graph[u].push_back(v); revgraph[v].push_back(u); } std::vector<bool> visited(N); std::stack<i32> stack; const auto tag = fix_point([&](auto dfs, const i32 u) -> void { if (visited[u]) { return; } visited[u] = true; for (auto v: graph[u]) { dfs(v); } stack.push(u); }); for (auto i: range(0, N)) { tag(i); } std::fill(visited.begin(), visited.end(), false); std::vector<std::vector<i32>> group; const auto dec = fix_point([&](auto dfs, const i32 u) -> void { if (visited[u]) { return; } visited[u] = true; group.back().push_back(u); for (auto v: revgraph[u]) { dfs(v); } }); while (!stack.empty()) { const auto u = stack.top(); stack.pop(); if (!visited[u]) { group.push_back({ }); dec(u); } } const i32 G = group.size(); std::vector<std::vector<i32>> newgraph(G); std::vector<i32> belong(N); for (auto i: range(0, G)) { for (auto x: group[i]) { belong[x] = i; } } for (auto i: range(0, N)) { for (auto v: graph[i]) { newgraph[belong[i]].push_back(belong[v]); } } i64 ans = 0; std::vector<i32> max(G); for (auto i: rev(range(0, G))) { for (auto x: group[i]) { chmax(max[i], x); } for (auto j: newgraph[i]) { chmax(max[i], max[j]); } ans += (i64) max[i] * group[i].size(); } std::cout << ans + N << '\n'; return 0; }