結果
問題 | No.812 Change of Class |
ユーザー | Pachicobue |
提出日時 | 2019-04-14 20:43:51 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 266 ms / 4,000 ms |
コード長 | 5,533 bytes |
コンパイル時間 | 3,777 ms |
コンパイル使用メモリ | 208,920 KB |
実行使用メモリ | 15,252 KB |
最終ジャッジ日時 | 2023-09-03 15:06:01 |
合計ジャッジ時間 | 9,625 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
12,132 KB |
testcase_01 | AC | 15 ms
4,376 KB |
testcase_02 | AC | 48 ms
8,144 KB |
testcase_03 | AC | 106 ms
13,728 KB |
testcase_04 | AC | 93 ms
12,472 KB |
testcase_05 | AC | 252 ms
14,044 KB |
testcase_06 | AC | 204 ms
12,320 KB |
testcase_07 | AC | 4 ms
4,968 KB |
testcase_08 | AC | 3 ms
4,376 KB |
testcase_09 | AC | 266 ms
15,144 KB |
testcase_10 | AC | 257 ms
15,104 KB |
testcase_11 | AC | 25 ms
9,828 KB |
testcase_12 | AC | 167 ms
13,800 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,380 KB |
testcase_15 | AC | 141 ms
10,628 KB |
testcase_16 | AC | 9 ms
4,380 KB |
testcase_17 | AC | 139 ms
11,792 KB |
testcase_18 | AC | 98 ms
9,240 KB |
testcase_19 | AC | 117 ms
10,112 KB |
testcase_20 | AC | 254 ms
14,720 KB |
testcase_21 | AC | 94 ms
8,868 KB |
testcase_22 | AC | 42 ms
5,616 KB |
testcase_23 | AC | 8 ms
4,376 KB |
testcase_24 | AC | 12 ms
4,380 KB |
testcase_25 | AC | 33 ms
5,204 KB |
testcase_26 | AC | 193 ms
12,936 KB |
testcase_27 | AC | 159 ms
11,728 KB |
testcase_28 | AC | 112 ms
10,188 KB |
testcase_29 | AC | 25 ms
4,652 KB |
testcase_30 | AC | 144 ms
11,368 KB |
testcase_31 | AC | 118 ms
9,988 KB |
testcase_32 | AC | 53 ms
6,564 KB |
testcase_33 | AC | 164 ms
12,280 KB |
testcase_34 | AC | 11 ms
4,380 KB |
testcase_35 | AC | 28 ms
5,204 KB |
testcase_36 | AC | 10 ms
4,376 KB |
testcase_37 | AC | 62 ms
7,204 KB |
testcase_38 | AC | 10 ms
5,800 KB |
testcase_39 | AC | 63 ms
7,412 KB |
testcase_40 | AC | 18 ms
4,408 KB |
testcase_41 | AC | 8 ms
5,444 KB |
testcase_42 | AC | 141 ms
10,984 KB |
testcase_43 | AC | 45 ms
8,784 KB |
testcase_44 | AC | 92 ms
8,896 KB |
testcase_45 | AC | 11 ms
4,380 KB |
testcase_46 | AC | 42 ms
8,612 KB |
testcase_47 | AC | 89 ms
9,108 KB |
testcase_48 | AC | 108 ms
10,104 KB |
testcase_49 | AC | 26 ms
4,976 KB |
testcase_50 | AC | 3 ms
4,376 KB |
testcase_51 | AC | 33 ms
5,736 KB |
testcase_52 | AC | 70 ms
9,424 KB |
testcase_53 | AC | 18 ms
4,412 KB |
testcase_54 | AC | 14 ms
4,376 KB |
testcase_55 | AC | 59 ms
11,692 KB |
testcase_56 | AC | 72 ms
13,220 KB |
testcase_57 | AC | 76 ms
13,948 KB |
testcase_58 | AC | 40 ms
8,816 KB |
testcase_59 | AC | 87 ms
15,252 KB |
testcase_60 | AC | 1 ms
4,376 KB |
testcase_61 | AC | 2 ms
4,376 KB |
testcase_62 | AC | 1 ms
4,380 KB |
ソースコード
#include <bits/stdc++.h> #pragma GCC diagnostic ignored "-Wsign-compare" #pragma GCC diagnostic ignored "-Wsign-conversion" #define NDEBUG #define SHOW(...) static_cast<void>(0) //!===========================================================!// //! dP dP dP !// //! 88 88 88 !// //! 88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b. !// //! 88 88 88ooood8 88' '88 88' '88 88ooood8 88' '88 !// //! 88 88 88. ... 88. .88 88. .88 88. ... 88 !// //! dP dP '88888P' '88888P8 '88888P8 '88888P' dP !// //!===========================================================!// using ld = long double; using uint = unsigned int; using ll = long long; using ull = unsigned long long; constexpr unsigned int MOD = 1000000007; template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 4; template <typename F> constexpr F PI = static_cast<F>(3.1415926535897932385); std::mt19937 mt{std::random_device{}()}; template <typename T> bool chmin(T& a, const T& b) { return a = std::min(a, b), a == b; } template <typename T> bool chmax(T& a, const T& b) { return a = std::max(a, b), a == b; } template <typename T> std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); } template <class... Args> auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); } template <typename T> constexpr T popCount(const T u) { #ifdef __has_builtin return u == 0 ? T(0) : (T)__builtin_popcountll(u); #else unsigned long long v = static_cast<unsigned long long>(u); return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f); #endif } template <typename T> constexpr T log2p1(const T u) { #ifdef __has_builtin return u == 0 ? T(0) : T(64 - __builtin_clzll(u)); #else unsigned long long v = static_cast<unsigned long long>(u); return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), popCount(v); #endif } template <typename T> constexpr T clog(const T v) { return v == 0 ? T(0) : log2p1(v - 1); } template <typename T> constexpr T msbp1(const T v) { return log2p1(v); } template <typename T> constexpr T lsbp1(const T v) { #ifdef __has_builtin return __builtin_ffsll(v); #else return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1); #endif } template <typename T> constexpr bool ispow2(const T v) { return popCount(v) == 1; } template <typename T> constexpr T ceil2(const T v) { return v == 0 ? T(1) : T(1) << log2p1(v - 1); } template <typename T> constexpr T floor2(const T v) { return v == 0 ? T(0) : T(1) << (log2p1(v) - 1); } //!=================================================!// //! .88888. dP !// //! d8' '88 88 !// //! 88 88d888b. .d8888b. 88d888b. 88d888b. !// //! 88 YP88 88' '88 88' '88 88' '88 88' '88 !// //! Y8. .88 88 88. .88 88. .88 88 88 !// //! '88888' dP '88888P8 88Y888P' dP dP !// //! 88 !// //! dP !// //!=================================================!// struct Graph { Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {} void addEdge(const std::size_t from, const std::size_t to, const bool bi = false) { assert(from < V), assert(to < V); edge[from].push_back(to), rev_edge[to].push_back(from); if (bi) { addEdge(to, from, false); } } const std::vector<std::size_t>& operator[](const std::size_t i) const { return assert(i < V), edge[i]; } void debugPrint() const { std::cerr << "[\n"; for (std::size_t i = 0; i < V; i++) { for (const std::size_t to : edge[i]) { std::cerr << i << "->" << to << "\n"; } } std::cerr << "]\n"; } std::size_t V; std::vector<std::vector<std::size_t>> edge, rev_edge; }; //!============================================!// //! 8888ba.88ba oo !// //! 88 '8b '8b !// //! 88 88 88 .d8888b. dP 88d888b. !// //! 88 88 88 88' '88 88 88' '88 !// //! 88 88 88 88. .88 88 88 88 !// //! dP dP dP '88888P8 dP dP dP !// //!============================================!// int main() { int N, M; std::cin >> N >> M; Graph G(N); for (int i = 0, p, q; i < M; i++) { std::cin >> p >> q, p--, q--; G.addEdge(p, q, true); } int Q; std::cin >> Q; for (int q = 0, A; q < Q; q++) { std::cin >> A, A--; std::vector<int> D(N, INF<int>); std::queue<int> Q; D[A] = 0, Q.push(A); while (not Q.empty()) { const int s = Q.front(); Q.pop(); for (const int to : G[s]) { if (D[to] == INF<int>) { D[to] = D[s] + 1, Q.push(to); } } } int total = 0, far = 0, ans = 0; for (int i = 0; i < N; i++) { if (D[i] != INF<int>) { total++, chmax(far, D[i]); } } for (; far > 1; ans++, (far += 1) /= 2) {} std::cout << total - 1 << " " << ans << std::endl; } return 0; }