제출 #1289212

#제출 시각아이디문제언어결과실행 시간메모리
1289212Joon_YorigamiBitaro the Brave (JOI19_ho_t1)Pypy 3
50 / 100
420 ms339968 KiB
t=1
while t:
    t-=1
    n,m=map(int,input().split())
    owo=n
    grid=[]
    while owo:
        owo-=1
        grid.append([*input().strip()])
    #J  O
    #I
    for i in range(n):
        cnt=0
        for j in range(m-1,-1,-1):
            if grid[i][j]=="O":
                cnt+=1
                continue
            if grid[i][j]=="J":
                grid[i][j]=cnt
                continue
    total=0
    for j in range(m):
        cnt=0
        for i in range(n-1,-1,-1):
            if grid[i][j]=="I":
                cnt+=1
                continue
            if grid[i][j]!="O":
                total+=grid[i][j]*cnt
                continue
    print(total)

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'joi2019_ho_t1.py'...

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

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...