結果
問題 | No.812 Change of Class |
ユーザー |
|
提出日時 | 2020-01-21 02:29:07 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 486 ms / 4,000 ms |
コード長 | 3,750 bytes |
コンパイル時間 | 1,788 ms |
コンパイル使用メモリ | 178,612 KB |
実行使用メモリ | 11,552 KB |
最終ジャッジ日時 | 2024-06-12 21:50:02 |
合計ジャッジ時間 | 13,036 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 60 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;#define ALL(obj) (obj).begin(),(obj).end()#define SPEED cin.tie(0);ios::sync_with_stdio(false);template<class T> using PQ = priority_queue<T>;template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;constexpr long long MOD = (long long)1e9 + 7;constexpr long long MOD2 = 998244353;constexpr long long HIGHINF = (long long)1e18;constexpr long long LOWINF = (long long)1e15;constexpr long double PI = 3.1415926535897932384626433;template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "")<< obj[i]; o << "}"; return o;}template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}void print(void) {cout << endl;}template <class Head> void print(Head&& head) {cout << head;print();}template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}template <class T> void chmax(T& a, const T b){a=max(a,b);}template <class T> void chmin(T& a, const T b){a=min(a,b);}void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}//Dijkstratemplate<class T> class Dijkstra {public:int N;T inf;vector<T> cost;vector<vector<pair<T, int>>> edge;Dijkstra(const int N, T inf) : N(N), inf(inf),cost(N), edge(N) {}void make_edge(int from, int to, T w) {edge[from].push_back({ w,to });}void solve(int start) {for(int i = 0; i < N; ++i) cost[i] = inf;priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> pq;cost[start] = 0;pq.push({ 0,start });while (!pq.empty()) {T v = pq.top().first;int from = pq.top().second;pq.pop();for (auto u : edge[from]) {T w = v + u.first;int to = u.second;if (w < cost[to]) {cost[to] = w;pq.push({ w,to });}}}return;}};//verify https://atcoder.jp/contests/abc077/tasks/arc084_bint main() {int N,M; cin >> N >> M;vector<int> dp(N,0);for(int i = 2; i < N; ++i) {dp[i] = dp[i/2+i%2]+1;}Dijkstra<int> dijk(N,1234567);for(int i = 0; i < M; ++i){int p,q; cin >> p >> q;p--,q--;dijk.make_edge(p,q,1);dijk.make_edge(q,p,1);}int Q; cin >> Q;vector<pair<int,int>> ans;while (Q--){int a; cin >> a;a--;dijk.solve(a);int cnt = 0,maxi = 0;for(int i = 0; i < N; ++i){if(dijk.cost[i]!=1234567) cnt++;if(dijk.cost[i]!=1234567) chmax(maxi,dijk.cost[i]);}cnt--;ans.push_back({cnt,dp[maxi]});}for(auto& e:ans) cout << e.first << " " << e.second << endl;return 0;}