Submission #591618

# Submission time Handle Problem Language Result Execution time Memory
591618 2022-07-07T17:02:54 Z Baartifispa Cards (LMIO19_korteles) Python 3
0 / 100
1000 ms 46584 KB
ilosc = int(input())
tab = []
d = 0
wynik = 0
for i in range(ilosc):    
    a = input()
    b = input()
    tab.append(a+b)

print(tab)
for i in range(ilosc):
    for y in range(i+1,ilosc):
        if (tab[i][0] == tab[y][2] and tab[i][1] == tab[y+d][3]):
            wynik += 1
            continue
        if (tab[i][1] == tab[y][0] and tab[i][3] == tab[y][2]):
            wynik += 1
            continue
        if (tab[i][2] == tab[y][0] and tab[i][3] == tab[y][1]):
            wynik += 1
            continue
        if (tab[i][0] == tab[y][1] and tab[i][2] == tab[y][3]):
            wynik += 1
print(wynik)
# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 2772 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 2772 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 46584 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -