結果

問題 No.812 Change of Class
ユーザー TiramisterTiramister
提出日時 2019-04-12 21:46:04
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 602 ms / 4,000 ms
コード長 7,277 bytes
コンパイル時間 1,336 ms
コンパイル使用メモリ 123,964 KB
実行使用メモリ 12,064 KB
最終ジャッジ日時 2023-09-03 01:10:38
合計ジャッジ時間 15,595 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 93 ms
8,520 KB
testcase_01 AC 15 ms
4,380 KB
testcase_02 AC 51 ms
6,052 KB
testcase_03 AC 110 ms
9,344 KB
testcase_04 AC 96 ms
8,496 KB
testcase_05 AC 589 ms
10,316 KB
testcase_06 AC 453 ms
9,572 KB
testcase_07 AC 4 ms
4,380 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 548 ms
10,868 KB
testcase_10 AC 562 ms
10,928 KB
testcase_11 AC 21 ms
7,360 KB
testcase_12 AC 334 ms
9,848 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 358 ms
8,176 KB
testcase_16 AC 19 ms
4,384 KB
testcase_17 AC 320 ms
8,664 KB
testcase_18 AC 225 ms
7,092 KB
testcase_19 AC 274 ms
7,844 KB
testcase_20 AC 602 ms
10,648 KB
testcase_21 AC 225 ms
6,976 KB
testcase_22 AC 91 ms
5,024 KB
testcase_23 AC 15 ms
4,388 KB
testcase_24 AC 24 ms
4,380 KB
testcase_25 AC 73 ms
4,652 KB
testcase_26 AC 529 ms
9,452 KB
testcase_27 AC 466 ms
8,668 KB
testcase_28 AC 268 ms
7,824 KB
testcase_29 AC 55 ms
4,380 KB
testcase_30 AC 366 ms
8,588 KB
testcase_31 AC 302 ms
7,624 KB
testcase_32 AC 114 ms
5,544 KB
testcase_33 AC 406 ms
9,156 KB
testcase_34 AC 22 ms
4,380 KB
testcase_35 AC 56 ms
4,380 KB
testcase_36 AC 26 ms
4,384 KB
testcase_37 AC 165 ms
5,640 KB
testcase_38 AC 8 ms
5,108 KB
testcase_39 AC 169 ms
5,640 KB
testcase_40 AC 34 ms
4,376 KB
testcase_41 AC 6 ms
4,680 KB
testcase_42 AC 475 ms
8,048 KB
testcase_43 AC 46 ms
6,724 KB
testcase_44 AC 278 ms
6,456 KB
testcase_45 AC 27 ms
4,376 KB
testcase_46 AC 42 ms
6,588 KB
testcase_47 AC 267 ms
6,840 KB
testcase_48 AC 271 ms
7,496 KB
testcase_49 AC 71 ms
4,420 KB
testcase_50 AC 5 ms
4,380 KB
testcase_51 AC 58 ms
4,652 KB
testcase_52 AC 120 ms
7,000 KB
testcase_53 AC 44 ms
4,380 KB
testcase_54 AC 40 ms
4,376 KB
testcase_55 AC 242 ms
9,204 KB
testcase_56 AC 294 ms
10,892 KB
testcase_57 AC 313 ms
11,136 KB
testcase_58 AC 159 ms
7,232 KB
testcase_59 AC 358 ms
12,064 KB
testcase_60 AC 2 ms
4,376 KB
testcase_61 AC 2 ms
4,380 KB
testcase_62 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>

// container
#include <vector>
#include <string>
#include <tuple>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>

// others
#include <random>
#include <limits>
#include <functional>
#include <ctime>
#include <cassert>

// type alias
using lint = long long;
using ldouble = long double;
template <class T>
using greater_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T>>;

/* ----- class ----- */

template <class Cost = int>
struct Edge {
    int from, to;
    Cost cost;
    Edge(int from = -1, int to = -1, Cost cost = 1)
        : from(from), to(to), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = int>
using Edges = std::vector<Edge<Cost>>;

template <class Cost = int>
class Graph {
public:
    int size;
    std::vector<std::vector<Edge<Cost>>> path;

