Submission #1289202

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289202		Joon_Yorigami	Bitaro the Brave (JOI19_ho_t1)	Pypy 3	50 / 100	471 ms	339968 KiB

joi2019_ho_t1

t=1
while t:
    t-=1
    n,m=map(int,input().split())
    grid=[]
    for _ in" "*n:
        grid.append([*input().strip()])
    #J  O
    #I
    horse=[]
    bird=[]
    for i in range(n):
        arr=[0]
        for j in range(m):
            arr.append((grid[i][j]=="O")+arr[-1])
        horse.append(arr)
    for j in range(m):
        arr=[0]
        for i in range(n):
            arr.append((grid[i][j]=="I")+arr[-1])
        bird.append(arr)
    total=0
    for i in range(n):
        for j in range(m):
            if grid[i][j]!="J":
                continue
            x=horse[i][-1]-horse[i][j]
            y=bird[j][-1]-bird[j][i]
            total+=x*y
    print(total)

Compilation message (stdout)

Compiling 'joi2019_ho_t1.py'...

=======
  adding: __main__.pyc (deflated 32%)

=======

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 0 / 50