#918896 (Python3) No.2496 LCM between Permutations

• 問題: No.2496 LCM between Permutations
• ユーザー: mkawa2
• 提出日時: 2023-10-07 00:00:58
• 言語: Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1)
• 結果: AC
• 実行時間: 184 ms / 2,000 ms
• コード長: 2,076 bytes
• コンパイル時間: 367 ms
• コンパイル使用メモリ: 13,056 KB
• 実行使用メモリ: 28,376 KB
• 平均クエリ数: 926.41
• 最終ジャッジ日時: 2024-07-26 17:29:03
• 合計ジャッジ時間: 4,953 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 1
other	AC * 28

ソースコード

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
class Sieve:
    def __init__(self, n):
        self.plist = [2]
        min_prime_factor = [2, 0]*(n//2+1)
        for x in range(3, n+1, 2):
            if min_prime_factor[x] == 0:
                min_prime_factor[x] = x
                self.plist.append(x)
                if x**2 > n: continue
                for y in range(x**2, n+1, 2*x):
                    if min_prime_factor[y] == 0:
                        min_prime_factor[y] = x
        self.min_prime_factor = min_prime_factor
    def isprime(self, x):
        return self.min_prime_factor[x] == x
    def pf(self, x):
        pp, ee = [], []
        while x > 1:
            mpf = self.min_prime_factor[x]
            if pp and mpf == pp[-1]:
                ee[-1] += 1
            else:
                pp.append(mpf)
                ee.append(1)
            x //= mpf
        return pp, ee
    # unsorted
    def factor(self, a):
        ff = [1]
        pp, ee = self.pf(a)
        for p, e in zip(pp, ee):
            ff, gg = [], ff
            w = p
            for _ in range(e):
                for f in gg: ff.append(f*w)
                w *= p
            ff += gg
        return ff
from functools import lru_cache
@lru_cache(None)
def ask(i, j):
    print("?", i+1, j+1, flush=True)
    res = int(input())
    return res
n = int(input())
if n==1:
    print("!",1,1,flush=True)
    exit()
sv = Sieve(n)
p = sv.plist[-1]
aa = [0]*n
bb = [0]*n
for j in range(n):bb[j] = ask(0, j)
aa[0]=min(bb)
if aa[0]==p:
    for j in range(n):bb[j]//=p
    jj=[]
    for j in range(n):
        if bb[j]==1:jj.append(j)
    l,r=jj
    if ask(1,l)%p:
        j1=l
        bb[r]=p
    else:
        j1=r
        bb[l]=p
    for i in range(n):aa[i]=ask(i,j1)
else:
    jp=0
    while bb[jp]!=aa[0]*p:jp+=1
    for i in range(1,n):aa[i]=ask(i,jp)//p
    ii=[]
    for i in range(n):
        if aa[i]==1:ii.append(i)
    l,r=ii
    j=0
    if j==jp:j=1
    if ask(l,j)%p:
        i1=l
        aa[r]=p
    else:
        i1=r
        aa[l]=p
    for j in range(n):bb[j]=ask(i1,j)
print("!", *aa, *bb, flush=True)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX