提出 #72199982

---

ソースコード 拡げる

N=int(input())
A=list(map(int,input().split()))
B=sorted(A)
D=[]
DS=set()
T=[]
last=-1
for i in range(N) :
    if B[i]!=last :
        D.append(B[i])
    DS.add(B[i])
    last=B[i]
C=[0 for i in range(len(D))]
R={}
for i in range(len(D)) :
    R[D[i]]=i
for i in range(N) :
    C[R[A[i]]]+=1
E=[]
ES=set()
ans=0
for i in range(len(D)) :
    if D[i]%5==0 :
        if (D[i]//5)*3 in DS and (D[i]//5)*7 in DS:
            E.append(D[i])
            ES.add(D[i])
            ans+=C[R[(D[i]//5)*3]]*C[R[(D[i]//5)*7]]*C[i]
RE={}
for i in range(len(E)) :
    RE[E[i]]=i
F=[[] for i in range(len(E))]
for i in range(N) :
    if A[i] in ES :
        F[RE[A[i]]].append(5)
    if A[i]%3==0 and (A[i]//3)*5 in ES :
        F[RE[(A[i]//3)*5]].append(3)
    if A[i]%7==0 and (A[i]//7)*5 in ES :
        F[RE[(A[i]//7)*5]].append(7)
for t in range(len(F)) :
    M=len(F[t])
    P=[0 for i in range(M+1)]
    Q=[0 for i in range(M+1)]
    R=[0 for i in range(M+1)]
    for i in range(M) :
        if F[t][i]==3 :
            P[i]=P[i-1]+1
        else :
            P[i]=P[i-1]
        if F[t][i]==5 :
            Q[i]=Q[i-1]+P[i-1]
        else :
            Q[i]=Q[i-1]
        if F[t][i]==7 :
            R[i]=R[i-1]+Q[i-1]
        else :
            R[i]=R[i-1]
    ans-=R[-2]
    M=len(F[t])
    P=[0 for i in range(M+1)]
    Q=[0 for i in range(M+1)]
    R=[0 for i in range(M+1)]
    for i in range(M) :
        if F[t][-1-i]==3 :
            P[i]=P[i-1]+1
        else :
            P[i]=P[i-1]
        if F[t][-1-i]==5 :
            Q[i]=Q[i-1]+P[i-1]
        else :
            Q[i]=Q[i-1]
        if F[t][-1-i]==7 :
            R[i]=R[i-1]+Q[i-1]
        else :
            R[i]=R[i-1]
    ans-=R[-2]
print(ans)

提出情報

ジャッジ結果