結果
問題 | No.812 Change of Class |
ユーザー | omochana2 |
提出日時 | 2019-04-13 00:03:01 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 136 ms / 4,000 ms |
コード長 | 2,531 bytes |
コンパイル時間 | 2,130 ms |
コンパイル使用メモリ | 149,792 KB |
実行使用メモリ | 14,900 KB |
最終ジャッジ日時 | 2023-09-03 14:17:30 |
合計ジャッジ時間 | 7,642 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
14,056 KB |
testcase_01 | AC | 13 ms
11,988 KB |
testcase_02 | AC | 29 ms
12,992 KB |
testcase_03 | AC | 58 ms
14,496 KB |
testcase_04 | AC | 52 ms
14,152 KB |
testcase_05 | AC | 136 ms
14,444 KB |
testcase_06 | AC | 116 ms
13,736 KB |
testcase_07 | AC | 7 ms
11,556 KB |
testcase_08 | AC | 7 ms
11,576 KB |
testcase_09 | AC | 127 ms
14,412 KB |
testcase_10 | AC | 130 ms
14,416 KB |
testcase_11 | AC | 13 ms
12,340 KB |
testcase_12 | AC | 81 ms
14,092 KB |
testcase_13 | AC | 6 ms
11,848 KB |
testcase_14 | AC | 7 ms
11,552 KB |
testcase_15 | AC | 89 ms
13,404 KB |
testcase_16 | AC | 12 ms
11,700 KB |
testcase_17 | AC | 83 ms
13,732 KB |
testcase_18 | AC | 64 ms
13,192 KB |
testcase_19 | AC | 73 ms
13,328 KB |
testcase_20 | AC | 136 ms
14,608 KB |
testcase_21 | AC | 64 ms
12,948 KB |
testcase_22 | AC | 32 ms
12,476 KB |
testcase_23 | AC | 11 ms
11,728 KB |
testcase_24 | AC | 13 ms
11,784 KB |
testcase_25 | AC | 26 ms
12,100 KB |
testcase_26 | AC | 113 ms
13,896 KB |
testcase_27 | AC | 98 ms
13,704 KB |
testcase_28 | AC | 70 ms
13,228 KB |
testcase_29 | AC | 21 ms
11,936 KB |
testcase_30 | AC | 89 ms
13,580 KB |
testcase_31 | AC | 76 ms
13,188 KB |
testcase_32 | AC | 38 ms
12,408 KB |
testcase_33 | AC | 93 ms
13,772 KB |
testcase_34 | AC | 12 ms
11,776 KB |
testcase_35 | AC | 22 ms
12,068 KB |
testcase_36 | AC | 12 ms
11,804 KB |
testcase_37 | AC | 46 ms
12,608 KB |
testcase_38 | AC | 9 ms
11,892 KB |
testcase_39 | AC | 48 ms
12,616 KB |
testcase_40 | AC | 16 ms
11,880 KB |
testcase_41 | AC | 8 ms
11,712 KB |
testcase_42 | AC | 91 ms
13,576 KB |
testcase_43 | AC | 22 ms
12,880 KB |
testcase_44 | AC | 65 ms
13,028 KB |
testcase_45 | AC | 12 ms
11,760 KB |
testcase_46 | AC | 21 ms
12,788 KB |
testcase_47 | AC | 63 ms
13,072 KB |
testcase_48 | AC | 69 ms
13,288 KB |
testcase_49 | AC | 21 ms
12,072 KB |
testcase_50 | AC | 7 ms
11,616 KB |
testcase_51 | AC | 23 ms
12,452 KB |
testcase_52 | AC | 40 ms
13,012 KB |
testcase_53 | AC | 16 ms
12,228 KB |
testcase_54 | AC | 14 ms
11,868 KB |
testcase_55 | AC | 35 ms
13,924 KB |
testcase_56 | AC | 41 ms
14,280 KB |
testcase_57 | AC | 45 ms
14,692 KB |
testcase_58 | AC | 26 ms
13,028 KB |
testcase_59 | AC | 48 ms
14,900 KB |
testcase_60 | AC | 5 ms
11,600 KB |
testcase_61 | AC | 5 ms
11,532 KB |
testcase_62 | AC | 6 ms
11,548 KB |
ソースコード
#include <bits/stdc++.h> #define ADD(a, b) a = (a + ll(b)) % mod #define MUL(a, b) a = (a * ll(b)) % mod #define MAX(a, b) a = max(a, b) #define MIN(a, b) a = min(a, b) #define rep(i, a, b) for(int i = int(a); i < int(b); i++) #define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--) #define all(a) (a).begin(), (a).end() #define sz(v) (int)(v).size() #define pb push_back #define sec second #define fst first #define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<int, pi> ppi; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<vl> mat; typedef complex<double> comp; void Debug() {cout << '\n'; } template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){ cout<<arg<<" ";Debug(rest...);} template<class T>ostream& operator<<(ostream& out,const vector<T>& v) { out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;} template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){ out<<"("<<v.first<<", "<<v.second<<")";return out;} const int MAX_N = 300010; const int MAX_V = 100010; const double eps = 1e-6; const ll mod = 1000000007; const int inf = 1 << 30; const ll linf = 1LL << 60; const double PI = 3.14159265358979323846; /////////////////////////////////////////////////////////////////////////////////////////////////// int N, M; vector<int> G[MAX_N]; int Q; int used[MAX_N]; void solve() { cin >> N >> M; rep(i, 0, M) { int a, b; cin >> a >> b; a--; b--; G[a].pb(b); G[b].pb(a); } cin >> Q; while(Q--) { int a; cin >> a; a--; memset(used, 0, sizeof(used)); queue<int> que; que.push(a); used[a] = 1; int timer = 0; while(true) { int m = sz(que); while(m--) { int v = que.front(); que.pop(); rep(i, 0, sz(G[v])) { int n = G[v][i]; if(!used[n]) { used[n] = 1; que.push(n); } } } if(que.empty()) break; timer++; } int d = 0; while(timer > (1 << d)) d++; cout << accumulate(used, used + N, 0) - 1 << " " << d << "\n"; } } int main() { #ifndef LOCAL ios::sync_with_stdio(false); cin.tie(0); #endif cout << fixed; cout.precision(20); srand((unsigned int)time(NULL)); #ifdef LOCAL //freopen("in.txt", "wt", stdout); //for tester freopen("in.txt", "rt", stdin); #endif solve(); #ifdef LOCAL cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }