oj.uz

Submission #632515

# Submission time Handle Problem Language Result Execution time Memory
632515 2022-08-20T09:14:06 Z karolb2011 Cards (LMIO19_korteles) Python 3
36 / 100
 1000 ms 9324 KB 
import sys
input = sys.stdin.readline
     
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
v0=[[0 for _ in range(26)]for _ in range(26)]
v1=[[0 for _ in range(26)]for _ in range(26)]
h0=[[0 for _ in range(26)]for _ in range(26)]
h1=[[0 for _ in range(26)]for _ in range(26)]
p0=[[0 for _ in range(26)]for _ in range(26)]
p1=[[0 for _ in range(26)]for _ in range(26)]
q0=[[0 for _ in range(26)]for _ in range(26)]
q1=[[0 for _ in range(26)]for _ in range(26)]
for i in range(n):
        a0,a1,ax=list(map(ord,input()))
        b0,b1,bx=list(map(ord,input()))
        a0-=65
        a1-=65
        b0-=65
        b1-=65
        if k[b0][b1][a0][a1]:
            t-=1
        if k[a1][a0][b1][b0]:
            t-=1
        if a1==b0:
                if a0==b1:
                        if k[a1][a0][b1][b0]:
                                t+=3
                t-=p0[a0][b0]
                t-=p1[b1][b0]
                p0[b0][b1]+=1
                p1[b0][a0]+=1
        if a0==b1:
                t-=q0[a1][a0]
                t-=q1[b0][a0]
                q0[a0][b0]+=1
                q1[a0][a1]+=1
        if a0==a1 and b0==b1:
            t-=1
        if a0==b0 and a1==b1:
            t-=1
        k[a0][a1][b0][b1]=True
        v0[a0][b0]+=1
        v1[a1][b1]+=1
        h0[a0][a1]+=1
        h1[b0][b1]+=1
for i in range(26):
    for j in range(26):
            t+=h0[i][j]*h1[i][j]
            t+=v0[i][j]*v1[i][j]
print(t)

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 9084 KB Output is correct
2 Correct 54 ms 9112 KB Output is correct
3 Correct 55 ms 9124 KB Output is correct
4 Correct 52 ms 9076 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 9084 KB Output is correct
2 Correct 54 ms 9112 KB Output is correct
3 Correct 55 ms 9124 KB Output is correct
4 Correct 52 ms 9076 KB Output is correct
5 Correct 54 ms 9052 KB Output is correct
6 Correct 53 ms 9136 KB Output is correct
7 Correct 58 ms 9144 KB Output is correct
8 Correct 62 ms 9024 KB Output is correct
9 Correct 60 ms 9144 KB Output is correct
10 Correct 71 ms 9104 KB Output is correct
11 Correct 56 ms 9080 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1002 ms 9324 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 9080 KB Output is correct
2 Correct 224 ms 9148 KB Output is correct
3 Execution timed out 1089 ms 9272 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 9052 KB Output is correct
2 Correct 53 ms 9136 KB Output is correct
3 Correct 58 ms 9144 KB Output is correct
4 Correct 62 ms 9024 KB Output is correct
5 Correct 60 ms 9144 KB Output is correct
6 Correct 71 ms 9104 KB Output is correct
7 Correct 56 ms 9080 KB Output is correct
8 Correct 54 ms 9084 KB Output is correct
9 Correct 54 ms 9112 KB Output is correct
10 Correct 55 ms 9124 KB Output is correct
11 Correct 52 ms 9076 KB Output is correct
12 Execution timed out 1002 ms 9324 KB Time limit exceeded
13 Halted 0 ms 0 KB -