結果
問題 |
No.812 Change of Class
|
ユーザー |
![]() |
提出日時 | 2020-06-22 02:21:39 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 427 ms / 4,000 ms |
コード長 | 2,390 bytes |
コンパイル時間 | 2,169 ms |
コンパイル使用メモリ | 210,064 KB |
最終ジャッジ日時 | 2025-01-11 09:19:13 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 60 |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> p_ll; template<class T> void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; } #define repr(i,from,to) for (int i=(int)from; i<(int)to; i++) #define all(vec) vec.begin(), vec.end() #define rep(i,N) repr(i,0,N) #define per(i,N) for (int i=(int)N-1; i>=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector<ll> fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); } ll lcm(ll a, ll b) { return a/gcd(a,b)*b; } // ---------------------------------------------------------------------- // ---------------------------------------------------------------------- struct edge { ll to, d; }; vector<vector<edge>> adj; vector<ll> dijkstra(int n=0) { int N = adj.size(); auto c = [](const p_ll &x, const p_ll &y){return x.second>y.second;}; priority_queue<p_ll, vector<p_ll>, decltype(c)> q(c); vector<ll> result(N,LLINF); result[n] = 0; q.push(make_pair(n,0)); while(q.size()) { p_ll now = q.top(); q.pop(); ll np = now.first, nd = now.second; if (nd>result[np]) continue; for (auto x: adj[np]) { if (result[x.to]<=result[np]+x.d) continue; q.push(make_pair(x.to, result[np]+x.d)); result[x.to] = result[np]+x.d; } } return result; } // ---------------------------------------------------------------------- // ---------------------------------------------------------------------- int main() { ll N, M; cin >> N >> M; adj.resize(N); rep(i,M) { ll p, q; cin >> p >> q; p--; q--; adj[p].push_back({q,1}); adj[q].push_back({p,1}); } ll Q; cin >> Q; ll q[Q]; rep(i,Q) { cin >> q[i]; q[i]--; } rep(i,Q) { vector<ll> d = dijkstra(q[i]); ll count = 0, len = 0; rep(j,N) { if (q[i]!=j&&d[j]!=LLINF) { count++; ll now = 0, p2 = 1; while(p2<d[j]) { now++; p2*=2; } len = max(len, now); } } cout << count << " " << len << endl; } return 0; }