Submission #68741250

---

Source Code Expand

import bisect, heapq, sys, math, copy, itertools, decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10**7)
def INT(): return int(input())
def MI(d=0): return map(lambda x:int(x)+d, input().split())
def MS(): return map(str, input().split())
def LI(d=0): return list(map(lambda x:int(x)+d, input().split()))
def LS(): return list(map(str, input().split()))
def pr_line(itr): print(*itr, sep='\n')
def pr_mtx(matrix): [print(*row) for row in matrix] 
dij = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dij2 = [[1, 0], [0, 1], [-1, 0], [0, -1], [1, 1], [1, -1], [-1, 1], [-1, -1]]
INF = float('inf')

N, M = MI()
S = [input() for _ in range(N)]

score = [0]*N

for i in range(M):
    cnt0, cnt1 = 0, 0
    for j in range(N):
        if S[j][i] == '0':
            cnt0 += 1
        else:
            cnt1 += 1
    
    for j in range(N):
        if cnt0 > cnt1:
            if S[j][i] == '1':
                score[j] += 1
        else:
            if S[j][i] == '0':
                score[j] += 1

mx = max(score)

ans = [i+1 for i in range(N) if score[i] == mx]
print(*ans)

Submission Info

Judge Result