제출 #255965

#제출 시각아이디문제언어결과실행 시간메모리
255965KoD철인 이종 경기 (APIO18_duathlon)C++17
0 / 100
1 ms512 KiB
#line 1 "main.cpp" /** * @title Template */ #include <iostream> #include <algorithm> #include <utility> #include <numeric> #include <vector> #include <array> #include <queue> #include <cassert> #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 = typename std::decay<T>::type::reverse_iterator; 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: private Func { explicit constexpr fix_point(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) make_fix_point(Func &&func) { return fix_point<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; assert(N <= 50 && M <= 100); std::vector<std::vector<i32>> base_graph(N); for (auto i: range(0, M)) { i32 u, v; std::cin >> u >> v; --u; --v; base_graph[u].push_back(v); base_graph[v].push_back(u); } i32 ans = 0; for (auto S: range(0, N)) { for (auto F: range(0, N)) { if (S == F) continue; std::vector<std::vector<i32>> graph(N + 1); for (auto i: range(0, N)) { graph[i] = base_graph[i]; } graph[S].push_back(N); graph[F].push_back(N); graph[N].push_back(S); graph[N].push_back(F); std::vector<i32> parent(N + 1, -1), dist(N + 1, inf32); std::queue<i32> que; std::queue<std::pair<i32, i32>> cand; que.emplace(N); dist[N] = 0; while (!que.empty()) { i32 u = que.front(); que.pop(); for (auto v: graph[u]) { if (chmin(dist[v], dist[u] + 1)) { parent[v] = u; que.push(v); } else { cand.emplace(u, v); } } } while (!cand.empty()) { auto [u, v] = cand.front(); cand.pop(); if (u == S || u == F || u == N) { continue; } if (dist[u] < dist[v]) { std::swap(u, v); } i32 du = dist[u]; while (du > dist[v]) { u = parent[u]; --du; } while (u != v) { u = parent[u]; v = parent[v]; } if (u == N) { ++ans; } } } } std::cout << ans << '\n'; return 0; }

컴파일 시 표준 에러 (stderr) 메시지

main.cpp: In function 'int main()':
main.cpp:33:13: warning: unused variable 'i' [-Wunused-variable]
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...