結果

問題 No.812 Change of Class
ユーザー 👑 hitonanodehitonanode
提出日時 2019-04-14 08:39:26
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 451 ms / 4,000 ms
コード長 4,128 bytes
コンパイル時間 1,815 ms
コンパイル使用メモリ 176,212 KB
実行使用メモリ 10,728 KB
最終ジャッジ日時 2023-09-03 15:04:14
合計ジャッジ時間 12,926 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
7,772 KB
testcase_01 AC 11 ms
4,376 KB
testcase_02 AC 35 ms
5,648 KB
testcase_03 AC 76 ms
8,652 KB
testcase_04 AC 67 ms
7,984 KB
testcase_05 AC 423 ms
8,196 KB
testcase_06 AC 332 ms
7,300 KB
testcase_07 AC 5 ms
4,380 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 383 ms
8,772 KB
testcase_10 AC 421 ms
8,808 KB
testcase_11 AC 16 ms
6,592 KB
testcase_12 AC 251 ms
8,280 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 304 ms
6,976 KB
testcase_16 AC 17 ms
4,376 KB
testcase_17 AC 244 ms
7,220 KB
testcase_18 AC 181 ms
6,172 KB
testcase_19 AC 216 ms
6,600 KB
testcase_20 AC 451 ms
8,760 KB
testcase_21 AC 175 ms
6,004 KB
testcase_22 AC 75 ms
4,428 KB
testcase_23 AC 13 ms
4,376 KB
testcase_24 AC 21 ms
4,376 KB
testcase_25 AC 60 ms
4,380 KB
testcase_26 AC 385 ms
7,836 KB
testcase_27 AC 322 ms
7,280 KB
testcase_28 AC 210 ms
6,640 KB
testcase_29 AC 46 ms
4,376 KB
testcase_30 AC 289 ms
7,076 KB
testcase_31 AC 237 ms
6,520 KB
testcase_32 AC 94 ms
4,952 KB
testcase_33 AC 278 ms
7,560 KB
testcase_34 AC 19 ms
4,380 KB
testcase_35 AC 47 ms
4,380 KB
testcase_36 AC 22 ms
4,376 KB
testcase_37 AC 134 ms
4,992 KB
testcase_38 AC 8 ms
4,568 KB
testcase_39 AC 137 ms
4,968 KB
testcase_40 AC 30 ms
4,380 KB
testcase_41 AC 7 ms
4,572 KB
testcase_42 AC 308 ms
7,012 KB
testcase_43 AC 30 ms
5,920 KB
testcase_44 AC 206 ms
5,968 KB
testcase_45 AC 23 ms
4,380 KB
testcase_46 AC 28 ms
5,908 KB
testcase_47 AC 207 ms
5,880 KB
testcase_48 AC 209 ms
6,420 KB
testcase_49 AC 61 ms
4,380 KB
testcase_50 AC 4 ms
4,380 KB
testcase_51 AC 49 ms
4,376 KB
testcase_52 AC 97 ms
6,416 KB
testcase_53 AC 38 ms
4,376 KB
testcase_54 AC 34 ms
4,380 KB
testcase_55 AC 203 ms
8,420 KB
testcase_56 AC 250 ms
9,392 KB
testcase_57 AC 266 ms
9,896 KB
testcase_58 AC 136 ms
6,460 KB
testcase_59 AC 300 ms
10,728 KB
testcase_60 AC 2 ms
4,376 KB
testcase_61 AC 2 ms
4,376 KB
testcase_62 AC 2 ms
4,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

using Edges = vector<vector<int>>;

Edges e;

// rから各ノードへの距離
vector<int> graph_distance(int N, int r)
{
    vector<int> res(N, N); // res[r] = 0;
    priority_queue<pint, vector<pint>, greater<pint>> pq;
    pq.emplace(0, r);
    res[r] = 0;
    while (!pq.empty())
    {
        pint pa = pq.top(); pq.pop();
        int x = pa.first, now = pa.second;
        for (auto nxt : e[now]) if (mmin(res[nxt], x + 1)) pq.emplace(x + 1, nxt);
    }
    for (auto &v : res) if (v == N) v = 0;
    return res;
}

int main()
{
    int N, M;
    cin >> N >> M;
    e.resize(N + 1);
    REP(_, M)
    {
        int p, q;
        cin >> p >> q;
        e[p].push_back(q);
        e[q].push_back(p);
    }

    int Q;
    cin >> Q;
    REP(_, Q)
    {
        int A;
        cin >> A;
        vector<int> ds = graph_distance(N + 1, A);
        int maxi = *max_element(ALL(ds));
        maxi = max(maxi - 1, 0);
        int d = 0;
        REP(dd, 20) if (POW2(dd) & maxi) d = dd + 1;
        int n = 0;
        for (auto v : ds) n += (v > 0);
        cout << n << " " << d << endl;
    }
}
0