結果
問題 | No.1673 Lamps on a line |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 14:48:02 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 402 ms / 2,000 ms |
コード長 | 1,627 bytes |
コンパイル時間 | 230 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 94,848 KB |
最終ジャッジ日時 | 2024-05-05 03:03:54 |
合計ジャッジ時間 | 5,615 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 163 ms
89,216 KB |
testcase_01 | AC | 159 ms
88,960 KB |
testcase_02 | AC | 319 ms
90,752 KB |
testcase_03 | AC | 324 ms
90,624 KB |
testcase_04 | AC | 399 ms
90,752 KB |
testcase_05 | AC | 204 ms
90,496 KB |
testcase_06 | AC | 373 ms
91,264 KB |
testcase_07 | AC | 316 ms
93,312 KB |
testcase_08 | AC | 181 ms
92,544 KB |
testcase_09 | AC | 374 ms
91,008 KB |
testcase_10 | AC | 398 ms
92,416 KB |
testcase_11 | AC | 197 ms
92,416 KB |
testcase_12 | AC | 402 ms
94,848 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, Q = i_map() cou = [0] * N now = 0 for i in range(Q): l, r = i_map() l -= 1 for j in range(l, r): if cou[j] == 1: now -= 1 cou[j] = 0 else: now += 1 cou[j] = 1 print(now) if __name__ == '__main__': main()