結果

問題 No.812 Change of Class
ユーザー kissshot7kissshot7
提出日時 2020-08-04 16:41:06
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 527 ms / 4,000 ms
コード長 5,641 bytes
コンパイル時間 2,129 ms
コンパイル使用メモリ 190,128 KB
実行使用メモリ 20,288 KB
最終ジャッジ日時 2024-09-14 18:36:12
合計ジャッジ時間 15,619 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 84 ms
17,408 KB
testcase_01 AC 18 ms
10,880 KB
testcase_02 AC 48 ms
13,824 KB
testcase_03 AC 97 ms
18,816 KB
testcase_04 AC 87 ms
17,664 KB
testcase_05 AC 527 ms
19,424 KB
testcase_06 AC 406 ms
18,140 KB
testcase_07 AC 11 ms
11,520 KB
testcase_08 AC 8 ms
10,368 KB
testcase_09 AC 485 ms
20,096 KB
testcase_10 AC 500 ms
20,096 KB
testcase_11 AC 25 ms
15,488 KB
testcase_12 AC 300 ms
18,944 KB
testcase_13 AC 7 ms
9,856 KB
testcase_14 AC 7 ms
9,984 KB
testcase_15 AC 330 ms
16,640 KB
testcase_16 AC 24 ms
10,496 KB
testcase_17 AC 283 ms
16,896 KB
testcase_18 AC 208 ms
14,848 KB
testcase_19 AC 242 ms
15,872 KB
testcase_20 AC 526 ms
19,840 KB
testcase_21 AC 208 ms
14,848 KB
testcase_22 AC 90 ms
12,160 KB
testcase_23 AC 20 ms
10,368 KB
testcase_24 AC 28 ms
10,496 KB
testcase_25 AC 71 ms
11,648 KB
testcase_26 AC 427 ms
18,304 KB
testcase_27 AC 372 ms
17,152 KB
testcase_28 AC 241 ms
15,744 KB
testcase_29 AC 56 ms
11,008 KB
testcase_30 AC 324 ms
16,768 KB
testcase_31 AC 276 ms
15,616 KB
testcase_32 AC 109 ms
12,800 KB
testcase_33 AC 342 ms
17,920 KB
testcase_34 AC 25 ms
10,496 KB
testcase_35 AC 57 ms
11,392 KB
testcase_36 AC 30 ms
10,368 KB
testcase_37 AC 155 ms
13,056 KB
testcase_38 AC 14 ms
12,032 KB
testcase_39 AC 163 ms
13,056 KB
testcase_40 AC 39 ms
10,752 KB
testcase_41 AC 12 ms
11,776 KB
testcase_42 AC 368 ms
16,256 KB
testcase_43 AC 40 ms
14,592 KB
testcase_44 AC 247 ms
14,336 KB
testcase_45 AC 31 ms
10,368 KB
testcase_46 AC 38 ms
14,208 KB
testcase_47 AC 231 ms
14,464 KB
testcase_48 AC 246 ms
15,488 KB
testcase_49 AC 72 ms
11,136 KB
testcase_50 AC 9 ms
9,856 KB
testcase_51 AC 60 ms
11,904 KB
testcase_52 AC 109 ms
14,848 KB
testcase_53 AC 48 ms
10,816 KB
testcase_54 AC 45 ms
10,624 KB
testcase_55 AC 233 ms
16,892 KB
testcase_56 AC 285 ms
18,632 KB
testcase_57 AC 303 ms
19,248 KB
testcase_58 AC 153 ms
14,516 KB
testcase_59 AC 343 ms
20,288 KB
testcase_60 AC 7 ms
9,856 KB
testcase_61 AC 7 ms
9,984 KB
testcase_62 AC 7 ms
9,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };


int N, M;
vector<vec> v;
vec memo;

// 負の閉路がある場合は使用不可
const int MAX_V=100005;

struct edge {
    int to;
    ll cost;
};

// <最短距離, 頂点の番号>
// using P = pair<int, int>;

int V;
vector<edge> G[MAX_V];
ll d[MAX_V];
int pre[MAX_V];

void dijkstra(int s) {
    priority_queue<P, vector<P>, greater<P> > que;
    fill(d, d+V, INF);
    fill(pre, pre+V, -1);
    d[s] = 0;
    que.push(P(0, s));

    while (!que.empty()) {
        P p = que.top();
        que.pop();
        int v = p.second;
        if (d[v] < p.first) continue;

        for (int i=0; i<G[v].size(); ++i) {
            edge e = G[v][i];
            if (d[e.to] > d[v] + e.cost) {
                d[e.to] = d[v] + e.cost;
                pre[e.to] = v;
                que.push(P(d[e.to], e.to));
            }
        }
    }
}

int dfs(int u, int d){
    memo[u] = 1;
    int res = d;
    for(auto p: v[u]){
        if(memo[p]) continue;
        res = max(res, dfs(p, d+1));
    }
    return res;
}

struct uf {
 
     vector<int> par;
     vector<int> sizes;
 
     uf(int n)
             : par(n), sizes(n, 1) {
         for (int i = 0; i < n; i++) {
             par[i] = i;
         }
     }
 
     int find(int x) {
         return x == par[x] ? x : par[x] = find(par[x]);
     }
 
     void unite(int x, int y) {
         x = find(x);
         y = find(y);
         if (x == y) return;
         if (sizes[x] < sizes[y]) swap(x, y);
         par[y] = x;
         sizes[x] += sizes[y];
     }
 
     bool same(int x, int y) {
         return find(x) == find(y);
     }
 
     int get_size(int x) {
         return sizes[find(x)];
     }
 
     bool all_same() {
         bool good = true;
         for (int i = 0, n = par.size(); i < n; i++) if (find(0) != find(i)) good = false;
         return good;
     }
 
     int get_connectivity() {
         set<int> s;
         for (int i = 0, n = par.size(); i < n; i++) s.insert(find(i));
         return s.size();
     }
 
 };

void solve() {
    cin >> N >> M;
    V = N;
    v.resize(N);
    memo.resize(N, 0);
    auto tm = memo;
    uf u(N);
    // rep(i, M){
    //     int a, b; cin >> a >> b;
    //     a--; b--;
    //     v[a].push_back(b);
    //     v[b].push_back(a);
    //     u.unite(a, b);
    // }
    rep(i, M){
        int a, b; cin >> a >> b;
        a--; b--;
        G[a].push_back({b, 1});
        G[b].push_back({a, 1});
        u.unite(a, b);
    }
    int q; cin >> q;
    vec res(q, 0), qa(q);
    rep(i, q){
        int a; cin >> a;
        a--;
        qa[i] = a;
        memo = tm;
        // res[i] = dfs(a, 0);
        dijkstra(a);
        rep(j, N){
            if(d[j] != INF) res[i] = max((ll)res[i], d[j]);
        }
    }
    rep(i, q){
        if(res[i] == 0){
            cout << "0 0" << endl;
        }else{
            ll cnt = 0;
            while(1){
                if(res[i] <= (1<<cnt)) break;
                cnt++;
            }
            cout << u.get_size(qa[i])-1 << " " << cnt << endl;
        }
    }
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  //cout << fixed << setprecision(10);
  //init_f();
  //init();
  //int t; cin >> t; rep(i, t)solve();
  solve();
//   stop
    return 0;
}
0