結果
問題 | No.1673 Lamps on a line |
ユーザー | cozy_sauna |
提出日時 | 2022-03-09 15:19:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 126 ms / 2,000 ms |
コード長 | 2,822 bytes |
コンパイル時間 | 207 ms |
コンパイル使用メモリ | 82,032 KB |
実行使用メモリ | 82,252 KB |
最終ジャッジ日時 | 2024-09-13 14:51:06 |
合計ジャッジ時間 | 3,156 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
64,592 KB |
testcase_01 | AC | 56 ms
64,740 KB |
testcase_02 | AC | 107 ms
78,728 KB |
testcase_03 | AC | 115 ms
78,548 KB |
testcase_04 | AC | 126 ms
78,816 KB |
testcase_05 | AC | 99 ms
78,472 KB |
testcase_06 | AC | 121 ms
78,756 KB |
testcase_07 | AC | 109 ms
80,744 KB |
testcase_08 | AC | 68 ms
72,960 KB |
testcase_09 | AC | 116 ms
78,512 KB |
testcase_10 | AC | 124 ms
79,976 KB |
testcase_11 | AC | 82 ms
79,872 KB |
testcase_12 | AC | 116 ms
82,252 KB |
ソースコード
from sys import setrecursionlimit, stdinfrom collections import defaultdict, dequefrom itertools import permutations, combinations, productfrom functools import lru_cachefrom random import sample, choice, randint, randomfrom bisect import bisect_left, bisect_rightfrom heapq import heappush, heappopfrom math import factorial, expfrom copy import copy, deepcopyfrom time import timesetrecursionlimit(1 << 20)readline = stdin.readline# @lru_cache(maxsize = None)INF = 10 ** 18# MOD = 998244353MOD = 1000000007DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]''' Input '''def I(): return int(readline())def S(): return readline()[:-1]def LI(): return list(map(int, readline().split()))def LII(): return list(map(lambda x: int(x)-1, readline().split()))def SPI(): return map(int, readline().split())def SPII(): return map(lambda x: int(x)-1, readline().split())def FIE(x): return [readline()[:-1] for _ in [0] * x]def NODE(N, edge):node = [[] for _ in [0] * N]for _ in [0] * edge:a, b = SPII()node[a].append(b)node[b].append(a)return nodedef NODE_W(N, edge):node = [[] for _ in [0] * N]for _ in [0] * edge:a, b, c = SPI()a -= 1b -= 1node[a].append((b, c))node[b].append((a, c))return node''' Array '''def cmin(dp, i, x):if x < dp[i]: dp[i] = xdef cmax(dp, i, x):if x > dp[i]: dp[i] = x''' Sorted Array '''# x <= A[i] (minimum i meeting the requirement)def binary(sortedA, x): return bisect_left(sortedA, x)# x < A[i] (minimum i meeting the requirement)def binary2(sortedA, x): return bisect_right(sortedA, x + 1)# number of x in Adef quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)''' Other'''def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]def nynx(y, x, ly = INF, lx = INF): return [(y + dy, x + dx) for dy, dx in DYDX if 0 <= y + dy < ly and 0 <= x + dx < lx]def gen(x, *args):ret = [x] * args[-1]for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]return retdef is_prime(x):if x == 1 or x % 2 == 0: return x == 2f = 3while f * f <= x:if x % f == 0: return Falsef += 2return True''' Output '''def puts(E):for e in E: print(e)def pprint(E):print()for e in E: print(e)def yn(x): print("Yes" if x else "No")def blank(arr): print(" ".join(map(str, arr)))def debug(*args):if DEBUG:for e in args: print(e)DEBUG = False###############################################################################################N, Q = SPI()A = gen(0, N)now = 0for _ in range(Q):L, R = SPII()for i in range(L, R+1):if A[i]: now -= 1else: now += 1A[i] = 1 - A[i]print(now)