結果
問題 | No.1813 Magical Stones |
ユーザー | ygd. |
提出日時 | 2022-01-14 23:58:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 976 ms / 2,000 ms |
コード長 | 4,116 bytes |
コンパイル時間 | 293 ms |
コンパイル使用メモリ | 82,540 KB |
実行使用メモリ | 119,816 KB |
最終ジャッジ日時 | 2024-04-30 18:41:20 |
合計ジャッジ時間 | 19,344 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
54,308 KB |
testcase_01 | AC | 43 ms
54,440 KB |
testcase_02 | AC | 42 ms
53,764 KB |
testcase_03 | AC | 148 ms
101,092 KB |
testcase_04 | AC | 44 ms
54,204 KB |
testcase_05 | AC | 45 ms
53,712 KB |
testcase_06 | AC | 122 ms
78,160 KB |
testcase_07 | AC | 45 ms
54,592 KB |
testcase_08 | AC | 60 ms
64,352 KB |
testcase_09 | AC | 72 ms
72,256 KB |
testcase_10 | AC | 49 ms
56,752 KB |
testcase_11 | AC | 379 ms
88,336 KB |
testcase_12 | AC | 43 ms
54,352 KB |
testcase_13 | AC | 42 ms
56,048 KB |
testcase_14 | AC | 140 ms
101,224 KB |
testcase_15 | AC | 914 ms
111,236 KB |
testcase_16 | AC | 915 ms
111,144 KB |
testcase_17 | AC | 839 ms
119,816 KB |
testcase_18 | AC | 916 ms
112,024 KB |
testcase_19 | AC | 923 ms
111,356 KB |
testcase_20 | AC | 976 ms
111,272 KB |
testcase_21 | AC | 964 ms
112,824 KB |
testcase_22 | AC | 937 ms
110,908 KB |
testcase_23 | AC | 905 ms
111,544 KB |
testcase_24 | AC | 98 ms
77,160 KB |
testcase_25 | AC | 295 ms
83,416 KB |
testcase_26 | AC | 176 ms
78,392 KB |
testcase_27 | AC | 748 ms
103,220 KB |
testcase_28 | AC | 718 ms
100,504 KB |
testcase_29 | AC | 769 ms
103,176 KB |
testcase_30 | AC | 775 ms
102,132 KB |
testcase_31 | AC | 868 ms
110,192 KB |
testcase_32 | AC | 43 ms
53,572 KB |
testcase_33 | AC | 44 ms
54,852 KB |
testcase_34 | AC | 154 ms
78,232 KB |
testcase_35 | AC | 130 ms
77,360 KB |
testcase_36 | AC | 110 ms
77,492 KB |
testcase_37 | AC | 274 ms
81,760 KB |
testcase_38 | AC | 199 ms
94,144 KB |
testcase_39 | AC | 714 ms
103,696 KB |
testcase_40 | AC | 148 ms
78,408 KB |
testcase_41 | AC | 87 ms
76,560 KB |
testcase_42 | AC | 132 ms
78,056 KB |
testcase_43 | AC | 228 ms
80,004 KB |
ソースコード
import sys #input = sys.stdin.readline #文字列につけてはダメ input = sys.stdin.buffer.readline #文字列につけてはダメ #sys.setrecursionlimit(1000000) #import bisect #import itertools #import random from heapq import heapify, heappop, heappush #from collections import defaultdict #from collections import deque #import copy #import math #from functools import lru_cache #MOD = pow(10,9) + 7 #MOD = 998244353 class UnionFind(object): def __init__(self, n=1): self.par = [i for i in range(n)] self.rank = [0 for _ in range(n)] self.size = [1 for _ in range(n)] def find(self, x): """ x が属するグループを探索して親を出す。 """ if self.par[x] == x: return x else: self.par[x] = self.find(self.par[x]) return self.par[x] def union(self, x, y): """ x と y のグループを結合 """ x = self.find(x) y = self.find(y) if x != y: if self.rank[x] < self.rank[y]: x, y = y, x if self.rank[x] == self.rank[y]: self.rank[x] += 1 self.par[y] = x self.size[x] += self.size[y] def is_same(self, x, y): """ x と y が同じグループか否か """ return self.find(x) == self.find(y) def get_size(self, x): """ x が属するグループの要素数 """ x = self.find(x) return self.size[x] def topological(graph, deg): start = [] for i in range(len(deg)): if deg[i] == 0: start.append(i) topo = [] while start: v = start.pop() topo.append(v) for u in graph[v]: deg[u] -= 1 if deg[u] == 0: start.append(u) return topo #https://atcoder.jp/contests/arc030/submissions/20496099より拝借 def scc_dfs1(s, links, status, postorder): stack = [s] status[s] = 0 while stack: v = stack[-1] limit = len(links[v]) while status[v] < limit: u = links[v][status[v]] status[v] += 1 if status[u] != -1: continue stack.append(u) status[u] = 0 break else: stack.pop() postorder.append(v) return def scc_dfs2(s, rev_links, status): stack = [s] status[s] = -1 scc = [s] while stack: v = stack.pop() for u in rev_links[v]: if status[u] != -1: stack.append(u) status[u] = -1 scc.append(u) scc.reverse() #ループの順番が正の順番になるようにする。#要注意 return scc def strongly_connected_components(n, links, rev_links): status = [-1] * n postorder = [] for v in range(n): if status[v] != -1: continue scc_dfs1(v, links, status, postorder) postorder.reverse() sccs = [] for v in postorder: if status[v] == -1: continue sccs.append(scc_dfs2(v, rev_links, status)) return sccs #DAG順になったグループごとのリスト def main(): N,M = map(int,input().split()) G = [[] for _ in range(N)] RG = [[] for _ in range(N)] uf = UnionFind(N) for i in range(M): a,b = map(int,input().split()) a -= 1; b -= 1 G[a].append(b) RG[b].append(a) uf.union(a,b) L = strongly_connected_components(N,G,RG) if len(L) == 1: print(0);exit() #print(L) label = [-1]*N for i in range(len(L)): for x in L[i]: label[x] = i #print(label) IN = [0]*len(L) OUT = [0]*len(L) for v in range(N): for u in G[v]: if label[v] == label[u]: continue IN[label[v]] += 1 for u in RG[v]: if label[v] == label[u]: continue OUT[label[v]] += 1 #print(IN,OUT) ans = max(IN.count(0), OUT.count(0)) print(ans) if __name__ == '__main__': main()