    explicit Graph(int N = 0) : size(N), path(size) {}
    void span(int from, int to, Cost cost = 1) {
        path[from].push_back(Edge<Cost>(from, to, cost));
    }
    std::vector<Edge<Cost>>& operator[](int v) { return path[v]; }
};

/* ----- Output Functions for Debugging ----- */

template <class T>
std::ostream& operator<<(std::ostream& os, std::vector<T> v);
template <class T>
std::ostream& operator<<(std::ostream& os, std::set<T> v);
template <class L, class R>
std::ostream& operator<<(std::ostream& os, std::pair<L, R> p);
template <class K, class T>
std::ostream& operator<<(std::ostream& os, std::map<K, T> v);
template <class T>
std::ostream& operator<<(std::ostream& os, std::stack<T> s);
template <class T>
std::ostream& operator<<(std::ostream& os, std::queue<T> q);
template <class T>
std::ostream& operator<<(std::ostream& os, std::priority_queue<T> q);
template <class T>
std::ostream& operator<<(std::ostream& os, std::priority_queue<T, std::vector<T>, std::greater<T>> q);
template <class T>
std::ostream& operator<<(std::ostream& os, Edge<T> e);

template <class T>
std::ostream& operator<<(std::ostream& os, std::vector<T> v) {
    os << "[";
    for (auto vv : v) os << vv << ",";
    return os << "]";
}
template <class T>
std::ostream& operator<<(std::ostream& os, std::set<T> v) {
    os << "{";
    for (auto vv : v) os << vv << ",";
    return os << "}";
}
template <class L, class R>
std::ostream& operator<<(std::ostream& os, std::pair<L, R> p) {
    return os << "(" << p.first << "," << p.second << ")";
}
template <class K, class T>
std::ostream& operator<<(std::ostream& os, std::map<K, T> v) {
    os << "{";
    for (auto vv : v) os << vv << ",";
    return os << "}";
}
template <class T>
std::ostream& operator<<(std::ostream& os, std::stack<T> s) {
    os << "[";
    while (!s.empty()) {
        os << s.top() << ",";
        s.pop();
    }
    return os << "]";
}
template <class T>
std::ostream& operator<<(std::ostream& os, std::queue<T> q) {
    os << "[";
    while (!q.empty()) {
        os << q.front() << ",";
        q.pop();
    }
    return os << "]";
}
template <class T>
std::ostream& operator<<(std::ostream& os, std::priority_queue<T> q) {
    os << "{";
    while (!q.empty()) {
        os << q.top() << ",";
        q.pop();
    }
    return os << "}";
}
template <class T>
std::ostream& operator<<(std::ostream& os, std::priority_queue<T, std::vector<T>, std::greater<T>> q) {
    os << "{";
    while (!q.empty()) {
        os << q.top() << ",";
        q.pop();
    }
    return os << "}";
}
template <class T>
std::ostream& operator<<(std::ostream& os, Edge<T> e) {
    return os << "(" << e.from << "->" << e.to << ":" << e.cost << ")";
}

/* ----- Short Functions ----- */

template <class T>
inline T sq(T a) { return a * a; }

template <class T>
inline T iceil(T n, T d) { return (n + d - 1) / d; }

template <class T>
T gcd(T a, T b) {
    while (b > 0) {
        a %= b;
        std::swap(a, b);
    }
    return a;
}

template <class T, class U>
T ipow(T b, U n) {
    T ret = 1;
    while (n > 0) {
        if (n & 1) ret *= b;
        n >>= 1;
        b *= b;
    }
    return ret;
}

// 0-indexed
template <class T, class U>
inline T kthbit(T a, U k) { return (a >> k) & 1; }

template <class T, class U>
inline T mask(T a, U k) { return a & ((1 << k) - 1); }

template <class T>
std::map<T, int> compress(std::vector<T>& v) {
    std::sort(v.begin(), v.end());
    v.erase(std::unique(v.begin(), v.end()), v.end());

    std::map<T, int> rev;
    for (int i = 0; i < v.size(); ++i) rev[v[i]] = i;
    return rev;
}

template <class T>
T Vec(T v) { return v; }

template <class T, class... Ts>
auto Vec(size_t l, Ts... ts) {
    return std::vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}

/* ----- Constants ----- */

const int INF = std::numeric_limits<int>::max() / 3;
// const ll INF = std::numeric_limits<ll>::max() / 3;
// const ld PI = acos(-1);
// const ld EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));

class UnionFind {
private:
    std::vector<int> par, num;

    int find(int v) {
        return (par[v] == v) ? v : (par[v] = find(par[v]));
    }

public:
    explicit UnionFind(int N) : par(N), num(N, 1) {
        std::iota(par.begin(), par.end(), 0);
    }

    void unite(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;

        if (num[u] < num[v]) std::swap(u, v);
        num[u] += num[v];
        par[v] = u;
    }

    bool same(int u, int v) { return find(u) == find(v); }
    bool ispar(int v) { return v == find(v); }
    int size(int v) { return num[find(v)]; }
};

template <class Cost>
std::vector<Cost> dijkstra(Graph<Cost>& graph, std::vector<int> ss) {
    std::vector<Cost> dist(graph.size, INF);
    std::priority_queue<std::pair<int, Cost>, std::vector<std::pair<int, Cost>>, std::greater<std::pair<int, Cost>>> que;

    for (auto s : ss) {
        dist[s] = 0;
        que.emplace(0, s);
    }

    while (!que.empty()) {
        int v;
        Cost d;
        std::tie(d, v) = que.top();
        que.pop();
        if (d > dist[v]) continue;

        for (auto e : graph[v]) {
            if (dist[e.to] <= dist[v] + e.cost) continue;
            dist[e.to] = dist[v] + e.cost;
            que.emplace(dist[e.to], e.to);
        }
    }
    return dist;
}

int main() {
    int N, M;
    std::cin >> N >> M;

    Graph<> graph(N);
    UnionFind uf(N);
    for (int i = 0; i < M; ++i) {
        int p, q;
        std::cin >> p >> q;
        --p, --q;
        graph.span(p, q);
        graph.span(q, p);

        uf.unite(p, q);
    }

    int Q;
    std::cin >> Q;
    for (int q = 0; q < Q; ++q) {
        int a;
        std::cin >> a;
        --a;

        std::cout << uf.size(a) - 1 << " ";
        auto dist = dijkstra<>(graph, {a});

        // std::cerr << dist << std::endl;

        int max = 1;
        for (auto d : dist) {
            if (0 < d && d < INF) max = std::max(max, d);
        }

        int day;
        for (day = 0; day < 30; ++day) {
            if ((1 << day) >= max) break;
        }

        std::cout << day << std::endl;
    }

    return 0;
}
0