oj.uz

Submission #790209

# Submission time Handle Problem Language Result Execution time Memory
790209 2023-07-22T12:08:01 Z beaconmc Necklace (Subtask 1-3) (BOI19_necklace1) PyPy 3
17 / 85
 443 ms 161196 KB 
a = input()
b = input()

maxi = 0
ans = []
for qq in range(2):
    dp = [[0 for i in range(len(b)+1)]for j in range(len(a)+1)]

    for i in range(1, len(a)+1):
        for j in range(1, len(b)+1):
            if a[i-1] == b[j-1]:
                dp[i][j] = dp[i-1][j-1] + 1
            else:
                dp[i][j] = 0

    if maxi < max([max(i) for i in dp]):
        maxi = max([max(i) for i in dp])
        ans = 0
        for i in range(1, len(a)+1):
            for j in range(1, len(b)+1):
                if dp[i][j] == maxi:
                    if qq == 1:
                        ans = [i-maxi,len(b)-j]
                    else:
                        ans = [i-maxi,j-maxi]
    b = b[::-1]
print(maxi)
print(ans[0], ans[1])

Subtask #1
5.0 / 25.0

# Verdict Execution time Memory Grader output
1 Partially correct 45 ms 19912 KB Output is partially correct
2 Partially correct 41 ms 19364 KB Output is partially correct
3 Partially correct 47 ms 19924 KB Output is partially correct
4 Partially correct 43 ms 19660 KB Output is partially correct
5 Partially correct 44 ms 19736 KB Output is partially correct

Subtask #2
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 45 ms 19912 KB Output is partially correct
2 Partially correct 41 ms 19364 KB Output is partially correct
3 Partially correct 47 ms 19924 KB Output is partially correct
4 Partially correct 43 ms 19660 KB Output is partially correct
5 Partially correct 44 ms 19736 KB Output is partially correct
6 Partially correct 57 ms 23056 KB Output is partially correct
7 Partially correct 53 ms 22640 KB Output is partially correct
8 Partially correct 62 ms 22604 KB Output is partially correct
9 Partially correct 53 ms 22676 KB Output is partially correct
10 Partially correct 58 ms 22692 KB Output is partially correct
11 Partially correct 56 ms 22232 KB Output is partially correct
12 Partially correct 66 ms 22608 KB Output is partially correct

Subtask #3
8.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 45 ms 19912 KB Output is partially correct
2 Partially correct 41 ms 19364 KB Output is partially correct
3 Partially correct 47 ms 19924 KB Output is partially correct
4 Partially correct 43 ms 19660 KB Output is partially correct
5 Partially correct 44 ms 19736 KB Output is partially correct
6 Partially correct 57 ms 23056 KB Output is partially correct
7 Partially correct 53 ms 22640 KB Output is partially correct
8 Partially correct 62 ms 22604 KB Output is partially correct
9 Partially correct 53 ms 22676 KB Output is partially correct
10 Partially correct 58 ms 22692 KB Output is partially correct
11 Partially correct 56 ms 22232 KB Output is partially correct
12 Partially correct 66 ms 22608 KB Output is partially correct
13 Partially correct 420 ms 161196 KB Output is partially correct
14 Partially correct 378 ms 161072 KB Output is partially correct
15 Partially correct 357 ms 153244 KB Output is partially correct
16 Partially correct 430 ms 159612 KB Output is partially correct
17 Partially correct 388 ms 156296 KB Output is partially correct
18 Partially correct 359 ms 160124 KB Output is partially correct
19 Partially correct 386 ms 159732 KB Output is partially correct
20 Partially correct 366 ms 156124 KB Output is partially correct
21 Partially correct 443 ms 157652 KB Output is partially correct