結果
問題 | No.812 Change of Class |
ユーザー | noshi91 |
提出日時 | 2019-04-12 21:46:44 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 641 ms / 4,000 ms |
コード長 | 5,334 bytes |
コンパイル時間 | 2,850 ms |
コンパイル使用メモリ | 85,984 KB |
実行使用メモリ | 13,604 KB |
最終ジャッジ日時 | 2023-09-03 01:12:39 |
合計ジャッジ時間 | 14,337 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 86 ms
9,212 KB |
testcase_01 | AC | 14 ms
4,380 KB |
testcase_02 | AC | 47 ms
6,600 KB |
testcase_03 | AC | 101 ms
10,548 KB |
testcase_04 | AC | 89 ms
9,492 KB |
testcase_05 | AC | 627 ms
11,656 KB |
testcase_06 | AC | 513 ms
10,792 KB |
testcase_07 | AC | 5 ms
4,380 KB |
testcase_08 | AC | 3 ms
4,376 KB |
testcase_09 | AC | 559 ms
11,944 KB |
testcase_10 | AC | 587 ms
12,100 KB |
testcase_11 | AC | 21 ms
7,120 KB |
testcase_12 | AC | 351 ms
10,460 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 363 ms
9,084 KB |
testcase_16 | AC | 15 ms
4,380 KB |
testcase_17 | AC | 364 ms
9,428 KB |
testcase_18 | AC | 218 ms
7,596 KB |
testcase_19 | AC | 288 ms
8,332 KB |
testcase_20 | AC | 641 ms
11,456 KB |
testcase_21 | AC | 199 ms
7,300 KB |
testcase_22 | AC | 70 ms
5,280 KB |
testcase_23 | AC | 12 ms
4,376 KB |
testcase_24 | AC | 19 ms
4,376 KB |
testcase_25 | AC | 55 ms
4,932 KB |
testcase_26 | AC | 503 ms
10,324 KB |
testcase_27 | AC | 426 ms
9,552 KB |
testcase_28 | AC | 283 ms
8,324 KB |
testcase_29 | AC | 41 ms
4,392 KB |
testcase_30 | AC | 360 ms
9,248 KB |
testcase_31 | AC | 271 ms
8,168 KB |
testcase_32 | AC | 90 ms
5,628 KB |
testcase_33 | AC | 371 ms
9,776 KB |
testcase_34 | AC | 17 ms
4,380 KB |
testcase_35 | AC | 43 ms
4,540 KB |
testcase_36 | AC | 19 ms
4,380 KB |
testcase_37 | AC | 119 ms
5,952 KB |
testcase_38 | AC | 8 ms
4,660 KB |
testcase_39 | AC | 122 ms
5,636 KB |
testcase_40 | AC | 27 ms
4,380 KB |
testcase_41 | AC | 6 ms
4,640 KB |
testcase_42 | AC | 307 ms
8,400 KB |
testcase_43 | AC | 42 ms
6,732 KB |
testcase_44 | AC | 182 ms
6,884 KB |
testcase_45 | AC | 19 ms
4,380 KB |
testcase_46 | AC | 38 ms
6,804 KB |
testcase_47 | AC | 184 ms
6,964 KB |
testcase_48 | AC | 203 ms
7,756 KB |
testcase_49 | AC | 50 ms
4,488 KB |
testcase_50 | AC | 3 ms
4,376 KB |
testcase_51 | AC | 48 ms
5,156 KB |
testcase_52 | AC | 101 ms
7,064 KB |
testcase_53 | AC | 32 ms
4,376 KB |
testcase_54 | AC | 28 ms
4,376 KB |
testcase_55 | AC | 139 ms
10,136 KB |
testcase_56 | AC | 186 ms
12,464 KB |
testcase_57 | AC | 204 ms
12,848 KB |
testcase_58 | AC | 95 ms
8,032 KB |
testcase_59 | AC | 227 ms
13,604 KB |
testcase_60 | AC | 2 ms
4,376 KB |
testcase_61 | AC | 2 ms
4,376 KB |
testcase_62 | AC | 1 ms
4,380 KB |
ソースコード
//#define NDEBUG #include <cstddef> #include <cstdint> #include <vector> 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 <class T> using vec_alias = std::vector<T>; 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) { return a < b ? b - a : a - b; } } // namespace n91 #ifndef NIMI_GRAPH #define NIMI_GRAPH #include <vector> namespace nimi { struct base_edge { int from; int to; base_edge(int from, int to) : from(from), to(to) {} }; template <class T> struct edge : public base_edge { T val; edge(int from, int to, T v) : base_edge(from, to), val(v) {} }; template <> struct edge<void> : public base_edge { edge(int from, int to) : base_edge(from, to) {} }; template <class C> 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 <class T> struct directed_graph : public std::vector<std::vector<edge<T>>> { directed_graph(std::size_t n) : std::vector<std::vector<edge<T>>>(n) {} void add_edge(const edge<T> &e) { this->at(e.from).push_back(e); } }; template <class T> struct undirected_graph : public std::vector<std::vector<edge<T>>> { undirected_graph(std::size_t n) : std::vector<std::vector<edge<T>>>(n) {} void add_edge(const edge<T> &e) { this->at(e.from).push_back(e); edge<T> re = e; std::swap(re.from, re.to); this->at(e.to).push_back(re); } }; template <class C> struct maxflow_graph : public std::vector<std::vector<maxflow_edge<C>>> { maxflow_graph(std::size_t n) : std::vector<std::vector<maxflow_edge<C>>>(n) {} void add_edge(int from, int to, C cap, std::size_t rev_cap = 0) { this->at(from).push_back( maxflow_edge<C>(from, to, cap, this->at(to).size())); this->at(to).push_back( maxflow_edge<C>(to, from, rev_cap, this->at(from).size() - 1)); } }; } // namespace nimi #endif #ifndef NIMI_GRAPH_SP_DIJKSTRA #define NIMI_GRAPH_SP_DIJKSTRA #include <limits> #include <queue> #include <vector> namespace nimi { template <class T> std::vector<T> dijkstra(const nimi::directed_graph<T> &g, std::size_t s) { const T INF = std::numeric_limits<T>::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<T> dist(n, INF); std::priority_queue<node> 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 <algorithm> #include <iostream> #include <numeric> #include <utility> namespace n91 { void main_() { usize n, m; std::cin >> n >> m; nimi::directed_graph<usize> g(n); while (m--) { usize p, q; std::cin >> p >> q; --p; --q; g.add_edge(nimi::edge<usize>(p, q, 1)); g.add_edge(nimi::edge<usize>(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<usize>::max()) { --cnt; e = 0; } } usize max = *std::max_element(d.begin(), d.end()); usize days = 0; while (max > 1) { max = (max + 1) / 2; ++days; } std::cout << cnt << " " << days << std::endl; } } } // namespace n91 int main() { n91::main_(); return 0; }