Submission #46290764

---

Source Code Expand

import sys
from functools import lru_cache
from collections import defaultdict


sys.setrecursionlimit(10**9)
def I(): return input()
def IS(): return input().split()
def II(): return int(input())
def LI(): return list(input())
def MI(): return map(int,input().split())
def LMI(): return list(map(int,input().split()))
def LLMI(number): return [list(map(int,input().split())) for _ in range(number)]

def generate_input()->list:
    import random
    inputdata = []
    n = random.randint(0, 100)
    inputdata.append(n)
    return inputdata


def simple_solve(n):
    ans = 0
    return ans


def solve(n, matrix):
    wincnt = defaultdict(list)
    for i, m in enumerate(matrix):
        cnt = 0
        for r in m:
            if r == 'o':
                cnt += 1
        wincnt[cnt].append(i+1)
    ans = []
    for i in range(n, -1, -1):
        if len(wincnt[i]) > 0:
            wincnt[i].sort()
            for v in wincnt[i]:
                ans.append(v)
    return ans


if __name__=='__main__':
    test = False
    if test:
        inputdata = generate_input()
        a = simple_solve(*inputdata)
        b = solve(*inputdata)
        if a != b:
            print(*inputdata)
            print(a, b)
            exit(1)
    else:
        inputdata = []
        inputdata.append(II())
        ox = []
        for x in range(inputdata[0]):
            ox.append(LI())
        inputdata.append(ox)
        print(*solve(*inputdata))

Submission Info

Judge Result