← Back to List

21009번: Visible Trees ↗

Solutions

Python 3
792 B | 792 chars
import sys
from math import sqrt, pi, sin, factorial

BLANK = " "

inp = lambda : sys.stdin.readline()[:-1].strip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print


def solve():
  n = ii()
  l = [mii() for _ in range(n)]
  
  a = []
  b = []
  for x in range(n):
    crt = 0
    cnt = 0
    for y in range(n):
      if crt < l[y][x]:
        cnt += 1
        crt = l[y][x]
    a.append(cnt)
  
  for y in range(n):
    crt = 0
    cnt = 0
    
    for x in range(n):
      if crt < l[y][x]:
        cnt += 1
        crt = l[y][x]
    b.append(cnt)
  
  print(*a)
  print(*b, sep="\n")
  
if __name__ == "__main__":
  tc = 1

  for t in range(1, tc+1):
    ret = solve()