結果
問題 | No.1557 Binary Variable |
ユーザー | McGregorsh |
提出日時 | 2022-07-21 09:11:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 471 ms / 2,000 ms |
コード長 | 1,952 bytes |
コンパイル時間 | 352 ms |
コンパイル使用メモリ | 86,864 KB |
実行使用メモリ | 114,752 KB |
最終ジャッジ日時 | 2023-09-15 12:09:13 |
合計ジャッジ時間 | 19,037 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 463 ms
114,628 KB |
testcase_01 | AC | 457 ms
114,668 KB |
testcase_02 | AC | 245 ms
92,124 KB |
testcase_03 | AC | 241 ms
92,096 KB |
testcase_04 | AC | 446 ms
114,472 KB |
testcase_05 | AC | 449 ms
114,628 KB |
testcase_06 | AC | 454 ms
114,740 KB |
testcase_07 | AC | 468 ms
114,592 KB |
testcase_08 | AC | 461 ms
114,528 KB |
testcase_09 | AC | 462 ms
114,740 KB |
testcase_10 | AC | 457 ms
114,660 KB |
testcase_11 | AC | 461 ms
114,516 KB |
testcase_12 | AC | 456 ms
114,420 KB |
testcase_13 | AC | 455 ms
114,468 KB |
testcase_14 | AC | 456 ms
114,460 KB |
testcase_15 | AC | 461 ms
114,660 KB |
testcase_16 | AC | 471 ms
114,636 KB |
testcase_17 | AC | 463 ms
114,728 KB |
testcase_18 | AC | 453 ms
114,632 KB |
testcase_19 | AC | 453 ms
114,684 KB |
testcase_20 | AC | 451 ms
114,592 KB |
testcase_21 | AC | 454 ms
114,716 KB |
testcase_22 | AC | 450 ms
114,420 KB |
testcase_23 | AC | 457 ms
114,472 KB |
testcase_24 | AC | 453 ms
114,448 KB |
testcase_25 | AC | 458 ms
114,752 KB |
testcase_26 | AC | 449 ms
114,536 KB |
testcase_27 | AC | 457 ms
114,568 KB |
testcase_28 | AC | 443 ms
114,592 KB |
testcase_29 | AC | 450 ms
114,484 KB |
testcase_30 | AC | 463 ms
114,472 KB |
testcase_31 | AC | 445 ms
114,480 KB |
testcase_32 | AC | 451 ms
114,684 KB |
testcase_33 | AC | 448 ms
114,596 KB |
testcase_34 | AC | 238 ms
92,208 KB |
testcase_35 | AC | 236 ms
92,264 KB |
testcase_36 | AC | 237 ms
92,152 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() que = deque() nums = [i_list() for i in range(m)] nums.sort() if m == 1: print(n - 1) exit() cou = 0 for i in range(m): l, r = nums[i] if len(que) != 0: under, top = que.popleft() #print(l, r, under, top) if under <= l <= r <= top: que.append([l, r]) continue elif under <= l <= top and top <= r: que.append([l, top]) continue cou += 1 que.append([l, r]) else: que.append([l, r]) print(n - cou - 1) if __name__ == '__main__': main()