結果
問題 | No.2154 あさかつの参加人数 |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 12:58:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 768 ms / 2,000 ms |
コード長 | 1,571 bytes |
コンパイル時間 | 1,637 ms |
コンパイル使用メモリ | 86,340 KB |
実行使用メモリ | 137,640 KB |
最終ジャッジ日時 | 2023-08-18 07:57:28 |
合計ジャッジ時間 | 26,883 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 768 ms
137,424 KB |
testcase_01 | AC | 661 ms
137,460 KB |
testcase_02 | AC | 638 ms
137,640 KB |
testcase_03 | AC | 637 ms
137,420 KB |
testcase_04 | AC | 708 ms
136,972 KB |
testcase_05 | AC | 492 ms
94,404 KB |
testcase_06 | AC | 565 ms
111,516 KB |
testcase_07 | AC | 458 ms
120,972 KB |
testcase_08 | AC | 453 ms
124,568 KB |
testcase_09 | AC | 331 ms
114,952 KB |
testcase_10 | AC | 445 ms
117,960 KB |
testcase_11 | AC | 591 ms
132,808 KB |
testcase_12 | AC | 534 ms
114,500 KB |
testcase_13 | AC | 420 ms
102,476 KB |
testcase_14 | AC | 552 ms
117,820 KB |
testcase_15 | AC | 443 ms
124,440 KB |
testcase_16 | AC | 533 ms
121,000 KB |
testcase_17 | AC | 588 ms
112,720 KB |
testcase_18 | AC | 590 ms
121,512 KB |
testcase_19 | AC | 367 ms
97,544 KB |
testcase_20 | AC | 526 ms
127,988 KB |
testcase_21 | AC | 350 ms
114,516 KB |
testcase_22 | AC | 356 ms
133,152 KB |
testcase_23 | AC | 569 ms
124,876 KB |
testcase_24 | AC | 599 ms
125,596 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, ROUND_HALF_UP 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() cou = [0] * (N+1) for i in range(M): l, r = i_map() cou[N-r+1] -= 1 cou[N-l] += 1 AC = list(accumulate(cou)) AC = AC[::-1] for i in range(N, 0, -1): print(AC[i]) if __name__ == '__main__': main()