結果

問題 No.812 Change of Class
ユーザー maimai
提出日時 2019-04-12 22:27:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 114 ms / 4,000 ms
コード長 6,605 bytes
コンパイル時間 2,787 ms
コンパイル使用メモリ 222,588 KB
実行使用メモリ 9,512 KB
最終ジャッジ日時 2023-09-03 13:20:48
合計ジャッジ時間 7,479 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 35 ms
7,920 KB
testcase_01 AC 6 ms
4,376 KB
testcase_02 AC 19 ms
5,700 KB
testcase_03 AC 41 ms
8,620 KB
testcase_04 AC 36 ms
8,004 KB
testcase_05 AC 114 ms
7,912 KB
testcase_06 AC 93 ms
6,948 KB
testcase_07 AC 4 ms
4,376 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 104 ms
8,708 KB
testcase_10 AC 109 ms
8,908 KB
testcase_11 AC 10 ms
6,624 KB
testcase_12 AC 69 ms
8,260 KB
testcase_13 AC 1 ms
4,376 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 76 ms
7,044 KB
testcase_16 AC 6 ms
4,376 KB
testcase_17 AC 69 ms
7,404 KB
testcase_18 AC 53 ms
5,924 KB
testcase_19 AC 60 ms
6,512 KB
testcase_20 AC 112 ms
8,324 KB
testcase_21 AC 51 ms
5,896 KB
testcase_22 AC 23 ms
4,384 KB
testcase_23 AC 5 ms
4,380 KB
testcase_24 AC 7 ms
4,380 KB
testcase_25 AC 19 ms
4,380 KB
testcase_26 AC 93 ms
7,760 KB
testcase_27 AC 83 ms
7,384 KB
testcase_28 AC 58 ms
6,420 KB
testcase_29 AC 15 ms
4,380 KB
testcase_30 AC 76 ms
7,212 KB
testcase_31 AC 66 ms
6,228 KB
testcase_32 AC 30 ms
4,524 KB
testcase_33 AC 78 ms
7,780 KB
testcase_34 AC 7 ms
4,380 KB
testcase_35 AC 16 ms
4,380 KB
testcase_36 AC 7 ms
4,376 KB
testcase_37 AC 35 ms
5,064 KB
testcase_38 AC 6 ms
4,720 KB
testcase_39 AC 36 ms
5,168 KB
testcase_40 AC 10 ms
4,380 KB
testcase_41 AC 5 ms
4,400 KB
testcase_42 AC 76 ms
6,912 KB
testcase_43 AC 15 ms
5,920 KB
testcase_44 AC 52 ms
5,852 KB
testcase_45 AC 6 ms
4,380 KB
testcase_46 AC 14 ms
5,840 KB
testcase_47 AC 50 ms
6,112 KB
testcase_48 AC 59 ms
6,456 KB
testcase_49 AC 14 ms
4,376 KB
testcase_50 AC 2 ms
4,376 KB
testcase_51 AC 17 ms
4,380 KB
testcase_52 AC 34 ms
6,104 KB
testcase_53 AC 10 ms
4,380 KB
testcase_54 AC 9 ms
4,380 KB
testcase_55 AC 30 ms
7,716 KB
testcase_56 AC 35 ms
8,512 KB
testcase_57 AC 37 ms
9,152 KB
testcase_58 AC 19 ms
5,972 KB
testcase_59 AC 42 ms
9,512 KB
testcase_60 AC 1 ms
4,376 KB
testcase_61 AC 1 ms
4,380 KB
testcase_62 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: 関数 ‘int main()’ 内:
main.cpp:164:34: 警告: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
  164 |         if (cnt == 1) printer << "0 0\n";
      |                                  ^~~~~~~

ソースコード

diff # 

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=decltype(l)();(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream& o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
    os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os;
}
template<typename T> inline ostream& operator<<(ostream & o, const vector<T> & v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream & o, const array<T, S> & v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& chmax(T & to, const T & val) { return to = max(to, val); }
template<typename T> inline T& chmin(T & to, const T & val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random & rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random & rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
    FILE* fp_;
public:
    inline MaiScanner(FILE* fp) :fp_(fp) {}
    template<typename T> void input_integer(T& var) noexcept {
        var = 0; T sign = 1;
        int cc = getc_x(fp_);
        for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
            if (cc == '-') sign = -1;
        for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
            var = (var << 3) + (var << 1) + cc - '0';
        var = var * sign;
    }
    inline int c() noexcept { return getc_x(fp_); }
    inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }
    inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }
    inline MaiScanner& operator>>(string & var) {
        int cc = getc_x(fp_);
        for (; !isvisiblechar(cc); cc = getc_x(fp_));
        for (; isvisiblechar(cc); cc = getc_x(fp_))
            var.push_back(cc);
        return *this;
    }
    template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) * this >> *it; }
};
class MaiPrinter {
    FILE* fp_;
public:
    inline MaiPrinter(FILE* fp) :fp_(fp) {}
    template<typename T>
    void output_integer(T var) noexcept {
        if (var == 0) { putc_x('0', fp_); return; }
        if (var < 0)
            putc_x('-', fp_),
            var = -var;
        char stack[32]; int stack_p = 0;
        while (var)
            stack[stack_p++] = '0' + (var % 10),
            var /= 10;
        while (stack_p)
            putc_x(stack[--stack_p], fp_);
    }
    inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
    inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }
    inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }
    inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
    inline MaiPrinter& operator<<(const string& str) {
        const char* p = str.c_str();
        const char* l = p + str.size();
        while (p < l) putc_x(*p++, fp_);
        return *this;
    }
    template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);


class Graph {
public:
    size_t n;
    vector<vector<int>> vertex_to;

    Graph(size_t n = 1) :n(n), vertex_to(n) {}

    inline size_t size() const { return n; }
    void resize(size_t _n) { vertex_to.resize(n = _n); }
    void connect(int from, int to) {
        vertex_to[(size_t)from].emplace_back(to);
        vertex_to[(size_t)to].emplace_back(from);
    }
};

vector<int> dijkstra(const Graph& graph, int startIndex) {
    vector<int> dist(graph.size(), numeric_limits<int>::max());

    queue<pair<int, int>> que; // <dist, idx>
    que.emplace(0, startIndex);
    dist[startIndex] = 0;

    while (!que.empty()) {
        int d = que.front().first;
        int v = que.front().second;
        que.pop();
        if (dist[v] < d) continue;

        for (int u : graph.vertex_to[v])
            if (d + 1 < dist[u])
                que.emplace(dist[u] = d + 1, u);
    }
    return move(dist);
}

int N, M;
Graph graph;

int main() {
    
    scanner >> N >> M;
    graph = Graph(N);

    repeat(i, M) {
        int a, b;
        scanner >> a >> b;
        --a; --b;
        graph.connect(a, b);
    }
    int q;
    scanner >> q;
    repeat(i, q) {
        int a; scanner >> a; --a;
        auto dij = dijkstra(graph, a);
        int mx = 0;
        int cnt = 0;
        repeat(i, N) {
            if (dij[i] > N) continue;
            ++cnt;
            chmax(mx, dij[i]);
        }
        if (cnt == 1) printer << "0 0\n";
        else {
            int tim = ceil(log2(mx));
            printer << (cnt - 1) << ' ' << (tim) << '\n';
        }
    }


    return 0;
}
0