結果
問題 | No.1137 Circles |
ユーザー | McGregorsh |
提出日時 | 2022-07-11 15:58:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 342 ms / 2,000 ms |
コード長 | 1,613 bytes |
コンパイル時間 | 274 ms |
コンパイル使用メモリ | 86,904 KB |
実行使用メモリ | 134,300 KB |
最終ジャッジ日時 | 2023-09-04 01:43:06 |
合計ジャッジ時間 | 9,240 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 270 ms
132,732 KB |
testcase_01 | AC | 334 ms
133,804 KB |
testcase_02 | AC | 288 ms
125,400 KB |
testcase_03 | AC | 310 ms
133,956 KB |
testcase_04 | AC | 324 ms
134,048 KB |
testcase_05 | AC | 298 ms
134,300 KB |
testcase_06 | AC | 338 ms
122,628 KB |
testcase_07 | AC | 306 ms
122,692 KB |
testcase_08 | AC | 334 ms
132,140 KB |
testcase_09 | AC | 304 ms
133,964 KB |
testcase_10 | AC | 310 ms
124,428 KB |
testcase_11 | AC | 314 ms
133,812 KB |
testcase_12 | AC | 342 ms
133,972 KB |
testcase_13 | AC | 303 ms
134,300 KB |
testcase_14 | AC | 341 ms
134,156 KB |
testcase_15 | AC | 304 ms
134,140 KB |
testcase_16 | AC | 310 ms
134,252 KB |
testcase_17 | AC | 290 ms
133,812 KB |
testcase_18 | AC | 322 ms
127,864 KB |
testcase_19 | AC | 300 ms
134,144 KB |
testcase_20 | AC | 294 ms
134,128 KB |
testcase_21 | AC | 267 ms
132,652 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(): n = int(input()) nums = [0] * (5*(10**5)+100) for i in range(n): x, r = i_map() x += (10**5) * 2 + 100 nums[x-r] += 1 nums[x+r] -= 1 accumu_nums = list(accumulate(nums)) print(max(accumu_nums)) if __name__ == '__main__': main()