結果
問題 | No.1995 CHIKA Road |
ユーザー | McGregorsh |
提出日時 | 2022-07-29 19:02:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 455 ms / 2,000 ms |
コード長 | 1,745 bytes |
コンパイル時間 | 874 ms |
コンパイル使用メモリ | 86,916 KB |
実行使用メモリ | 101,068 KB |
最終ジャッジ日時 | 2023-09-26 15:48:16 |
合計ジャッジ時間 | 19,291 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
92,316 KB |
testcase_01 | AC | 237 ms
92,472 KB |
testcase_02 | AC | 234 ms
92,296 KB |
testcase_03 | AC | 234 ms
92,432 KB |
testcase_04 | AC | 239 ms
92,312 KB |
testcase_05 | AC | 235 ms
92,452 KB |
testcase_06 | AC | 299 ms
94,804 KB |
testcase_07 | AC | 337 ms
95,840 KB |
testcase_08 | AC | 249 ms
92,964 KB |
testcase_09 | AC | 233 ms
92,324 KB |
testcase_10 | AC | 455 ms
101,068 KB |
testcase_11 | AC | 426 ms
100,268 KB |
testcase_12 | AC | 352 ms
100,444 KB |
testcase_13 | AC | 337 ms
96,432 KB |
testcase_14 | AC | 335 ms
96,548 KB |
testcase_15 | AC | 417 ms
99,876 KB |
testcase_16 | AC | 310 ms
95,060 KB |
testcase_17 | AC | 385 ms
98,604 KB |
testcase_18 | AC | 444 ms
100,576 KB |
testcase_19 | AC | 443 ms
100,596 KB |
testcase_20 | AC | 379 ms
97,632 KB |
testcase_21 | AC | 376 ms
97,308 KB |
testcase_22 | AC | 442 ms
100,684 KB |
testcase_23 | AC | 355 ms
96,660 KB |
testcase_24 | AC | 426 ms
99,964 KB |
testcase_25 | AC | 321 ms
94,724 KB |
testcase_26 | AC | 347 ms
96,648 KB |
testcase_27 | AC | 404 ms
99,348 KB |
testcase_28 | AC | 363 ms
97,172 KB |
testcase_29 | AC | 438 ms
100,324 KB |
testcase_30 | AC | 316 ms
94,920 KB |
testcase_31 | AC | 308 ms
95,256 KB |
testcase_32 | AC | 327 ms
96,104 KB |
testcase_33 | AC | 417 ms
99,092 KB |
testcase_34 | AC | 301 ms
94,396 KB |
testcase_35 | AC | 360 ms
96,332 KB |
testcase_36 | AC | 356 ms
97,396 KB |
testcase_37 | AC | 433 ms
100,348 KB |
testcase_38 | AC | 399 ms
98,148 KB |
testcase_39 | AC | 303 ms
94,344 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, m = i_map() hque = [] for i in range(m): a, b = i_map() heappush(hque, (b, a)) now = 1 ans = 0 while now < n and hque: y, x = heappop(hque) if x < now: continue cost1 = 2 * y - 2 * x - 1 cost2 = (x - now) * 2 now = y ans += cost1 + cost2 if now != n: ans += (n - now) * 2 print(ans) if __name__ == '__main__': main()