# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1199706 | ofoz | Topical (NOI23_topical) | Pypy 3 | 362 ms | 248508 KiB |
from sys import stdout, setrecursionlimit
from math import ceil, floor, sqrt, comb
from collections import deque
def solve():
n, k = map(int, input().split(" "))
grid = []
for _ in range(n): grid.append(list(map(int, input().split(" "))))
ben = list(map(int, input().split(" ")))
grid.sort()
if sum(grid[0]) == 0:
print(1)
else:
print(0)
solve()
컴파일 시 표준 출력 (stdout) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |