結果
問題 | No.812 Change of Class |
ユーザー | Sumitacchan |
提出日時 | 2019-04-12 21:50:42 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 674 ms / 4,000 ms |
コード長 | 3,486 bytes |
コンパイル時間 | 1,774 ms |
コンパイル使用メモリ | 179,044 KB |
実行使用メモリ | 13,836 KB |
最終ジャッジ日時 | 2023-09-03 01:24:47 |
合計ジャッジ時間 | 16,633 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 95 ms
9,452 KB |
testcase_01 | AC | 15 ms
4,380 KB |
testcase_02 | AC | 51 ms
6,496 KB |
testcase_03 | AC | 113 ms
10,440 KB |
testcase_04 | AC | 98 ms
9,512 KB |
testcase_05 | AC | 674 ms
11,528 KB |
testcase_06 | AC | 528 ms
10,952 KB |
testcase_07 | AC | 5 ms
4,384 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 579 ms
11,776 KB |
testcase_10 | AC | 604 ms
12,052 KB |
testcase_11 | AC | 16 ms
6,940 KB |
testcase_12 | AC | 358 ms
10,336 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 409 ms
9,020 KB |
testcase_16 | AC | 19 ms
4,380 KB |
testcase_17 | AC | 346 ms
9,340 KB |
testcase_18 | AC | 236 ms
7,676 KB |
testcase_19 | AC | 287 ms
8,428 KB |
testcase_20 | AC | 655 ms
11,600 KB |
testcase_21 | AC | 225 ms
7,416 KB |
testcase_22 | AC | 88 ms
5,296 KB |
testcase_23 | AC | 15 ms
4,376 KB |
testcase_24 | AC | 24 ms
4,380 KB |
testcase_25 | AC | 70 ms
4,760 KB |
testcase_26 | AC | 504 ms
10,292 KB |
testcase_27 | AC | 463 ms
9,648 KB |
testcase_28 | AC | 289 ms
8,388 KB |
testcase_29 | AC | 53 ms
4,376 KB |
testcase_30 | AC | 393 ms
9,172 KB |
testcase_31 | AC | 328 ms
8,084 KB |
testcase_32 | AC | 112 ms
5,720 KB |
testcase_33 | AC | 403 ms
10,124 KB |
testcase_34 | AC | 21 ms
4,380 KB |
testcase_35 | AC | 55 ms
4,516 KB |
testcase_36 | AC | 26 ms
4,376 KB |
testcase_37 | AC | 168 ms
5,832 KB |
testcase_38 | AC | 7 ms
4,760 KB |
testcase_39 | AC | 179 ms
5,840 KB |
testcase_40 | AC | 34 ms
4,380 KB |
testcase_41 | AC | 6 ms
4,604 KB |
testcase_42 | AC | 508 ms
8,264 KB |
testcase_43 | AC | 38 ms
6,676 KB |
testcase_44 | AC | 317 ms
7,024 KB |
testcase_45 | AC | 27 ms
4,380 KB |
testcase_46 | AC | 31 ms
6,452 KB |
testcase_47 | AC | 273 ms
7,012 KB |
testcase_48 | AC | 307 ms
7,968 KB |
testcase_49 | AC | 71 ms
4,428 KB |
testcase_50 | AC | 5 ms
4,376 KB |
testcase_51 | AC | 59 ms
4,840 KB |
testcase_52 | AC | 130 ms
7,144 KB |
testcase_53 | AC | 44 ms
4,376 KB |
testcase_54 | AC | 40 ms
4,376 KB |
testcase_55 | AC | 295 ms
10,272 KB |
testcase_56 | AC | 368 ms
12,316 KB |
testcase_57 | AC | 395 ms
12,796 KB |
testcase_58 | AC | 199 ms
7,944 KB |
testcase_59 | AC | 429 ms
13,836 KB |
testcase_60 | AC | 2 ms
4,376 KB |
testcase_61 | AC | 1 ms
4,380 KB |
testcase_62 | AC | 1 ms
4,380 KB |
ソースコード
#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 1000000000000000000 using 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)) % mod struct 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; }