結果
問題 | No.709 優勝可能性 |
ユーザー | McGregorsh |
提出日時 | 2022-11-09 22:53:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 576 ms / 3,500 ms |
コード長 | 2,073 bytes |
コンパイル時間 | 289 ms |
コンパイル使用メモリ | 87,104 KB |
実行使用メモリ | 124,628 KB |
最終ジャッジ日時 | 2023-09-30 09:46:47 |
合計ジャッジ時間 | 12,440 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 207 ms
92,532 KB |
testcase_01 | AC | 201 ms
92,588 KB |
testcase_02 | AC | 197 ms
92,576 KB |
testcase_03 | AC | 204 ms
92,496 KB |
testcase_04 | AC | 194 ms
92,524 KB |
testcase_05 | AC | 193 ms
92,320 KB |
testcase_06 | AC | 195 ms
92,536 KB |
testcase_07 | AC | 195 ms
92,312 KB |
testcase_08 | AC | 195 ms
92,320 KB |
testcase_09 | AC | 195 ms
92,540 KB |
testcase_10 | AC | 457 ms
95,240 KB |
testcase_11 | AC | 423 ms
96,044 KB |
testcase_12 | AC | 469 ms
95,388 KB |
testcase_13 | AC | 576 ms
114,748 KB |
testcase_14 | AC | 475 ms
97,432 KB |
testcase_15 | AC | 491 ms
95,692 KB |
testcase_16 | AC | 480 ms
99,128 KB |
testcase_17 | AC | 487 ms
124,628 KB |
testcase_18 | AC | 197 ms
92,444 KB |
testcase_19 | AC | 196 ms
92,608 KB |
testcase_20 | AC | 466 ms
95,256 KB |
testcase_21 | AC | 473 ms
95,268 KB |
testcase_22 | AC | 199 ms
92,352 KB |
testcase_23 | AC | 200 ms
92,564 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): N, M = i_map() nums = [defaultdict(list) for i in range(M)] counts = [0] * N max_num = [0] * M ans = 0 for i in range(N): R = i_list() for j in range(M): if R[j] > max_num[j]: for value in nums[j][max_num[j]]: if counts[value] > 0: counts[value] -= 1 if counts[value] == 0: ans -= 1 counts[i] += 1 max_num[j] = R[j] nums[j][R[j]].append(i) elif R[j] == max_num[j]: counts[i] += 1 nums[j][R[j]].append(i) #print(counts) if counts[i] > 0: ans += 1 print(ans) if __name__ == '__main__': main()