oj.uz

답안 #731065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
731065 2023-04-26T21:27:13 Z Boomyday Palindrome-Free Numbers (BOI13_numbers) PyPy 3
60.4167 / 100
 60 ms 19656 KB 
a, b = map(int, input().split())




dp = [[[0 for i in range(11)] for i in range(11)] for i in range(20)]
dp[0][10][10] = 1


for dig in range(1, 19):

    for cur in range(10):
        for prev in range(11):
            if cur == prev:

                continue
            for prev2 in range(11):
                if prev2 == cur:

                    continue
                dp[dig][cur][prev] += dp[dig-1][prev][prev2]


## dig = 1


##d = 5


"""
ans = 1
for dig in range(1, d+1):
    for cur in range(1, 11):
        for prev in range(11):
            ans += dp[dig][cur][prev]

"""


def solve(x):

    if x == 0:
        return 0
    ans = 1
    x = list(str(x))

    for dig in range(1, len(x)):
        for cur in range(1, 11):
            for prev in range(11):
                ans += dp[dig][cur][prev]

    #print(ans)

    chk = [11,11]
    bad = False
    for i, ch in enumerate(x):
        #if i == len(x)-1:   continue
        d = len(x) - i

        #print(d, ch)
        val = int(ch)
        for cur in range(0, val):
            if bad:
                continue
            if chk[-1] == chk[-2] and chk[-1] != 11:
                bad = True
                continue
            if chk[-1] == 11 and cur == 0:
                continue
            if cur == chk[-1] or cur == chk[-2]:
                continue
            for prev in range(11):
                if prev == chk[-1]: continue
                ans += dp[d][cur][prev]

        #print(ans)
        chk[-2] = chk[-1]
        chk[-1] = val

    return ans


print(solve(b+1)-solve(a))

"""

ans_brute = 0

for n in range(a, b+1):
    st = str(n)
    is_pal = False

    for l in range(len(st)):
        for r in range(l+2, len(st)+1):
            if st[l:r] == st[l:r][::-1]:
                is_pal = True

    if not is_pal:
        ans_brute+=1


print(ans_brute)
#print(ans, ans_brute)"""

Subtask #1
23.75 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 19340 KB Output is correct
2 Correct 53 ms 19344 KB Output is correct
3 Correct 56 ms 19656 KB Output is correct
4 Correct 46 ms 19240 KB Output is correct
5 Correct 46 ms 19240 KB Output is correct
6 Correct 48 ms 19184 KB Output is correct
7 Correct 52 ms 19204 KB Output is correct
8 Correct 47 ms 19380 KB Output is correct
9 Correct 49 ms 19224 KB Output is correct
10 Correct 52 ms 19152 KB Output is correct
11 Correct 48 ms 19200 KB Output is correct
12 Correct 47 ms 19152 KB Output is correct
13 Correct 46 ms 19180 KB Output is correct
14 Correct 47 ms 19192 KB Output is correct
15 Correct 47 ms 19420 KB Output is correct
16 Incorrect 51 ms 19252 KB Output isn't correct
17 Correct 49 ms 19412 KB Output is correct
18 Correct 46 ms 19384 KB Output is correct
19 Correct 51 ms 19296 KB Output is correct
20 Correct 49 ms 19236 KB Output is correct

Subtask #2
36.6666666667 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 19372 KB Output is correct
2 Incorrect 51 ms 19348 KB Output isn't correct
3 Incorrect 60 ms 19400 KB Output isn't correct
4 Incorrect 52 ms 19408 KB Output isn't correct
5 Correct 48 ms 19588 KB Output is correct
6 Correct 49 ms 19364 KB Output is correct
7 Correct 47 ms 19340 KB Output is correct
8 Correct 49 ms 19624 KB Output is correct
9 Incorrect 48 ms 19172 KB Output isn't correct
10 Correct 54 ms 19212 KB Output is correct
11 Correct 53 ms 19368 KB Output is correct
12 Correct 48 ms 19324 KB Output is correct
13 Correct 51 ms 19348 KB Output is correct
14 Correct 49 ms 19360 KB Output is correct
15 Incorrect 50 ms 19496 KB Output isn't correct
16 Incorrect 51 ms 19504 KB Output isn't correct
17 Incorrect 49 ms 19336 KB Output isn't correct
18 Incorrect 50 ms 19372 KB Output isn't correct
19 Incorrect 49 ms 19360 KB Output isn't correct
20 Incorrect 51 ms 19328 KB Output isn't correct
21 Incorrect 52 ms 19488 KB Output isn't correct
22 Incorrect 50 ms 19496 KB Output isn't correct
23 Incorrect 55 ms 19356 KB Output isn't correct
24 Correct 54 ms 19316 KB Output is correct
25 Incorrect 53 ms 19604 KB Output isn't correct
26 Incorrect 49 ms 19420 KB Output isn't correct
27 Correct 55 ms 19328 KB Output is correct
28 Incorrect 49 ms 19368 KB Output isn't correct
29 Correct 51 ms 19300 KB Output is correct
30 Correct 50 ms 19464 KB Output is correct
31 Correct 51 ms 19372 KB Output is correct
32 Correct 49 ms 19296 KB Output is correct
33 Correct 51 ms 19352 KB Output is correct
34 Incorrect 49 ms 19340 KB Output isn't correct
35 Correct 51 ms 19472 KB Output is correct
36 Incorrect 54 ms 19496 KB Output isn't correct
37 Correct 50 ms 19332 KB Output is correct
38 Incorrect 52 ms 19492 KB Output isn't correct
39 Incorrect 50 ms 19476 KB Output isn't correct
40 Correct 50 ms 19312 KB Output is correct
41 Correct 57 ms 19336 KB Output is correct
42 Correct 49 ms 19368 KB Output is correct
43 Incorrect 48 ms 19368 KB Output isn't correct
44 Incorrect 56 ms 19496 KB Output isn't correct
45 Incorrect 51 ms 19396 KB Output isn't correct