結果
問題 | No.370 道路の掃除 |
ユーザー | McGregorsh |
提出日時 | 2022-06-21 22:58:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 156 ms / 2,000 ms |
コード長 | 2,066 bytes |
コンパイル時間 | 431 ms |
コンパイル使用メモリ | 82,832 KB |
実行使用メモリ | 89,088 KB |
最終ジャッジ日時 | 2024-04-23 01:23:18 |
合計ジャッジ時間 | 6,272 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 121 ms
83,164 KB |
testcase_01 | AC | 125 ms
83,456 KB |
testcase_02 | AC | 119 ms
83,440 KB |
testcase_03 | AC | 122 ms
83,156 KB |
testcase_04 | AC | 125 ms
83,456 KB |
testcase_05 | AC | 131 ms
83,584 KB |
testcase_06 | AC | 120 ms
83,528 KB |
testcase_07 | AC | 116 ms
83,160 KB |
testcase_08 | AC | 120 ms
83,384 KB |
testcase_09 | AC | 127 ms
83,712 KB |
testcase_10 | AC | 120 ms
83,380 KB |
testcase_11 | AC | 122 ms
83,328 KB |
testcase_12 | AC | 126 ms
83,112 KB |
testcase_13 | AC | 126 ms
83,584 KB |
testcase_14 | AC | 123 ms
83,072 KB |
testcase_15 | AC | 124 ms
83,412 KB |
testcase_16 | AC | 123 ms
83,172 KB |
testcase_17 | AC | 123 ms
83,108 KB |
testcase_18 | AC | 124 ms
83,456 KB |
testcase_19 | AC | 124 ms
83,584 KB |
testcase_20 | AC | 144 ms
88,960 KB |
testcase_21 | AC | 144 ms
88,960 KB |
testcase_22 | AC | 143 ms
88,832 KB |
testcase_23 | AC | 143 ms
88,960 KB |
testcase_24 | AC | 125 ms
83,592 KB |
testcase_25 | AC | 148 ms
88,960 KB |
testcase_26 | AC | 146 ms
88,960 KB |
testcase_27 | AC | 151 ms
89,028 KB |
testcase_28 | AC | 155 ms
88,448 KB |
testcase_29 | AC | 156 ms
88,832 KB |
testcase_30 | AC | 149 ms
88,960 KB |
testcase_31 | AC | 145 ms
88,960 KB |
testcase_32 | AC | 146 ms
89,088 KB |
testcase_33 | AC | 151 ms
88,704 KB |
ソースコード
import sys, re 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n, m = i_map() nums = [int(input()) for i in range(m)] nums.sort() base = bisect_left(nums, 0) score_up = nums[base:] score_down = nums[:base][::-1] ans = INF for i in range(len(score_up)): if i + 1 == n: ans = min(ans, score_up[i]) break up_cou = score_up[i] down_num = n - (i + 1) if down_num-1 >= len(score_down): continue down_cou = score_down[down_num-1] total = up_cou * 2 + abs(down_cou) ans = min(ans, total) for i in range(len(score_down)): if i + 1 == n: ans = min(ans, abs(score_down[i])) break up_cou = score_down[i] down_num = n - (i + 1) if down_num-1 >= len(score_up): continue down_cou = score_up[down_num-1] total = abs(up_cou * 2) + down_cou ans = min(ans, total) print(ans) if __name__ == '__main__': main()