//#define NDEBUG #include #include #include namespace n91 { using i8 = std::int_least8_t; using i32 = std::int_least32_t; using i64 = std::int_least64_t; using u8 = std::uint_least8_t; using u32 = std::uint_least32_t; using u64 = std::uint_least64_t; using isize = std::ptrdiff_t; using usize = std::size_t; class rep { const usize f, l; public: class itr { friend rep; usize i; constexpr itr(const usize x) noexcept : i(x) {} public: void operator++() noexcept { ++i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; constexpr rep(const usize first, const usize last) noexcept : f(first), l(last) {} constexpr itr begin() const noexcept { return itr(f); } constexpr itr end() const noexcept { return itr(l); } }; class revrep { const usize f, l; public: class itr { friend revrep; usize i; constexpr itr(usize x) noexcept : i(x) {} public: void operator++() noexcept { --i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {} constexpr itr begin() const noexcept { return itr(l); } constexpr itr end() const noexcept { return itr(f); } }; template using vec_alias = std::vector; template auto md_vec(const usize n, const T &value) { return std::vector(n, value); } template auto md_vec(const usize n, Args... args) { return std::vector(n, md_vec(args...)); } template constexpr T difference(const T &a, const T &b) { return a < b ? b - a : a - b; } } // namespace n91 #ifndef NIMI_GRAPH #define NIMI_GRAPH #include namespace nimi { struct base_edge { int from; int to; base_edge(int from, int to) : from(from), to(to) {} }; template struct edge : public base_edge { T val; edge(int from, int to, T v) : base_edge(from, to), val(v) {} }; template <> struct edge : public base_edge { edge(int from, int to) : base_edge(from, to) {} }; template struct maxflow_edge : public base_edge { C cap; std::size_t rev; maxflow_edge(int from, int to, C cap, std::size_t rev) : base_edge(from, to), cap(cap), rev(rev) {} }; template struct directed_graph : public std::vector>> { directed_graph(std::size_t n) : std::vector>>(n) {} void add_edge(const edge &e) { this->at(e.from).push_back(e); } }; template struct undirected_graph : public std::vector>> { undirected_graph(std::size_t n) : std::vector>>(n) {} void add_edge(const edge &e) { this->at(e.from).push_back(e); edge re = e; std::swap(re.from, re.to); this->at(e.to).push_back(re); } }; template struct maxflow_graph : public std::vector>> { maxflow_graph(std::size_t n) : std::vector>>(n) {} void add_edge(int from, int to, C cap, std::size_t rev_cap = 0) { this->at(from).push_back( maxflow_edge(from, to, cap, this->at(to).size())); this->at(to).push_back( maxflow_edge(to, from, rev_cap, this->at(from).size() - 1)); } }; } // namespace nimi #endif #ifndef NIMI_GRAPH_SP_DIJKSTRA #define NIMI_GRAPH_SP_DIJKSTRA #include #include #include namespace nimi { template std::vector dijkstra(const nimi::directed_graph &g, std::size_t s) { const T INF = std::numeric_limits::max(); const T ZERO = T(); const std::size_t n = g.size(); struct node { T dist; std::size_t vertex; node(T d, std::size_t v) : dist(d), vertex(v) {} bool operator<(const node &n) const { return n.dist < dist; } }; std::vector dist(n, INF); std::priority_queue que; dist[s] = ZERO; que.emplace(dist[s], s); while (!que.empty()) { node p = que.top(); T d = p.dist; std::size_t v = p.vertex; que.pop(); if (dist[v] < d) continue; for (const auto &e : g[v]) { if (dist[v] + e.val < dist[e.to]) { dist[e.to] = dist[v] + e.val; que.emplace(dist[e.to], e.to); } } } return std::move(dist); } } // namespace nimi #endif #include #include #include #include namespace n91 { void main_() { usize n, m; std::cin >> n >> m; nimi::directed_graph g(n); while (m--) { usize p, q; std::cin >> p >> q; --p; --q; g.add_edge(nimi::edge(p, q, 1)); g.add_edge(nimi::edge(q, p, 1)); } usize q; std::cin >> q; while (q--) { usize a; std::cin >> a; --a; auto d = nimi::dijkstra(g, a); usize cnt = n - 1; for (auto &e : d) { if (e == std::numeric_limits::max()) { --cnt; e = 0; } } usize max = *std::max_element(d.begin(), d.end()); usize days = 0; while (max > 1) { max = (max + 1) / 2; } std::cout << cnt << " " << days << std::endl; } } } // namespace n91 int main() { n91::main_(); return 0; }