Submission #17502145


Source Code Expand

Copy
S=str(input())
 
dp = [[0]*(len(S)) for _ in range(len(S))]
 
for w in range(2,len(S)+1):
    for i in range(len(S)):
        j=w+i
        if j>=len(S):
            continue
        if S[i:j+1]=="iwi":
            dp[i][j]=1
            continue

        if (w+1)%3==0:
             if S[i]=="i" and S[j]=="i":
                 for k in range(i+1,j-1):
                     if S[k]=="w":
                         dp[i][j]=max(dp[i][j],dp[i+1][k]+dp[k+1][j-1]+1)
        else:
            dp[i][j]=dp[i][j-1]
    
print(dp[0][-1])

Submission Info

Submission Time
Task I - イウィ
User Matsuda123
Language Python (3.8.2)
Score 0
Code Size 551 Byte
Status
Exec Time 227 ms
Memory 9388 KB

Judge Result

Set Name All
Score / Max Score 0 / 5
Status
× 1
× 6
Set Name Test Cases
All 00, 01, 02, 03, 04, 90, 91
Case Name Status Exec Time Memory
00 162 ms 9164 KB
01 93 ms 9388 KB
02 227 ms 9388 KB
03 201 ms 9172 KB
04 155 ms 9180 KB
90 30 ms 9088 KB
91 30 ms 8836 KB