Submission #68750137

---

Source Code Expand

import sys

# import numpy as np
# <nonumba> from numba import njit, jit, boolean, int64, float64, typeof

def main():
    from io import StringIO
    execute(StringIO(sample), sys.stderr)
    print("-- ^sample! --", file=sys.stderr)

    execute(sys.stdin, sys.stdout)

    # #<nonumba> if len(solve.nopython_signatures) != 1:
    # #<nonumba>     raise KeyboardInterrupt("!! Unexpected: wrong use of jit !!")

def execute(src, dst):


    N, M, = map(int, src.readline().split())
    Ss =  [src.readline().strip() for _i in range(N)]
    ans = solve(N, M, Ss)
    print(*ans, sep=" ", file=dst)

sample = """\
3 5
11100
10101
01110
"""

# #<nonumba> @jit(nopython=True, cache=True)
def solve(N, M, Ss):
    scores0 = [0] * N
    for m0 in range(M):
        cnt = {"0": 0 , "1": 0}
        for n0 in range(N):
            cnt[Ss[n0][m0]] += 1

        if cnt["0"] == 0 or  cnt["1"] == 0 :
            for n0 in range(N):
                scores0[n0] += 1
            continue

        if cnt["0"] < cnt["1"]:
            getter = "0"
        else:
            getter = "1"
        for n0 in range(N):
            if Ss[n0][m0] == getter:
                scores0[n0] += 1
    highest = max(scores0)
    winners = []
    for n1 , score in enumerate(scores0, start=1):
        assert score <= highest
        if score == highest :
            winners.append(n1)
    return winners




main()

Submission Info

Judge Result