結果
問題 | No.812 Change of Class |
ユーザー |
![]() |
提出日時 | 2019-04-12 21:50:42 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 666 ms / 4,000 ms |
コード長 | 3,486 bytes |
コンパイル時間 | 1,883 ms |
コンパイル使用メモリ | 182,636 KB |
実行使用メモリ | 13,832 KB |
最終ジャッジ日時 | 2024-06-12 06:58:42 |
合計ジャッジ時間 | 16,620 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 60 |
ソースコード
#include <bits/stdc++.h>using namespace std;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);i++)#define REP(i, n) FOR(i,0,n)#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)#define IREP(i, n) IFOR(i,0,n)#define Sort(v) sort(v.begin(), v.end())#define Reverse(v) reverse(v.begin(), v.end())#define all(v) v.begin(),v.end()#define SZ(v) ((int)v.size())#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))#define Max(a, b) a = max(a, b)#define Min(a, b) a = min(a, b)#define bit(n) (1LL<<(n))#define bit_exist(x, n) ((x >> n) & 1)#define Ans(f, y, n) if(f) cout << y << endl; else cout << n << endl;#define debug(x) cout << #x << "=" << x << endl;#define vdebug(v) cout << #v << "=" << endl; REP(i, v.size()){ cout << v[i] << ","; } cout << endl;#define mdebug(m) cout << #m << "=" << endl; REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;}#define pb push_back#define f first#define s second#define int long long#define INF 1000000000000000000using vec = vector<int>;using mat = vector<vec>;using Pii = pair<int, int>;using PiP = pair<int, Pii>;using PPi = pair<Pii, int>;using bools = vector<bool>;using pairs = vector<Pii>;template<typename T> void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }void readv_m1(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }//int dx[4] = {1,0,-1,0};//int dy[4] = {0,1,0,-1};int mod = 1000000007;//int mod = 998244353;#define Add(x, y) x = (x + (y)) % mod#define Mult(x, y) x = (x * (y)) % modstruct edge{int to, cost;};class Graph{public:int N;vector<vector<edge>> G;Graph(int N): N(N){G = vector<vector<edge>>(N, vector<edge>(0));}void add_edge(int from, int to, int cost = 0){G[from].push_back(edge({to, cost}));}void add_edge2(int v1, int v2, int cost = 0){add_edge(v1, v2, cost);add_edge(v2, v1, cost);}vec dijkstra(int s, int t = -1){vec d(N);priority_queue<Pii, vector<Pii>, greater<Pii>> que;fill(d.begin(), d.end(), INF);d[s] = 0;que.push(Pii(0, s));while(!que.empty()){Pii p = que.top(); que.pop();int v = p.second;if(v == t) return d;if(d[v] < p.first) continue;REP(i, G[v].size()){edge e = G[v][i];if(d[e.to] > d[v] + e.cost){d[e.to] = d[v] + e.cost;que.push(Pii(d[e.to], e.to));}}}return d;}};signed main(){int N, M; cin >> N >> M;Graph G(N);int p, q;REP(i, M){cin >> p >> q;G.add_edge2(p - 1, q - 1, 1);}int Q; cin >> Q;vec ans(Q), day(Q, 0);int A;REP(i, Q){cin >> A;vec d = G.dijkstra(A - 1);ans[i] = -1;int u = 0;REP(j, N){if(d[j] < INF){ans[i]++;Max(u, d[j]);}}REP(k, 20){if(u <= bit(k)){day[i] = k;break;}}}REP(i, Q){cout << ans[i] << " " << day[i] << endl;}return 0;}