oj.uz

Submission #631704

# Submission time Handle Problem Language Result Execution time Memory
631704 2022-08-18T13:52:47 Z karolb2011 Cards (LMIO19_korteles) Python 3
55 / 100
 1000 ms 9292 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
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()
    a0=ord(a[0])-65
    a1=ord(a[1])-65
    b0=ord(b[0])-65
    b1=ord(b[1])-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
        for j in range(26):
            if k[j][a0][a0][b0]:
                t-=1
            if k[a1][b1][b1][j]:
                t-=1
    if a0==b1:
        for j in range(26):
            if k[a1][j][b1][a1]:
                t-=1
            if k[b0][a0][j][b0]:
                t-=1
    if a0==a1 and b0==b1:
        t-=1
    if a0==b0 and a1==b1:
        t-=1
    k[a0][a1][b0][b1]=True
    v[a0][b0][0]+=1
    v[a1][b1][1]+=1
    h[a0][a1][0]+=1
    h[b0][b1][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)

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 9044 KB Output is correct
2 Correct 51 ms 9072 KB Output is correct
3 Correct 53 ms 9024 KB Output is correct
4 Correct 52 ms 9104 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 9044 KB Output is correct
2 Correct 51 ms 9072 KB Output is correct
3 Correct 53 ms 9024 KB Output is correct
4 Correct 52 ms 9104 KB Output is correct
5 Correct 51 ms 9164 KB Output is correct
6 Correct 56 ms 9032 KB Output is correct
7 Correct 62 ms 9164 KB Output is correct
8 Correct 61 ms 9048 KB Output is correct
9 Correct 70 ms 9164 KB Output is correct
10 Correct 69 ms 9292 KB Output is correct
11 Correct 57 ms 9124 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 9124 KB Output is correct
2 Correct 185 ms 9220 KB Output is correct
3 Correct 874 ms 9156 KB Output is correct
4 Correct 547 ms 9244 KB Output is correct
5 Correct 547 ms 9208 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 9164 KB Output is correct
2 Correct 56 ms 9032 KB Output is correct
3 Correct 62 ms 9164 KB Output is correct
4 Correct 61 ms 9048 KB Output is correct
5 Correct 70 ms 9164 KB Output is correct
6 Correct 69 ms 9292 KB Output is correct
7 Correct 57 ms 9124 KB Output is correct
8 Correct 53 ms 9044 KB Output is correct
9 Correct 51 ms 9072 KB Output is correct
10 Correct 53 ms 9024 KB Output is correct
11 Correct 52 ms 9104 KB Output is correct
12 Execution timed out 1082 ms 9240 KB Time limit exceeded
13 Halted 0 ms 0 KB -