제출 #1213549

#제출 시각아이디문제언어결과실행 시간메모리
1213549xaa29Poi (IOI09_poi)Pypy 3
75 / 100
447 ms87272 KiB
N, T, P = map(int, input().split()) results = [list(map(int, input().split())) for _ in range(N)] task_scores = [0] * T for row in results: for i in range(T): if row[i] == 0: task_scores[i] += 1 contestants = [] for ID, row in enumerate(results): score = sum(task_scores[i] for i in range(T) if row[i] == 1) solved = sum(row) contestants.append((score, solved, -ID)) # -ID for ascending order contestants.sort(reverse=True) philip_ID = P - 1 philip_score = sum(task_scores[i] for i in range(T) if results[philip_ID][i] == 1) philip_solved = sum(results[philip_ID]) philip_tuple = (philip_score, philip_solved, -philip_ID) rank = contestants.index(philip_tuple) + 1 print(philip_score, rank)

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'poi.py'...

=======
  adding: __main__.pyc (deflated 39%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...