제출 #631129

#제출 시각아이디문제언어결과실행 시간메모리
631129karolb2011Cards (LMIO19_korteles)Cpython 3
0 / 100
1089 ms10256 KiB
n=int(input())
k=[[[[False for i in range(26)]for j in range(26)]for m in range(26)]for _ in range(26)]
c=[]
t=0
v=[[[0,0]for _ in range(26)]for _ in range(26)]
h=[[[0,0]for _ in range(26)]for _ in range(26)]
for i in range(n):
    a=input()
    b=input()
    if k[ord(b[0])-65][ord(b[1])-65][ord(a[0])-65][ord(a[1])-65]:
        t-=1
    if k[ord(a[1])-65][ord(a[0])-65][ord(b[1])-65][ord(b[0])-65]:
        t-=1
    k[ord(a[0])-65][ord(a[1])-65][ord(b[0])-65][ord(b[1])-65]=True
    v[ord(a[0])-65][ord(b[0])-65][0]+=1
    v[ord(a[1])-65][ord(b[1])-65][1]+=1
    h[ord(a[0])-65][ord(a[1])-65][0]+=1
    h[ord(b[0])-65][ord(b[1])-65][1]+=1
for i in range(26):
    for j in range(26):
        t+=h[i][j][0]*h[i][j][1]
        t+=v[i][j][0]*v[i][j][1]
print(t)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...