結果
問題 | No.1338 Giant Class |
ユーザー | McGregorsh |
提出日時 | 2022-07-16 12:44:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 430 ms / 2,000 ms |
コード長 | 1,685 bytes |
コンパイル時間 | 152 ms |
コンパイル使用メモリ | 81,848 KB |
実行使用メモリ | 99,504 KB |
最終ジャッジ日時 | 2024-06-28 12:06:46 |
合計ジャッジ時間 | 9,333 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
89,520 KB |
testcase_01 | AC | 138 ms
89,708 KB |
testcase_02 | AC | 380 ms
90,728 KB |
testcase_03 | AC | 140 ms
89,332 KB |
testcase_04 | AC | 144 ms
89,508 KB |
testcase_05 | AC | 148 ms
89,540 KB |
testcase_06 | AC | 327 ms
97,352 KB |
testcase_07 | AC | 403 ms
99,364 KB |
testcase_08 | AC | 319 ms
97,020 KB |
testcase_09 | AC | 315 ms
96,228 KB |
testcase_10 | AC | 430 ms
99,080 KB |
testcase_11 | AC | 197 ms
90,556 KB |
testcase_12 | AC | 359 ms
94,920 KB |
testcase_13 | AC | 312 ms
96,080 KB |
testcase_14 | AC | 207 ms
91,164 KB |
testcase_15 | AC | 231 ms
92,452 KB |
testcase_16 | AC | 188 ms
91,232 KB |
testcase_17 | AC | 322 ms
97,356 KB |
testcase_18 | AC | 204 ms
91,180 KB |
testcase_19 | AC | 233 ms
93,244 KB |
testcase_20 | AC | 423 ms
99,504 KB |
testcase_21 | AC | 420 ms
99,308 KB |
testcase_22 | AC | 425 ms
99,368 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()