結果
問題 | No.812 Change of Class |
ユーザー |
|
提出日時 | 2019-04-12 22:16:58 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 179 ms / 4,000 ms |
コード長 | 2,143 bytes |
コンパイル時間 | 2,097 ms |
コンパイル使用メモリ | 179,772 KB |
実行使用メモリ | 10,132 KB |
最終ジャッジ日時 | 2024-06-12 18:53:52 |
合計ジャッジ時間 | 8,205 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 60 |
ソースコード
#include"bits/stdc++.h" using namespace std; using ll = long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; #define FOR(k,m,n) for(ll (k)=(m);(k)<(n);(k)++) #define REP(i,n) FOR((i),0,(n)) #define WAITING(str) int str;std::cin>>str; #define DEBUGING(str) cout<< #str << " " str<<endl constexpr int INF = (1 << 30); constexpr ll INFL = (1ll << 60); constexpr ll MOD = 1000000007;// 10^9+7 class UnionFind { public: vector<int>rank, parent; // UnionFind(int size) { rank.resize(size, 0); parent.resize(size, 0); REP(i, size)parent[i] = i; } //̍߂ int find(int x) { if (parent[x] == x)return x; else return parent[x] = find(parent[x]); } //xy̑W void unite(int x, int y) { x = find(x); y = find(y); if (x == y)return; if (rank[x] < rank[y]) parent[x] = y; else { parent[y] = x; if (rank[x] == rank[y])rank[x]++; } } //xyWɑ邩ۂ bool same(int x, int y) { return (find(x) == find(y)); } }; int N, M, Q; vector<vector<int>> edges; int paint(int s) { vector<int> used(N, INF); queue<int> q; used[s] = 0; q.push(s); while (!q.empty()) { int now = q.front(); q.pop(); int dist = used[now]; for (auto next : edges[now]) { int nextdist = dist + 1; int befdist = used[next]; if (nextdist >= befdist)continue; used[next] = nextdist; q.push(next); } } int res = 0; for (auto dist : used)if (dist != INF)res = max(res, dist); return res; } int count_day(int len) { int res = 0; while (len > 1) { len = (len / 2) + (len % 2 != 0 ? 1 : 0); res++; } return res; } int main() { cin >> N >> M; edges.resize(N); UnionFind uf(N); REP(i, M) { int a, b; cin >> a >> b; a--; b--; edges[a].push_back(b); edges[b].push_back(a); uf.unite(a, b); } cin >> Q; REP(i, Q) { int A, cnt = 0; cin >> A; A--; REP(j, N)if (j != A && uf.same(A, j))cnt++; int len = paint(A); cout << cnt << " " << count_day(len) << endl; } cin >> N; return 0; }