結果
問題 | No.2045 Two Reflections |
ユーザー |
|
提出日時 | 2022-05-17 14:29:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 123 ms / 2,000 ms |
コード長 | 2,470 bytes |
コンパイル時間 | 148 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 97,280 KB |
最終ジャッジ日時 | 2024-09-20 03:07:26 |
合計ジャッジ時間 | 3,570 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
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, p, q = map(int,input().split()) mod = 998244353 a = list(range(0, n)) for i in range(p // 2): a[i], a[p - i - 1] = a[p - i - 1], a[i] for i in range(q // 2): a[n - q + i], a[n - i - 1] = a[n - i - 1], a[n - q + i] U = dsu(n) for i in range(n): U.merge(i, a[i]) count = [0] * (n + 1) for v in U.groups(): x = len(v) for i in range(2, 10 ** 5 + 1): if x == 1: break cnt = 0 while x % i == 0: x //= i cnt += 1 count[i] = max(cnt, count[i]) ans = 1 for i in range(1, n + 1): if count[i] >= 1: ans *= pow(i, count[i]) ans %= mod if p > 1 and q > 1: ans *= 2 ans %= mod print(ans)