結果
問題 | No.1673 Lamps on a line |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 14:48:02 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 498 ms / 2,000 ms |
コード長 | 1,627 bytes |
コンパイル時間 | 414 ms |
コンパイル使用メモリ | 87,376 KB |
実行使用メモリ | 97,816 KB |
最終ジャッジ日時 | 2023-08-17 20:09:46 |
合計ジャッジ時間 | 7,444 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 257 ms
92,324 KB |
testcase_01 | AC | 257 ms
92,436 KB |
testcase_02 | AC | 419 ms
94,252 KB |
testcase_03 | AC | 430 ms
94,776 KB |
testcase_04 | AC | 498 ms
94,112 KB |
testcase_05 | AC | 305 ms
94,708 KB |
testcase_06 | AC | 463 ms
94,384 KB |
testcase_07 | AC | 409 ms
96,760 KB |
testcase_08 | AC | 276 ms
95,936 KB |
testcase_09 | AC | 475 ms
94,144 KB |
testcase_10 | AC | 493 ms
95,928 KB |
testcase_11 | AC | 299 ms
95,976 KB |
testcase_12 | AC | 492 ms
97,816 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()