結果

問題 No.812 Change of Class
ユーザー 👑 tatyamtatyam
提出日時 2019-04-12 22:05:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 330 ms / 4,000 ms
コード長 6,522 bytes
コンパイル時間 5,243 ms
コンパイル使用メモリ 215,328 KB
実行使用メモリ 26,896 KB
最終ジャッジ日時 2023-09-03 12:30:34
合計ジャッジ時間 11,570 ms
ジャッジサーバーID
(参考情報)
judge15 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 79 ms
21,680 KB
testcase_01 AC 13 ms
6,084 KB
testcase_02 AC 43 ms
13,196 KB
testcase_03 AC 94 ms
24,872 KB
testcase_04 AC 83 ms
22,484 KB
testcase_05 AC 330 ms
23,216 KB
testcase_06 AC 306 ms
19,520 KB
testcase_07 AC 4 ms
5,656 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 327 ms
25,420 KB
testcase_10 AC 313 ms
25,032 KB
testcase_11 AC 16 ms
13,144 KB
testcase_12 AC 189 ms
23,012 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 200 ms
17,512 KB
testcase_16 AC 9 ms
4,376 KB
testcase_17 AC 191 ms
18,588 KB
testcase_18 AC 126 ms
14,316 KB
testcase_19 AC 153 ms
16,160 KB
testcase_20 AC 308 ms
24,684 KB
testcase_21 AC 111 ms
13,860 KB
testcase_22 AC 42 ms
8,188 KB
testcase_23 AC 7 ms
4,376 KB
testcase_24 AC 11 ms
4,612 KB
testcase_25 AC 34 ms
7,128 KB
testcase_26 AC 245 ms
21,152 KB
testcase_27 AC 214 ms
19,212 KB
testcase_28 AC 142 ms
16,252 KB
testcase_29 AC 27 ms
5,932 KB
testcase_30 AC 189 ms
18,216 KB
testcase_31 AC 156 ms
15,568 KB
testcase_32 AC 57 ms
9,680 KB
testcase_33 AC 206 ms
20,128 KB
testcase_34 AC 10 ms
4,384 KB
testcase_35 AC 28 ms
6,988 KB
testcase_36 AC 14 ms
4,748 KB
testcase_37 AC 80 ms
10,688 KB
testcase_38 AC 8 ms
7,044 KB
testcase_39 AC 81 ms
10,596 KB
testcase_40 AC 17 ms
5,468 KB
testcase_41 AC 5 ms
6,284 KB
testcase_42 AC 198 ms
18,076 KB
testcase_43 AC 33 ms
13,288 KB
testcase_44 AC 121 ms
13,856 KB
testcase_45 AC 12 ms
4,756 KB
testcase_46 AC 29 ms
12,992 KB
testcase_47 AC 124 ms
13,980 KB
testcase_48 AC 132 ms
16,288 KB
testcase_49 AC 33 ms
6,784 KB
testcase_50 AC 2 ms
4,376 KB
testcase_51 AC 29 ms
8,068 KB
testcase_52 AC 67 ms
14,400 KB
testcase_53 AC 22 ms
5,660 KB
testcase_54 AC 19 ms
5,404 KB
testcase_55 AC 102 ms
19,476 KB
testcase_56 AC 122 ms
22,504 KB
testcase_57 AC 133 ms
23,432 KB
testcase_58 AC 61 ms
13,876 KB
testcase_59 AC 152 ms
26,896 KB
testcase_60 AC 2 ms
4,376 KB
testcase_61 AC 1 ms
4,380 KB
testcase_62 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ull=unsigned long long;
using uint=unsigned int;
using pcc=pair<char,char>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using pdd=pair<double,double>;
using tuplis=pair<ll,pll>;
using tuplis2=pair<pll,ll>;
template<class T> using pq=priority_queue<T,vector<T>,greater<T>>;
const ll LINF=0x1fffffffffffffff;
const ll MOD=1000000007;
const ll MODD=998244353;
const int INF=0x3fffffff;
const double DINF=numeric_limits<double>::infinity();
const vector<pii> four={{-1,0},{0,1},{1,0},{0,-1}};
#define _overload4(_1,_2,_3,_4,name,...) name
#define _overload3(_1,_2,_3,name,...) name
#define _rep1(n) for(ll i=0;i<n;++i)
#define _rep2(i,n) for(ll i=0;i<n;++i)
#define _rep3(i,a,b) for(ll i=a;i<b;++i)
#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)
#define _rrep1(n) for(ll i=n-1;i>=0;i--)
#define _rrep2(i,n) for(ll i=n-1;i>=0;i--)
#define _rrep3(i,a,b) for(ll i=b-1;i>=a;i--)
#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)
#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)
#define each(i,a) for(auto& i:a)
#define sum(...) accumulate(range(__VA_ARGS__),0LL)
#define dsum(...) accumulate(range(__VA_ARGS__),double(0))
#define _range(i) (i).begin(),(i).end()
#define _range2(i,k) (i).begin(),(i).begin()+k
#define _range3(i,a,b) (i).begin()+a,(i).begin()+b
#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(),(i).rend()
#define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k
#define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b
#define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__)
#define elif else if
#define unless(a) if(!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
#define VEC(type,name,size) vector<type> name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS(){cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);};
inline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;if(a<b){ll c=a;a=b;b=c;}while(b){ll c=b;b=a%b;a=c;}return a;}
inline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,b);}
template<class T>inline constexpr T min(vector<T>& v){return *min_element(range(v));}
inline char min(string& v){return *min_element(range(v));}
template<class T>inline constexpr T max(vector<T>& v){return *max_element(range(v));}
inline char max(string& v){return *max_element(range(v));}
inline constexpr ll intpow(const ll&a,const ll&b){if(b==0)return 1;ll ans=intpow(a,b/2);return ans*ans*(b&1?a:1);}
inline constexpr ll modpow(const ll&a,const ll&b,const ll&mod=MOD){if(b==0)return 1;ll ans=modpow(a,b/2,mod);ans=ans*ans%mod;if(b&1)ans=ans*a%mod;return ans;}
template<typename T>
inline constexpr bool update_min(T& mn,const T& cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}
template<typename T>
inline constexpr bool update_max(T& mx,const T& cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}
inline void in() {}
template<class T>
istream& operator >> (istream& is, vector<T>& vec);
template<class T,size_t size>
istream& operator >> (istream& is, array<T,size>& vec);
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p);
template<class T>
ostream& operator << (ostream& os, vector<T>& vec);
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p);
template<class T>
istream& operator >> (istream& is, vector<T>& vec){for(T& x: vec) is >> x;return is;}
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p){is >> p.first;is >> p.second;return is;}
template<class T>
ostream& operator << (ostream& os, vector<T>& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;}
template<class T>
ostream& operator << (ostream& os, deque<T>& deq){os << deq[0];rep(i,1,deq.size()){os << ' ' << deq[i];}return os;}
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p){os << p.first << " " << p.second;return os;}
template<class T,class L>
pair<T,L> operator + (pair<T,L> a, pair<T,L> b){return {a.first + b.first, a.second + b.second};}
template <class Head, class... Tail>
inline void in(Head&& head,Tail&&... tail){cin>>head;in(move(tail)...);}
template <class T>
inline bool out(T t){cout<<t<<'\n';return 0;}
inline bool out(){cout<<'\n';return 0;}
template <class Head, class... Tail>
inline bool out(Head head,Tail... tail){cout<<head<<' ';out(move(tail)...);return 0;}
template <class T>
inline void err(T t){cerr<<t<<'\n';}
inline void err(){cerr<<'\n';}
template <class Head, class... Tail>
inline void err(Head head,Tail... tail){cerr<<head<<' ';out(move(tail)...);}
inline bool yes(bool i){return out(i?"yes":"no");}
inline bool Yes(bool i){return out(i?"Yes":"No");}
inline bool YES(bool i){return out(i?"YES":"NO");}
inline bool Yay(bool i){return out(i?"Yay!":":(");}
inline bool Possible(bool i){return out(i?"Possible":"Impossible");}
inline bool POSSIBLE(bool i){return out(i?"POSSIBLE":"IMPOSSIBLE");}
inline void Case(ll i){cout<<"Case #"<<i<<": ";}


ll msb(ll a){
    ll ans=0;
    while(a>(1<<ans))ans++;
    return ans;
}
signed main(){
    LL(n,m);
    vector<unordered_set<ll>>g(n);
    rep(m){
        LL(p,q);
        p--;
        q--;
        g[p].insert(q);
        g[q].insert(p);
    }
    LL(q);
    rep(q){
        LL(a);
        a--;
        vector<bool>used(n);
        vector<ll>cost(n,LINF);
        ll ans=0,far=0;
        cost[a]=0;
        used[a]=1;
        queue<ll>q;
        q.push(a);
        while(q.size()){
            ll a=q.front();
            q.pop();
            ans++;
            far=cost[a];
            each(i,g[a])if(!used[i]){
                used[i]=1;
                cost[i]=far+1;
                q.push(i);
            }
        }
        out(ans-1,msb(far));
    }
}




0