結果
問題 | No.812 Change of Class |
ユーザー | vwxyz |
提出日時 | 2024-04-07 20:06:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 776 ms / 4,000 ms |
コード長 | 3,756 bytes |
コンパイル時間 | 276 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 126,092 KB |
最終ジャッジ日時 | 2024-04-07 20:07:19 |
合計ジャッジ時間 | 21,325 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 354 ms
105,048 KB |
testcase_01 | AC | 122 ms
78,588 KB |
testcase_02 | AC | 216 ms
91,644 KB |
testcase_03 | AC | 372 ms
111,692 KB |
testcase_04 | AC | 343 ms
105,840 KB |
testcase_05 | AC | 776 ms
107,844 KB |
testcase_06 | AC | 511 ms
100,036 KB |
testcase_07 | AC | 71 ms
81,856 KB |
testcase_08 | AC | 49 ms
67,888 KB |
testcase_09 | AC | 683 ms
112,376 KB |
testcase_10 | AC | 718 ms
112,496 KB |
testcase_11 | AC | 151 ms
124,540 KB |
testcase_12 | AC | 457 ms
117,408 KB |
testcase_13 | AC | 40 ms
55,608 KB |
testcase_14 | AC | 39 ms
55,608 KB |
testcase_15 | AC | 484 ms
99,696 KB |
testcase_16 | AC | 116 ms
77,308 KB |
testcase_17 | AC | 486 ms
102,492 KB |
testcase_18 | AC | 382 ms
96,636 KB |
testcase_19 | AC | 434 ms
99,300 KB |
testcase_20 | AC | 740 ms
111,244 KB |
testcase_21 | AC | 375 ms
93,948 KB |
testcase_22 | AC | 209 ms
89,980 KB |
testcase_23 | AC | 107 ms
77,052 KB |
testcase_24 | AC | 114 ms
77,308 KB |
testcase_25 | AC | 188 ms
86,652 KB |
testcase_26 | AC | 707 ms
108,240 KB |
testcase_27 | AC | 578 ms
102,068 KB |
testcase_28 | AC | 442 ms
99,368 KB |
testcase_29 | AC | 159 ms
78,460 KB |
testcase_30 | AC | 519 ms
96,860 KB |
testcase_31 | AC | 461 ms
96,296 KB |
testcase_32 | AC | 254 ms
89,212 KB |
testcase_33 | AC | 546 ms
106,240 KB |
testcase_34 | AC | 117 ms
77,180 KB |
testcase_35 | AC | 173 ms
86,256 KB |
testcase_36 | AC | 116 ms
77,180 KB |
testcase_37 | AC | 320 ms
88,188 KB |
testcase_38 | AC | 113 ms
99,964 KB |
testcase_39 | AC | 276 ms
90,492 KB |
testcase_40 | AC | 134 ms
78,332 KB |
testcase_41 | AC | 98 ms
93,116 KB |
testcase_42 | AC | 546 ms
99,544 KB |
testcase_43 | AC | 180 ms
109,308 KB |
testcase_44 | AC | 359 ms
94,716 KB |
testcase_45 | AC | 115 ms
77,180 KB |
testcase_46 | AC | 173 ms
109,308 KB |
testcase_47 | AC | 347 ms
95,100 KB |
testcase_48 | AC | 432 ms
97,548 KB |
testcase_49 | AC | 154 ms
79,228 KB |
testcase_50 | AC | 72 ms
72,456 KB |
testcase_51 | AC | 183 ms
90,748 KB |
testcase_52 | AC | 266 ms
105,732 KB |
testcase_53 | AC | 141 ms
78,332 KB |
testcase_54 | AC | 124 ms
78,204 KB |
testcase_55 | AC | 295 ms
104,792 KB |
testcase_56 | AC | 333 ms
109,552 KB |
testcase_57 | AC | 345 ms
115,088 KB |
testcase_58 | AC | 215 ms
92,540 KB |
testcase_59 | AC | 420 ms
126,092 KB |
testcase_60 | AC | 39 ms
55,608 KB |
testcase_61 | AC | 38 ms
55,608 KB |
testcase_62 | AC | 38 ms
55,608 KB |
ソースコード
from collections import deque class Graph: def __init__(self,V,edges=None,graph=None,directed=False,weighted=False,inf=float("inf")): self.V=V self.directed=directed self.weighted=weighted self.inf=inf if graph!=None: self.graph=graph """ self.edges=[] for i in range(self.V): if self.weighted: for j,d in self.graph[i]: if self.directed or not self.directed and i<=j: self.edges.append((i,j,d)) else: for j in self.graph[i]: if self.directed or not self.directed and i<=j: self.edges.append((i,j)) """ else: self.edges=edges self.graph=[[] for i in range(self.V)] if weighted: for i,j,d in self.edges: self.graph[i].append((j,d)) if not self.directed: self.graph[j].append((i,d)) else: for i,j in self.edges: self.graph[i].append(j) if not self.directed: self.graph[j].append(i) def SIV_BFS(self,s,bfs_tour=False,bipartite_graph=False,linked_components=False,parents=False,unweighted_dist=False,weighted_dist=False): seen=[False]*self.V seen[s]=True if bfs_tour: bt=[s] if linked_components: lc=[s] if parents: ps=[None]*self.V if unweighted_dist or bipartite_graph: uwd=[self.inf]*self.V uwd[s]=0 if weighted_dist: wd=[self.inf]*self.V wd[s]=0 queue=deque([s]) while queue: x=queue.popleft() for y in self.graph[x]: if self.weighted: y,d=y if not seen[y]: seen[y]=True queue.append(y) if bfs_tour: bt.append(y) if linked_components: lc.append(y) if parents: ps[y]=x if unweighted_dist or bipartite_graph: uwd[y]=uwd[x]+1 if weighted_dist: wd[y]=wd[x]+d if bipartite_graph: bg=[[],[]] for tpl in self.edges: i,j=tpl[:2] if self.weighted else tpl if uwd[i]==self.inf or uwd[j]==self.inf: continue if not uwd[i]%2^uwd[j]%2: bg=False break else: for x in range(self.V): if uwd[x]==self.inf: continue bg[uwd[x]%2].append(x) retu=() if bfs_tour: retu+=(bt,) if bipartite_graph: retu+=(bg,) if linked_components: retu+=(lc,) if parents: retu+=(ps,) if unweighted_dist: retu+=(uwd,) if weighted_dist: retu+=(wd,) if len(retu)==1: retu=retu[0] return retu N,M=map(int,input().split()) edges=[] for m in range(M): p,q=map(int,input().split()) p-=1;q-=1 edges.append((p,q)) inf=1<<30 G=Graph(N,edges=edges,inf=inf) Q=int(input()) for q in range(Q): A=int(input())-1 dist=G.SIV_BFS(A,unweighted_dist=True) cnt,ma=-1,1 for d in dist: if d==inf: continue cnt+=1 ma=max(ma,d) ans=(ma-1).bit_length() print(cnt,ans)