結果
問題 | No.1338 Giant Class |
ユーザー | McGregorsh |
提出日時 | 2022-07-16 12:44:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 562 ms / 2,000 ms |
コード長 | 1,685 bytes |
コンパイル時間 | 1,598 ms |
コンパイル使用メモリ | 86,396 KB |
実行使用メモリ | 105,064 KB |
最終ジャッジ日時 | 2023-09-10 21:01:25 |
合計ジャッジ時間 | 14,041 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 245 ms
92,104 KB |
testcase_01 | AC | 244 ms
91,872 KB |
testcase_02 | AC | 499 ms
94,436 KB |
testcase_03 | AC | 246 ms
92,176 KB |
testcase_04 | AC | 254 ms
92,344 KB |
testcase_05 | AC | 256 ms
93,100 KB |
testcase_06 | AC | 455 ms
101,492 KB |
testcase_07 | AC | 519 ms
102,944 KB |
testcase_08 | AC | 430 ms
100,068 KB |
testcase_09 | AC | 434 ms
100,908 KB |
testcase_10 | AC | 541 ms
104,216 KB |
testcase_11 | AC | 306 ms
94,604 KB |
testcase_12 | AC | 469 ms
100,040 KB |
testcase_13 | AC | 433 ms
101,068 KB |
testcase_14 | AC | 319 ms
95,672 KB |
testcase_15 | AC | 329 ms
96,700 KB |
testcase_16 | AC | 296 ms
94,316 KB |
testcase_17 | AC | 430 ms
100,824 KB |
testcase_18 | AC | 315 ms
95,628 KB |
testcase_19 | AC | 344 ms
97,648 KB |
testcase_20 | AC | 562 ms
105,064 KB |
testcase_21 | AC | 537 ms
105,064 KB |
testcase_22 | AC | 540 ms
105,020 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 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(): h, w, q = i_map() base = h * w count = defaultdict(int) for i in range(q): x, y = i_map() if count[y] == 0: count[y] = x base -= h - (x - 1) else: if count[y] > x: base -= count[y] - x count[y] = x #print(count) print(base) if __name__ == '__main__': main()