#503859 (PyPy3) No.101 ぐるぐる！あみだくじ！

• 問題: No.101 ぐるぐる！あみだくじ！
• ユーザー: 👑 Kazun
• 提出日時: 2020-06-27 03:31:24
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 69 ms / 5,000 ms
• コード長: 2,710 bytes
• コンパイル時間: 168 ms
• コンパイル使用メモリ: 82,432 KB
• 実行使用メモリ: 65,408 KB
• 最終ジャッジ日時: 2024-07-05 08:05:25
• 合計ジャッジ時間: 3,690 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 37

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
class Permutation_Error(Exception):
    pass
class Permutation():
    def __init__(self,n,p=[]):
        if p==[]:
            self.p=[i for i in range(n)]
        else:
            self.p=p
            
        self.n=n
    def __str__(self):
        return "["+", ".join(map(str,self.p))+"]"
    def __mul__(self,other):
        T=[]
        n=max(self.n,other.n)
        for i in range(n):
            T.append(self.Replace(other.Replace(i)))
        return Permutation(n,T)
    def __truediv__(self,other):
        pass
    def __sgn__(self):
        if self.Minimum_Transposition()%2:
            return -1
        else:
            return 1
        
    def Inverse(self):
        Q=list(range(self.n))
        for k in range(self.n):
            Q[self.p[k]]=k
        return Permutation(self.n,Q)
    def Transposition(self,u,v):
        a=self.p.index(u)
        b=self.p.index(v)
        
        self.p[a]=v
        self.p[b]=u
    def Minimum_Transposition(self):
        X=self.Cycle_Division()
        T=0
        for d in X:
            T+=len(d)-1
        return T
    
    def Cycle_Multiplication(self,*C):
        X=[self.p.index(k) for k in C]
        N=len(C)
        for i in range(N):
            self.p[X[i]]=C[(i+1)%N]
    def Cycle_Division(self):
        T=[False]*self.n
        k=0
        v=0
        A=[]
        for k in range(self.n):
            if (not T[k]) and self.p[k]!=k:
                v=k
                B=[k]
                while self.p[v]!=k:
                    v=self.p[v]
                    T[v]=True
                    B.append(v)
                A.append(B)
        return A
            
    def Replace(self,x):
        if x<self.n:
            return self.p[x]
        else:
            return x
    def Order(self):
        L=self.Cycle_Division()
        C=[]
        for K in L:
            C.append(len(K))
        if C:
            return LCM(*C)
        else:
            return 1
    
#-------------------------------------------------
def Is_Identity(P):
    return self.p==list(range(self.n))
    
#以下Orderを用いる時に必要
#最大公約数
def gcd(m,n):
    x,y=max(m,n),min(m,n)
    if x%y==0:
        return y
    else:
        while x%y!=0:
            z=x%y
            x,y=y,z
        else:
            return z
        
from functools import reduce
def GCD(*X):
    return reduce(gcd,X)
#最小公倍数
def lcm(m,n):
    return (m//gcd(m,n))*n
def LCM(*X):
    return reduce(lcm,X)
#-------------------------------------------------------------------------------
N=int(input())
K=int(input())
P=Permutation(N+1)
for _ in range(K):
    a,b=map(int,input().split())
    P.Transposition(a,b)
print(P.Order())
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX