Submission #17502429


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][k]+dp[k+1][j]+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 541 Byte
Status
Exec Time 204 ms
Memory 9420 KB

Judge Result

Set Name All
Score / Max Score 0 / 5
Status
× 2
× 5
Set Name Test Cases
All 00, 01, 02, 03, 04, 90, 91
Case Name Status Exec Time Memory
00 154 ms 9368 KB
01 90 ms 9420 KB
02 202 ms 9224 KB
03 204 ms 9300 KB
04 151 ms 9300 KB
90 21 ms 8880 KB
91 25 ms 8960 KB