結果
問題 | No.2494 Sum within Components |
ユーザー | Shirotsume |
提出日時 | 2023-10-06 21:27:52 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 368 ms / 2,000 ms |
コード長 | 2,267 bytes |
コンパイル時間 | 337 ms |
コンパイル使用メモリ | 87,212 KB |
実行使用メモリ | 134,396 KB |
最終ジャッジ日時 | 2023-10-06 21:27:58 |
合計ジャッジ時間 | 5,221 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 110 ms
74,652 KB |
testcase_01 | AC | 108 ms
74,236 KB |
testcase_02 | AC | 110 ms
74,736 KB |
testcase_03 | AC | 112 ms
74,324 KB |
testcase_04 | AC | 108 ms
74,416 KB |
testcase_05 | AC | 114 ms
74,424 KB |
testcase_06 | AC | 108 ms
74,312 KB |
testcase_07 | AC | 109 ms
74,424 KB |
testcase_08 | AC | 109 ms
74,496 KB |
testcase_09 | AC | 172 ms
82,032 KB |
testcase_10 | AC | 192 ms
83,800 KB |
testcase_11 | AC | 149 ms
82,076 KB |
testcase_12 | AC | 209 ms
84,796 KB |
testcase_13 | AC | 197 ms
83,804 KB |
testcase_14 | AC | 323 ms
106,652 KB |
testcase_15 | AC | 303 ms
96,260 KB |
testcase_16 | AC | 239 ms
105,100 KB |
testcase_17 | AC | 221 ms
134,396 KB |
testcase_18 | AC | 258 ms
133,840 KB |
testcase_19 | AC | 368 ms
119,484 KB |
ソースコード
import sys, time, random from collections import deque, Counter, defaultdict input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 class dsu(): n=1 parent_or_size=[-1 for i in range(n)] def __init__(self,N): self.n=N self.num = N self.parent_or_size=[-1 for i in range(N)] def merge(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) x=self.leader(a) y=self.leader(b) if x==y: return x self.num -= 1 if (-self.parent_or_size[x]<-self.parent_or_size[y]): x,y=y,x self.parent_or_size[x]+=self.parent_or_size[y] self.parent_or_size[y]=x return x def same(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) return self.leader(a)==self.leader(b) def leader(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) if (self.parent_or_size[a]<0): return a self.parent_or_size[a]=self.leader(self.parent_or_size[a]) return self.parent_or_size[a] def size(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) return -self.parent_or_size[self.leader(a)] def groups(self): leader_buf=[0 for i in range(self.n)] group_size=[0 for i in range(self.n)] for i in range(self.n): leader_buf[i]=self.leader(i) group_size[leader_buf[i]]+=1 result=[[] for i in range(self.n)] for i in range(self.n): result[leader_buf[i]].append(i) result2=[] for i in range(self.n): if len(result[i])>0: result2.append(result[i]) return result2 def count(self): return self.num n, m = mi() a = li() U = dsu(n) for _ in range(m): u, v = mi() u -= 1; v -= 1 U.merge(u, v) ans = 1 for v in U.groups(): cnt = 0 for x in v: cnt += a[x] ans *= pow(cnt, len(v), mod) ans %= mod print(ans)