input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def main():
n=int(eval(input()))
a=list(map(int,input().split()))
class segtree():
def __init__(self,base,monoid,ini):#self,モノイド,元の配列
#ini：上限（下限）,base：元の配列,monoid：モノイド,tree：セグ木,depth：treeの深さ,
#basesize：baseの要素数,treesize：treeの要素数,num：treesize-basesize
# 初期... | def main():
class unionfind():
#size:要素数,tree：unionfind木
def __init__(self,size):#self,要素数
self.size=size
self.tree=[i for i in range(self.size)]#root,depth
#rootを探す
def root(self,index):
temp_list=[]
temp=self.tree[i... | p02919 |
def main():
class unionfind():
#size:要素数,tree：unionfind木
def __init__(self,size):#self,要素数
self.size=size
self.tree=[i for i in range(self.size)]#root,depth
#rootを探す
def root(self,index):
temp_list=[]
temp=self.tree[i... | def main():
class unionfind():
#size:要素数,tree：unionfind木
def __init__(self,size):#self,要素数
self.size=size
self.tree=[i for i in range(self.size)]#root,depth
#rootを探す
def root(self,index):
temp_list=[]
temp=self.tree[i... | p02919 |
def main():
#AVL
##search(0,x):O(logN)
# xがある場合indexを、ない場合Noneを返す
def search(root,key):
if avl_key[root] > key:
if avl_left[root] == None:
return None
else:
return search(avl_left[root],key)
if avl_key[root] < key:
... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
nl = lambda: list(map(int, stdin.readline().split()))
nm = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
n = ni()
p = nl()
q = [0]*(n+1)
for i in range(n):
q[p[i]] = i+1
ans = 0
l = [0] + [i for i i... | p02919 |
N = int(eval(input()))
P = [int(i) for i in input().split(" ")]
ans = 0
for L in range(N-1):
for R in range(L+1, N):
if 2 <= len(P[L:R+1]) <= 3:
seq = sorted(P[L:R+1], reverse=True)
else:
if seq[0] > P[R] > seq[1]:
seq = [seq[0], P[R], seq[1]]
... | N = int(eval(input()))
P = [int(i) for i in input().split(" ")]
# 各数字が何番目に入っているかを保存する
pos = [0] * (N + 1)
for i in range(N):
pos[P[i]] = i + 1
l = [0]+[i for i in range(N + 1)]
r = [i + 1 for i in range(N + 1)] + [N + 1]
# 1から順番に見ていく
ans = 0
for i in range(1, N + 1):
idx = pos[i]
l1, r1 = ... | p02919 |
from bisect import bisect_left
import sys
input = sys.stdin.readline
n = int(eval(input()))
p = tuple(map(int, input().split()))
pos = [[] for _ in range(n + 1)]
for ind, pp in enumerate(p):
for j in range(pp + 1):
pos[j].append(ind)
ans = 0
for i, pp in enumerate(p):
ind = bisect_lef... | # https://atcoder.jp/contests/abc140/submissions/7411285
# 写経
def main():
N = int(eval(input()))
*p, = list(map(int, input().split()))
xtoi = [-1] * (N + 1)
for i, x in enumerate(p):
xtoi[x] = i
L = [-1] * (N + 2)
R = [N] * (N + 2)
for i in range(N):
L[i] = i... | p02919 |
class SparseTable:
def __init__(self, a, func=max, one=-10**18):
self.table = [a[:]]
self.n = len(a)
self.logn = self.n.bit_length()
self.func = func
self.one = one
for i in [1 << x for x in range(self.logn - 1)]:
self.table.append([])
... | class SparseTable:
def __init__(self, a, func=max, one=-10**18):
self.table = [a[:]]
self.n = len(a)
self.logn = self.n.bit_length()
self.func = func
self.one = one
for i in [1 << x for x in range(self.logn - 1)]:
self.table.append([])
... | p02919 |
from bisect import bisect_left, bisect_right
class OrderedSet:
def __init__(self, a):
self.c = {}
self.a_sort = sorted(list(set(a)))
for i, a in enumerate(self.a_sort):
self.c[a] = i + 1
self.r = {v: k for k, v in list(self.c.items())}
self.size = len(se... |
def resolve():
N = int(eval(input()))
A = list(map(int, input().split()))
P = [0] * (N + 1)
for i, a in enumerate(A):
P[a] = i
l_idx = list(range(-1, N - 1)) + [-1, -1]
r_idx = list(range(1, N + 1)) + [N, N] # 番兵
ans = 0
for p in range(1, N + 1):
x = P[... | p02919 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p02919 |
import bisect
n = int(eval(input()))
p = list(map(int, input().split()))
index = [0] * (n+1)
for i in range(n):
index[p[i]] = i
poss = []
result = 0
for i in range(1, n+1)[::-1]:
x = index[i]
if len(poss) == 0:
poss.append(x)
continue
dx = bisect.bisect_left(poss, x)
... | class BIT:
def __init__(self, n):
self.n = n
self.N = 1 << n.bit_length()
self.data = [0] * (self.N +1)
def add(self, i, x):
while i <= self.N:
self.data[i] += x
i += i & -i
def sum(self, i):
total = 0
while i > 0:
... | p02919 |
import sys
from bisect import bisect
class Node:
def __init__(self, key, height):
self.key = key #ノードの木
self.height = height #このノードを根とする部分木の高さ
self.left = None
self.right = None
def size(self, n): return 0 if n is None else n.height
def bias(self): #左の方が高いと正、右が... | import sys
from bisect import bisect
class Node:
def __init__(self, key, height):
self.key = key #ノードの木
self.height = height #このノードを根とする部分木の高さ
self.left = None
self.right = None
def size(self, n): return 0 if n is None else n.height
def bias(self): #左の方が高いと正、右が... | p02919 |
import sys
from bisect import bisect
class Node:
def __init__(self, key, height):
self.key = key #ノードの木
self.height = height #このノードを根とする部分木の高さ
self.left = None
self.right = None
def size(self, n): return 0 if n is None else n.height
def bias(self): #左の方が高いと正、右が... | import sys
from bisect import bisect
class Node:
def __init__(self, key, height):
self.key = key #ノードの木
self.height = height #このノードを根とする部分木の高さ
self.left = None
self.right = None
def size(self, n): return 0 if n is None else n.height
def bias(self): #左の方が高いと正、右が... | p02919 |
N = int(eval(input()))
ls = [int(i) for i in input().split()]
#N = 5
#ls = [1,2,3,4,5]
dic = {}
result = []
def get_second_large(ls):
if len(ls) < 2:
return ls[0]
else:
return sorted(ls)[-2]
for l in range(N):
for r in range(l+1,N):
tup = tuple(ls[l:r+1])
if tup not in ... | N = int(eval(input()))
ls = [int(i) for i in input().split()]
result = []
for l in range(N-1):
if ls[l] > ls[l+1]:
sec_big, biggist = ls[l+1], ls[l]
else:
sec_big, biggist = ls[l], ls[l+1]
result.append(sec_big)
for r in range(l+2, N):
if ls[r] > biggist:
... | p02919 |
# 点更新，区間クエリ
class SegTree:
# n : 元の配列の長さ
# init_list: 元の配列
# segfunc : 載せる関数（演算）
# ide_ele : segfuncの単位元
def __init__(self, n, init_list ,segfunc, ide_ele):
# num : 2**num >= n となる最小の整数 （葉の数）
# seg : segtreeのリスト
self.num = 2**((n-1).bit_length())
... |
# 1-indexed Binary Indexed Tree
class BIT:
def __init__(self, n, init_list):
self.num = n+1
self.tree = [0]*self.num
for i,e in enumerate(init_list):
self.update(i,e)
def update(self,k,x):
k = k+1
while k < self.num:
self.tree[k] += x... | p02919 |
import bisect
class SqrtSet:
def __init__(self, block_limit=300):
self.key = []
self.child = [[]]
self.block_limit = block_limit
def search_lower(self, key):
if key is None:
return None
ret = None
i = bisect.bisect_left(self.key, key)
... | import bisect
class SqrtSet:
def __init__(self, block_limit=201):
self.key = []
self.child = [[]]
self.block_limit = block_limit
def search_lower(self, key):
if key is None:
return None
ret = None
i = bisect.bisect_left(self.key, key)
... | p02919 |
from time import time
from statistics import median
from bisect import bisect_left, bisect_right
from random import random, sample
class TwoLayerSet:
def __init__(self, p):
self.top = []
self.bottom = [[]]
self.p = p
def insert(self, key):
(top, bottom) = (self.to... | from time import time
from statistics import median
from bisect import bisect_left, bisect_right
from random import random, sample
class TwoLayerSet:
def __init__(self, p):
self.top = []
self.bottom = [[]]
self.p = p
def insert(self, key):
(top, bottom) = (self.to... | p02919 |
from bisect import bisect_left, bisect_right
from random import random, sample
class TwoLayerSet:
def __init__(self, p):
self.top = []
self.bottom = [[]]
self.p = p
def insert(self, key):
(top, bottom) = (self.top, self.bottom)
top_i = bisect_left(top, ke... | from random import random, sample
def bis_l(a, k):
l = 0
r = len(a)
while l != r:
m = (l + r) >> 1
if a[m] < k:
l = m + 1
else:
r = m
return l
def bis_r(a, k):
l = 0
r = len(a)
while l != r:
m = (l + r) >> 1
if a[m] <= k:
l = m + 1
else:
... | p02919 |
#!/usr/bin/env python3
N=int(eval(input()))
p=list(map(int,input().split()))
LL = [0] + [i for i in range(N+1)]
RR = [i+1 for i in range(N+1)] + [N+1]
E = [(v, i+1) for i, v in enumerate(p)]
E.sort()
ans=0
for v, i in E:
r0 = RR[i]
r1 = RR[r0]
l0 = LL[i]
l1 = LL[l0]
RR[l0] = r0
LL[r0] = l0
... | #!/usr/bin/env python3
ans=0
n=int(eval(input()))
p=list(map(int,input().split()))
b=[0]*(n+1)
for i in range(n):
b[p[i]]=i+1
LL=[0]+[i for i in range(n+1)]
RR=[i for i in range(1,n+2)]+[n+1]
for i in range(1,n+1):
l1=LL[b[i]]
l0=LL[l1]
r0=RR[b[i]]
r1=RR[r0]
ans+=((l1-l0)*(r0-b[i])... | p02919 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
from bisect import bisect_left
import sys
N = int(eval(input()))
Pn = [[i,j] for i,j in enumerate(list(map(int, sys.stdin.readline().rstrip().split())))]
Pn = sorted(Pn,key=lambda x:-x[1])
In = [Pn[0][0]]
ans = 0
for i,p in Pn[1:]:
cnt = 0
c = bisect_left(... | #!/usr/bin/python3
# -*- coding: utf-8 -*-
N = int(eval(input()))
Pn = list(map(int, input().split()))
In = [0] * (N+1)
for i in range(N):
In[Pn[i]] = i+1
cnt = 0
l = [0] + [i for i in range(N+1)]
r = [i+1 for i in range((N+1))] + [N+1]
for v in range(1, N+1):
i = In[v]
l1 = l[i]
l2... | p02919 |
def resolve():
n = int(eval(input()))
p = list(map(int, input().split()))
second = sorted(p)[-2]
dp = [[[0, 0] for _ in range(n)] for __ in range(n)]
ans = 0
for i in range(n - 1):
dp[i][i + 1][1], dp[i][i + 1][0] = sorted([p[i], p[i + 1]])
ans += dp[i][i + 1][1]
... | def resolve():
n = int(eval(input()))
p = list(map(int, input().split()))
second = sorted(p)[-2]
# dp = [[[0, 0] for _ in range(n)] for __ in range(n)]
ans = 0
for i in range(n - 1):
b, a = sorted([p[i], p[i + 1]])
ans += b
for j in range(i + 2, n):
... | p02919 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
P_list = list(map(int, input().split()))
# rev_P_list = []
# for P in (reversed(P_list)):
# rev_P_list.append(P)
x_list_list = [[0 for i in range(N)] for i in range(N)]
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
if j == i + 1:
... | # -*- coding: utf-8 -*-
N = int(eval(input()))
P_list = list(map(int, input().split()))
# rev_P_list = []
# for P in (reversed(P_list)):
# rev_P_list.append(P)
x_dic = {}
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
if j == i + 1:
x_dic["{}_{}".format(i, j)] = sort... | p02919 |
n = int(eval(input()))
ListP =[int(i) for i in input().split()]
#n = 10000
#ListP = [i for i in range(n)]
points = 0
ListPos2 = [0] * (n + 1)
for i, a in enumerate(ListP):
ListPos2[a] = i + 1
ListPos = [0, 0] + [ListPos2[n]] + [n+1, n+1]
#ListTPos = [0] * (n+2) + [n+1, n+1]
ListTPos = [0] * (n + 1) + [n+1]
... | n = int(eval(input()))
p = [int(i) for i in input().split()]
pos_list = [0] * n
for ind, i in enumerate(p):
pos_list[i-1] = ind
left_nextInd = list(range(-1, n-1)) + [-1, -1]
right_nextInd = list(range(1, n+1)) + [n, n]
answer = 0
for i in range(1, n):
ind = pos_list[i-1]
l1 = left_nextInd[ind]
l2 ... | p02919 |
import bisect
n = int(eval(input()))
p = list(map(int, input().split()))
pi = sorted(zip(p, list(range(n))))
index = [-1, -1, pi[n - 1][1], n, n]
ret = 0
for pos in range(n - 2, -1, -1):
p, i = pi[pos]
ii = bisect.bisect_left(index, i)
ret += p * (index[ii - 1] - index[ii - 2]) * (index[ii] - i... | n = int(eval(input()))
p = list(map(int, input().split()))
pi = sorted(zip(p, list(range(n))))
left = {i: i - 1 for i in range(n)}
right = {i: i + 1 for i in range(n)}
left[-1] = -1
right[n] = n
ret = 0
for p, i in pi:
ret += p * (left[i] - left[left[i]]) * (right[i] - i)
ret += p * (i - left[i]) *... | p02919 |
def main():
import sys
input=sys.stdin.readline
from bisect import bisect,insort
n=int(eval(input()))
p=list(map(int,input().split()))
p=[0]+p
q=[0]*(n+1)
for i in range(1,n+1):
q[p[i]]=i
lst=[0,q[n],n+1]
ans=0
for i in range(1,n):
k=i
i=... | n=int(eval(input()))
p=list(map(int,input().split()))
f=[0]*(n+1)
for i in range(n):
f[p[i]]=i+1
l=[0]+[i for i in range(n+1)]
r=[i+1 for i in range(n+1)]+[n+1]
ans=0
for i in range(1,n+1):
x=f[i]
l1,r1=l[x],r[x]
l2,r2=l[l1],r[r1]
ans+=i*((l1-l2)*(r1-x)+(x-l1)*(r2-r1))
l[r1],r[l1]=l... | p02919 |
import bisect
N = int(eval(input()))
P = list(map(int, input().split()))
place = [-1] * (N + 1)
for i in range(N):
p = P[i]
place[p] = i
ans = 0
big_place = [place[N]]
for i in range(N - 1, 0, -1):
pos = bisect.bisect_left(big_place, place[i])
if pos < len(big_place):
right = b... | class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] +=... | p02919 |
class SegmentTree:
def __init__(self, a):
self.padding = 0
self.n = len(a)
self.N = 2 ** (self.n-1).bit_length()
self.data = [self.padding]*(self.N-1) + a + [self.padding]*(self.N-self.n)
for i in range(2*self.N-2, 0, -2):
self.data[(i-1)//2] = sum([self.da... | N = int(eval(input()))
P = list(enumerate(list(map(int, input().split()))))
P = sorted(P, key=lambda x:x[1])
before_idx = list(range(-1, N-1)) + [-1, -1]
next_idx = list(range(1, N+1)) + [N, N]
ans = 0
for i, p in P:
il1 = before_idx[i]
il2 = before_idx[il1]
ir1 = next_idx[i]
ir2 = next_idx[ir1]
... | p02919 |
N = int(eval(input()))
P = [int(x) - 1 for x in input().split()]
idx = [0] * N
for i in range(N):
idx[P[i]] = i
ans = 0
for i in range(N - 2, -1, -1):
find = False
l1 = idx[i] + 1
l2 = 0
for j in range(idx[i] - 1, -1, -1):
if i < P[j]:
if not find:
... | N = int(eval(input()))
P = [int(x) for x in input().split()]
PIdx = sorted([(i + 1, v) for i, v in enumerate(P)], key = lambda x: x[1])
L = [0]
for i in range(N + 1):
L.append(i)
R = [i + 1 for i in range(N + 1)]
R.append(N + 1)
ans = 0
for i, v in PIdx:
l1 = L[i]
l2 = L[l1]
r1 = R[i... | p02919 |
n = int(eval(input()))
xs = list(map(int, input().split()))
x2i = {}
for i, x in enumerate(xs):
x2i[x] = i+1
ll = [0] * (n+2)
rr = [n+1] * (n+2)
def find_l(l, r, default):
m, m2 = 0, 0
mi=mi2=default
for i in range(r-l):
i = i + l
if ll[i] > m:
mi, m = i, ll[i]... |
class SegTree:
def __init__(self, init_val, n, ide_ele, seg_func):
self.segfunc = seg_func
self.num = 2**(n-1).bit_length()
self.ide_ele = ide_ele
self.seg=[self.ide_ele]*2*self.num
for i in range(n):
self.seg[i+self.num-1]=init_val[i]
for ... | p02919 |
#!/usr/bin/env python3
import sys
from bisect import bisect_left, insort_left
INF = float("inf")
def solve(N: int, P: "List[int]"):
# 番号pは何番目か 0-index
rev = [0]*(N+1)
for i, p in enumerate(P):
rev[p] = i
ans = 0
seq = [rev[N]]
for i in range(N-1, 0, -1):
j = b... | #!/usr/bin/env python3
import sys
# from collections import Counter
INF = float("inf")
class MaxBit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s = max(s, self.tree[i])
i -= i & -i
... | p02919 |
#!/usr/bin/env python3
import sys
# from collections import Counter
INF = float("inf")
class MaxBit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s = max(s, self.tree[i])
i -= i & -i
... | N = int(eval(input()))
P = list(map(int, input().split()))
pos = {}
for i, p in enumerate(P):
pos[p] = i+1
foll = [i+1 for i in range(N+1)]+[N+1]
prev = [0]+[i for i in range(N+1)]
ans = 0
for i in range(1, N+1):
curr = pos[i]
r = foll[curr]
rr = foll[r]
l = prev[curr]
ll = pr... | p02919 |
import sys
from heapq import heappush, heappop
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
class BIT:
def __init__(self, n):
self.n = n
self.data = [0] * (n + 1)
self.depth... | import sys
from heapq import heappush, heappop
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *P = list(map(int, read().split()))
idx = [0] * (N + 1)
for i, p in enumerate(P):... | p02919 |
import sys
from heapq import heappush, heappop
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
class BIT:
def __init__(self, n):
self.n = n
self.data = [0] * (n + 1)
self.depth... | import sys
from heapq import heappush, heappop
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
class BIT:
def __init__(self, n):
self.n = n
self.data = [0] * (n + 1)
self.step ... | p02919 |
def slove():
import sys
input = sys.stdin.readline
s = list(str(input().rstrip('\n')))
w = int(input().rstrip('\n'))
print(("".join(s[::w])))
if __name__ == '__main__':
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s = str(readline().rstrip().decode('utf-8'))
w = int(readline())
ans = []
for i in range(0, len(s), w):
ans.append(s[i])
print(("".join(ans)))
if __name__ == '__main__':
solve()
| p03303 |
n = int(eval(input()))
a = list(map(int, input().split()))
safe = set()
for i in range(n - 1):
for j in range(i + 1, n):
pro = a[i] * a[j]
digit = [pro % (10 ** k) // (10 ** (k - 1)) for k in range(1, 10)]
while digit[-1] == 0:
digit = digit[:-1]
if len(d... | n = int(eval(input()))
a = list(map(int, input().split()))
ma = -1
for i in range(n - 1):
for j in range(i + 1, n):
pro = a[i] * a[j]
digit = [pro % (10 ** k) // (10 ** (k - 1)) for k in range(1, 10)]
while digit[-1] == 0:
digit = digit[:-1]
if len(digit)... | p01880 |
n = int(eval(input()))
a = list(map(int, input().split()))
ma = -1
for i in range(n - 1):
for j in range(i + 1, n):
pro = a[i] * a[j]
digit = [pro % (10 ** k) // (10 ** (k - 1)) for k in range(1, 10)]
while digit[-1] == 0:
digit = digit[:-1]
if len(digit)... | n = int(eval(input()))
a = list(map(int, input().split()))
ma = -1
for i in range(n - 1):
for j in range(i + 1, n):
pro = a[i] * a[j]
pre = pro % 10
pro //= 10
while pro:
if pre - pro % 10 == 1:
pre = pro % 10
pro /... | p01880 |
from collections import deque
N=int(eval(input()))
A=list(map(int,input().split()))
edge=[[] for i in range(N)]
for _ in range(N-1):
u,v=list(map(int,input().split()))
edge[u-1].append(v-1)
edge[v-1].append(u-1)
ans=[0]
parent=[-1]*N
que=deque([(0,-1)])
while que:
v,pv=que.popleft()
... | from collections import deque
N=int(eval(input()))
A=list(map(int,input().split()))
edge=[[] for i in range(N)]
for _ in range(N-1):
u,v=list(map(int,input().split()))
edge[u-1].append(v-1)
edge[v-1].append(u-1)
ans=[0]
parent=[-1]*N
que=deque([(0,-1)])
while que:
v,pv=que.popleft()
... | p03159 |
N, M = list(map(int, input().split()))
LL, MM = list(map(int, input().split()))
gate = [LL + i for i in range(MM-LL+1)]
for _ in range(M-1):
LL, MM = list(map(int, input().split()))
tmp = [LL + i for i in range(MM-LL+1)]
gate = list(set(gate) & set(tmp))
print((len(gate)))
| N, M = list(map(int, input().split()))
min_, max_ = list(map(int, input().split()))
for _ in range(M-1):
LL, MM = list(map(int, input().split()))
min_ = max(min_, LL)
max_ = min(max_, MM)
if min_ <= max_:
print((max_ - min_ + 1))
else:
print((0)) | p03037 |
N, M = list(map(int,input().split()))
def main():
Ls = []
Rs = []
for i in range(M):
inputs = list(map(int,input().split()))
Ls.append(inputs[0])
Rs.append(inputs[1])
result = set()
for i in range(1, M + 1):
Li = Ls[i - 1]
LiPlus = { j for j in range(Li + 1, Rs[i - 1] + 1) }
LiPlus.ad... | N, M = list(map(int,input().split()))
def main():
Ls = []
Rs = []
for i in range(M):
inputs = list(map(int,input().split()))
Ls.append(inputs[0])
Rs.append(inputs[1])
maxL = max(Ls)
minR = min(Rs)
if maxL > minR:
print((0))
else:
print((minR - maxL + 1))
if __name__ == '__main__... | p03037 |
from collections import Counter
N, M = list(map(int, input().split()))
cnt = Counter()
for i in range(M):
l, r = list(map(int, input().split()))
for i in range(l, r + 1):
cnt[i] += 1
ans = 0
for v in list(cnt.values()):
if v == M:
ans += 1
print(ans) | from collections import Counter
N, M = list(map(int, input().split()))
L = []
R = []
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
maxL = max(L)
minR = min(R)
ans = max(0, minR - maxL + 1)
print(ans) | p03037 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
def main():
n, m = list(map(int, input().split()))
ans = set([i for i in range(1 , n + 1)])
for _ in range(m):
l, r = list(map(int, input().split()))
card = set([i for i in range(l, r + 1)])
ans = ans & c... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
def solve(l1, r1, l2, r2):
if r1 < l2 or r2 < l1:
return None
elif l1 < l2 and r1 < r2:
return [l2, r1]
elif l1 >= l2 and r1 <= r2:
return [l1, r1]
elif l1 <= l2 and r2 <= r1:
return [l2, r2... | p03037 |
# coding: UTF-8
# sample code
v = list(map(int, input().split()))
n, m = v[0], v[1]
l, r = [], []
for i in range(m):
v = list(map(int, input().split()))
l.append(v[0])
r.append(v[1])
num = 0
for i in range(n):
flag = 0
for j in range(m):
if not((l[j]<=i+1) and (i+1<=r[j])):
flag += 1
if ... | # coding: UTF-8
# sample code
v = list(map(int, input().split()))
n, m = v[0], v[1]
l, r = [], []
for i in range(m):
v = list(map(int, input().split()))
l.append(v[0])
r.append(v[1])
min = 1
max = n
for i in range(m):
if l[i] > min:
min = l[i]
if max > r[i]:
max = r[i]
num = max-min+1
... | p03037 |
n , m=list(map(int,input().split()))
l1 , r1 =list(map(int,input().split()))
A =set(range(l1,r1+1))
for i in range(m-1):
l , r =list(map(int,input().split()))
B = set(range(l,r+1))
A = A.intersection(B)
print((len(A))) | n , m = list(map(int,input().split()))
L = []
R = []
for i in range(m):
l , r = list(map(int,input().split()))
L.append(l)
R.append(r)
Lmax = max(L)
Rmin = min(R)
s = list(range(Lmax,Rmin+1))
print((len(s))) | p03037 |
li = input().split()
n = int(li[0])
m = int(li[1])
# IDカードn枚， ゲートm個
l_r = []
# i番目のゲートはl~rのIDカードを持っていれば通過できる
l_r = [input().split() for i in range(m)]
answer = 0
for i in range(n):
for lr in l_r:
l = int(lr[0])
r = int(lr[1])
if l <= i + 1 and i + 1 <= r:
continue
... | li = input().split()
n = int(li[0])
m = int(li[1])
# IDカードn枚， ゲートm個
# i番目のゲートはl~rのIDカードを持っていれば通過できる
l_r = [input().split() for i in range(m)]
l_r.sort(key=lambda x:int(x[0]))
l_max = int(l_r[-1][0])
l_r.sort(key=lambda x:int(x[1]))
r_min = int(l_r[0][1])
answer = 0
# for i in range(n):
# if l_max <= i +... | p03037 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | p03037 |
N, M = list(map(int, input().split()))
L = [None] * M
R = [None] * M
ans = [0] * (N + 1)
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
for i in range(M):
for j in range(L[i], R[i] + 1):
ans[j] += 1
print((ans.count(M)))
| N, M = list(map(int, input().split()))
L = [None] * M
R = [None] * M
for i in range(M):
L[i], R[i] = list(map(int, input().split()))
ans = list(range(max(L), min(R) + 1))
print((len(ans))) | p03037 |
N,M=list(map(int,input().split()))
LR=list(range(N+1))
for i in range(M):
L,R=list(map(int,input().split()))
LR=list(set(list(range(L,R+1))) & set(LR))
print((len(LR))) | N,M=list(map(int,input().split()))
LR=set(range(N+1))
l=[]
r=[]
for i in range(M):
L,R=list(map(int,input().split()))
l.append(L)
r.append(R)
ans=min(r)-max(l)+1
if ans<0:
ans=0
print(ans) | p03037 |
inputted = list(map(int, input().split()))
N = inputted[0]
M = inputted[1]
LR = [list(map(int, input().split())) for i in range(M)]
left = 0
right = N
for LRi in LR:
left = max(left, LRi[0])
right = min(right, LRi[1])
if left > right: break
answer = max(0, right - left + 1)
print(answ... | inputted = list(map(int, input().split()))
N = inputted[0]
M = inputted[1]
LR = [list(map(int, input().split())) for i in range(M)]
left = 1
right = N
for LRi in LR:
left = max(left, LRi[0])
right = min(right, LRi[1])
if left > right: break
answer = max(0, right - left + 1)
print(answ... | p03037 |
import sys
def fastio():
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()
de... | def mi():
return list(map(int, input().split()))
'''
3 4
*G*S
G**S
*G*S
'''
n,m = mi()
l = -1
r = 1e10
for i in range(m):
a,b=mi()
if l>b or b<a:
print((0))
exit()
l = max(l,a)
r = min(r,b)
if r<l:
print((0))
else:
print((r-l+1)) | p03037 |
n, m = list(map(int, input().split()))
ans_set = {x for x in range(1, n+1)}
for _ in range(m):
a, b = list(map(int, input().split()))
sub_set = {x for x in range(a, b+1)}
ans_set = ans_set & sub_set
ans = len(ans_set)
print(ans) | n, m = list(map(int, input().split()))
l = [0]*m
r = [0]*m
for i in range(m):
l[i], r[i] = list(map(int, input().split()))
ans = min(r) - max(l)
if ans >= 0 :
print((ans+1))
else:
print((0)) | p03037 |
N,M = list(map(int,input().split()))
#list_aaa = []
#
#for i in range(M):
# L,R = map(int,input().split())
# aaa = set(range(L,R+1))
# list_aaa.append(aaa)
#print(list_aaa)
#and_set = list_aaa[0]
for i in range(M):
L,R = list(map(int,input().split()))
aaa = set(range(L,R+1))
if i ... | N,M = list(map(int,input().split()))
L_list = []
R_list = []
for i in range(M):
L,R = list(map(int,input().split()))
L_list.append(L)
R_list.append(R)
L_max = max(L_list)
R_min = min(R_list)
#print(range(L_max,R_min+1))
print((len(list(range(L_max,R_min+1))))) | p03037 |
N, M = list(map(int, input().split()))
card = False
for _ in range(M):
L, R = list(map(int, input().split()))
if card is not False:
card = card & set([i for i in range(L, R + 1)])
else:
card = set([i for i in range(L, R + 1)])
print((len(card))) | N, M = list(map(int, input().split()))
left = 1
right = N
for _ in range(M):
L, R = list(map(int, input().split()))
if left < L:
left = L
if R < right:
right = R
if left > right:
print((0))
exit()
print((right - left + 1)) | p03037 |
n,m=input().split()
n=int(n)
m=int(m)
i=1
x=list()
y=list()
ans=0
g=0
i=i+1
l,r=input().split()
l=int(l)
r=int(r)
while l != r + 1:
x.append(l)
l = l + 1
i=1
while m!=i:
i=i+1
l,r=input().split()
l=int(l)
r=int(r)
while l != r + 1:
y.append(l)
l =... | n,m=input().split()
n=int(n)
m=int(m)
i=0
x=list()
y=list()
ans=0
g=0
ll=[]
rr=[]
while i!=m:
i=i+1
l,r=input().split()
l=int(l)
r=int(r)
ll.append(l)
rr.append(r)
l=max(ll)
r=min(rr)
ans=r-l+1
if l>r:
ans=0
print(ans)
| p03037 |
n, m = list(map(int, input().split()))
x = list()
for i in range(m):
temp = list(map(int, input().split()))
tempall = set()
for j in range(temp[0],temp[1]+1):
tempall.add(j)
x.append(tempall)
ans = set(x[0])
for i in range(m):
ans = ans & x[i]
print((len(ans))) | n, m = list(map(int, input().split()))
l = [1,n]
for i in range(m):
temp = list(map(int, input().split()))
l[0] = max(l[0],temp[0])
l[1] = min(l[1],temp[1])
print((int(max(l[1]-l[0]+1, 0)))) | p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
ID = list(range(l, r + 1))
for _ in range(m - 1):
l, r = list(map(int, input().split()))
if r < min(ID):
print((0))
exit()
elif max(ID) < l:
print((0))
exit()
elif min(ID) >= l and ... | n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
for _ in range(m - 1):
li, ri = list(map(int, input().split()))
if ri < l:
print((0))
exit()
elif r < li:
print((0))
exit()
elif l >= li and r >= ri:
r = ri
elif l < li... | p03037 |
n,m=list(map(int,input().split()))
zahyo=[0]*m
for i in range(m):
zahyo[i]=list(map(int,input().split()))
collec_lis=[]
for i in range(m):
collec_lis.extend(list(range(int(zahyo[i][0]),int(zahyo[i][1])+1)))
import collections
c = collections.Counter(collec_lis)
kyotu=[int(i) for i in list(c... |
# 左右の範囲を絞っていくことで共通要素のみを炙り出す
n,m = list(map(int,input().split()))
l = -1
r = n+1
for i in range(m):
l_i,r_i = list(map(int,input().split()))
l = max(l,l_i)
r = min(r,r_i)
print((max(0,r-l+1))) | p03037 |
n,m=list(map(int,input().split()))
memo=[]
l,r=list(map(int,input().split()))
for i in range(r-l+1):
memo.append(l+i)
for v in range(m-1):
memo1=[]
l,r=list(map(int,input().split()))
for k in range(len(memo)):
if l<=memo[k]<=r:
memo1.append(memo[k])
memo=memo1
print((... | n,m=list(map(int,input().split()))
l=[]
r=[]
for i in range(m):
l1,r1=list(map(int,input().split()))
l.append(l1)
r.append(r1)
print((0 if min(r)-max(l)+1<0 else min(r)-max(l)+1)) | p03037 |
N, M = [int(n) for n in input().split()]
A = [1 for _ in range(N)]
for _ in range(M):
L, R = [int(n) for n in input().split()]
for i in range(0, L-1, 1):
A[i] = 0
for i in range(R, N, 1):
A[i] = 0
cnt = 0
for i in range(N):
if A[i] == 1:
cnt += 1
print(cnt)
| N, M = [int(n) for n in input().split()]
left, right = 1, N
for _ in range(M):
L, R = [int(n) for n in input().split()]
if left < L:
left = L
if R < right:
right = R
if left <= right:
print((right - left + 1))
else:
print((0))
| p03037 |
import copy
N,M=list(map(int,input().split()))
D=[]
for _ in range(M):
if _==0:
LR=list(map(int,input().split()))
for u in range(LR[0],LR[1]+1):
D.append(u)
else:
LR=list(map(int,input().split()))
DD=copy.deepcopy(D)
for v in DD:
if v n... | N,M=list(map(int,input().split()))
LR=list(list(map(int,input().split())) for _ in range(M))
L=1
R=N
for i in range(M):
L=max(L,LR[i][0])
R=min(R,LR[i][1])
print((R-L+1 if L<=R else 0)) | p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
ans = set(range(l, r + 1))
for _ in range(m - 1):
l, r = list(map(int, input().split()))
ans &= set(range(l, r + 1))
print((len(ans))) | n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
for _ in range(m - 1):
a, b = list(map(int, input().split()))
l = max(l, a)
r = min(r, b)
print((max(0, r - l + 1)))
| p03037 |
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
l_first, r_first = list(map(int, input().split()))
answer_set = {value for value in range(l_first, r_first + 1)}
for _ in range(m - 1):
l_current, r_current = list(map(int, input().split()))
current_set = {value for va... | import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
l_list = []
r_list = []
for _ in range(m):
l, r = list(map(int, input().split()))
l_list.append(l)
r_list.append(r)
l_maybe_answer = max(l_list)
r_maybe_answer = min(r_list)
if l_maybe_answer <= r_maybe_answe... | p03037 |
def main():
N, M = list(map(int, input().split()))
box = []
for i in range(M):
LR = [j for j in map(int, input().split())]
box += LR
# for i in range(M):
# L, R = map(int, input().split())
# box.append(L)
# box.append(R)
# print(box)
num = 0... | def main():
N, M = list(map(int, input().split()))
L = []
R = []
for i in range(M):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
Lout = max(L)
Rout = min(R)
ans = Rout - Lout+1
if ans < 0:
print((0))
else:
pr... | p03037 |
def doqueri(S,N,L,R):
s = S[L-1:R]
l = [0] * (L-1)
r = [0] * (N-R)
return l+s+r
if __name__ == '__main__':
N, M = list(map(int, input().split()))
S = [1] * N
for _ in range(M):
L,R = list(map(int, input().split()))
S = doqueri(S[:],N,L,R)
print((S.count(1))) | if __name__ == '__main__':
N, M = list(map(int, input().split()))
lmax = 0
rmin = N
for _ in range(M):
L,R = list(map(int, input().split()))
if L > lmax:
lmax = L
if R < rmin:
rmin = R
ans = rmin - lmax + 1
if ans < 0:
ans = 0
print(ans) | p03037 |
N, M = list(map(int, input().split()))
stepper = 0
gate = []
for j in range(M):
gate_1, gate_2 = list(map(int, input().split()))
gate.append([gate_1, gate_2])
def numJudge(arr, num):
if arr[0] <= num <= arr[1]:
return 1
else:
return 0
def judge(num):
num += 1
... | N, M = list(map(int, input().split()))
stepper = 0
gate = []
for j in range(M):
gate_1, gate_2 = list(map(int, input().split()))
gate.append([gate_1, gate_2])
gate_min = 0
gate_max = N
for m in range(M):
if gate[m][0] > gate_min:
gate_min = gate[m][0]
if gate[m][1] < gate_ma... | p03037 |
n, m = list(map(int, input().split()))
l, r = [0]*m, [0]*m
for i in range(m):
l[i], r[i] = list(map(int, input().split()))
ans = [0]*n
for i in range(m):
memo = [0]*n
for j in range(l[i]-1, r[i]):
memo[j] = 1
for k in range(n):
ans[k] += memo[k]
print((ans.count(m)... | n, m = list(map(int, input().split()))
l, r = [0]*m, [0]*m
for i in range(m):
l[i], r[i] = list(map(int, input().split()))
ll = max(l)
rr = min(r)
if rr-ll >= 0:
print((rr-ll+1))
else:
print((0)) | p03037 |
import sys
import math
from collections import defaultdict
from collections import deque
def load(vtype=int):
return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
return [vtype(v) for v in input().strip().split(seplator)]
def exit():
import sys
sys.exit(0)
def perm_sub(li, ... | import sys
import math
from collections import defaultdict
from collections import deque
def load(vtype=int):
return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
return [vtype(v) for v in input().strip().split(seplator)]
def exit():
import sys
sys.exit(0)
def perm_sub(li, ... | p03037 |
n, m = list(map(int, input().split()))
array = [list(map(int, input().split())) for i in range(m)]
result = set([i for i in range(1, n+1)])
for el in array:
L, R = el[0], el[1]
work = set([i for i in range(L, R+1)])
result = work & result
print((len(result))) | n, m = list(map(int, input().split()))
array = [list(map(int, input().split())) for i in range(m)]
result = [1, n]
for el in array:
if el[0] > result[1] or result[0] > el[1]:
result = [1, 0]
break
else:
work = sorted(result + el)
result = [work[1], work[2]]
print((resul... | p03037 |
n,m=list(map(int,input().split()))
l,r=list(map(int,input().split()))
a=set(range(l,r+1))
for i in range(m-1):
l,r=list(map(int,input().split()))
a.intersection_update(list(range(l,r+1)))
print((len(a)))
| n,m=list(map(int,input().split()))
ll,rr=0,n
for i in range(m):
l,r=list(map(int,input().split()))
ll=max(l,ll)
rr=min(r,rr)
print((max(rr-ll+1,0))) | p03037 |
N,M = list(map(int,input().split()))
listA=[]
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
count = 0
for i in range(1,N+1):
for j in range(M):
if i < listA[j][0] or listA[j][1] < i:
break;
if j == M-1:
count += 1
print... | N,M = list(map(int,input().split()))
listA=[]
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
L=[]
R=[]
for i in listA:
L.append(i[0])
R.append(i[1])
maxL = max(L)
minR = min(R)
count = 0
for i in range(1,N+1):
if maxL <= i <= minR:
cou... | p03037 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, m = list(map(int, readline().split()))
lr = [list(map(int, readline().split())) for _ in range(m)]
id_list = [i for i in range(lr[0][0], lr[0][1] + 1)]
for i in range(1, m):
x = 1
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n, m = list(map(int, readline().split()))
lr = [list(map(int, readline().split())) for _ in range(m)]
left = 0
right = n
for i in range(m):
left = max(left, lr[i][0])
right = min(rig... | p03037 |
N, M = list(map(int, input().split()))
K = set(range(1, N + 1))
for i in range(M):
l, r = list(map(int, input().split()))
K = K & set(range(l, r + 1))
print((len(K))) | N, M = list(map(int, input().split()))
L = 1
R = N
for i in range(M):
l, r = list(map(int, input().split()))
if l > L:
L = l
# print('L ' + str(L))
if r < R:
R = r
# print('R ' + str(R))
if L > R:
print((0))
else:
print((R - L + 1))
| p03037 |
N, M = list(map(int, input().split()))
LR = []
for _ in range(M):
l, r = list(map(int, input().split()))
LR.append((l, r))
cards = LR[:]
master_ids = set(range(cards[0][0], cards[0][1]+1))
for l, r in cards:
ids = set(range(l, r+1))
master_ids = master_ids & ids
if not master_ids:
... | N, M = list(map(int, input().split()))
LR = []
for _ in range(M):
l, r = list(map(int, input().split()))
LR.append((l, r))
cards = LR[:]
import sys
INT_MAX = sys.maxsize
left_id = 0
right_id = INT_MAX
for l, r in cards:
left_id = max(left_id, l)
right_id = min(right_id, r)
... | p03037 |
n, m = list(map(int, input().split()))
Authority = [list(map(int, input().split())) for _ in range(m)]
cards = set(range(1, n + 1))
for i in range(m):
gate = set(range(Authority[i][0], Authority[i][1] + 1))
cards &= gate
print((len(cards)))
| n, m = list(map(int, input().split()))
Authority = [list(map(int, input().split())) for _ in range(m)]
cards = list(range(1, n + 2))
l_list = []
r_list = []
for i in range(m):
l_list.append(Authority[i][0])
r_list.append(Authority[i][1])
print((len(cards[max(l_list):min(r_list) + 1])))
| p03037 |
N,M=(int(i) for i in input().split())
gate=[]
for i in range(M):
gate.append([int(i) for i in input().split()])
gate[i].append(gate[i][1]-gate[i][0])
gate=sorted(gate,key=lambda x:x[2])
answer=0
for i in range(N+1):
ok=1
for l,r,p in gate:
if l<=i and i<=r:
pass
... | N,M=(int(i) for i in input().split())
gate=[]
for i in range(M):
gate.append([int(i) for i in input().split()])
maxl=max(gate,key=lambda x:x[0])[0]
minr=min(gate,key=lambda x:x[1])[1]
if maxl<=minr:
print((minr-maxl+1))
else:
print((0)) | p03037 |
n, m = [int(i) for i in input().split()]
x = [[0 for _ in range(m)] for i in range(n)]
for i in range(m):
l, r = [int(i) for i in input().split()]
for j in range(l-1, r):
x[j][i] = 1
counter = 0
for i in range(n):
if sum(x[i]) == m:
counter += 1
print(counter) | n, m = [int(i) for i in input().split()]
ll = []
rr = []
for i in range(m):
l, r = [int(i) for i in input().split()]
ll.append(l)
rr.append(r)
ans = min(rr) - max(ll) + 1
if ans < 0:
ans = 0
print(ans) | p03037 |
n,m = list(map(int,input().split()))
a = {}
for i in range(m):
l,r = list(map(int,input().split()))
for j in range(l,r+1):
if not j in a:
a[j] = 1
else:
a[j] += 1
count = 0
for key in list(a.keys()):
if a[key] == m:
count +=1 ... | n,m = list(map(int,input().split()))
min,max = list(map(int,input().split()))
for i in range(m-1):
l,r = list(map(int,input().split()))
if l > max:
print((0))
exit(0)
if r < min:
print((0))
exit(0)
if l > min:
min = l
if r < max:
... | p03037 |
n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
ans = [x for x in range(l, r+1)]
if m > 1:
for i in range(m-1):
l, r = list(map(int, input().split()))
ans = [x for x in range(l, r+1) if x in ans]
print((len(ans)))
| n, m = list(map(int, input().split()))
l, r = list(map(int, input().split()))
ans = -1
if m > 1:
for i in range(m-1):
_l, _r = list(map(int, input().split()))
if (l < _l <= r):
l = _l
if (l <= _r < r):
r = _r
if _r < l or r < _l:
ans = 0... | p03037 |
card_num, gate_num = list(map(int, input().split()))
table = [0] * card_num
count = 0
for i in range(gate_num):
start_num, end_num = list(map(int, input().split()))
for j in range(start_num-1, end_num):
table[j] += 1
for l in range(card_num):
if table[l] == gate_num:
count += ... | # 先頭の最大と最後尾の最小を求める
card_num, gate_num = list(map(int, input().split()))
lmax, rmin = list(map(int, input().split())) # 最初の入力がlの最大とrの最小
for i in range(1, gate_num):
l, r = list(map(int, input().split()))
lmax = max(lmax, l) # lmaxにlmaxとlの大きい方
rmin = min(rmin, r) # rminにrminとrの小さい方
print((max(0, rmin-l... | p03037 |
n,m=list(map(int,input().split()))
D=[list(map(int,input().split())) for i in range(m)]
I=set(i for i in range(1,n+1))
for i in range(m):
I &= set(i for i in range(D[i][0],D[i][1]+1))
print((len(I))) | n,m=list(map(int,input().split()))
D=[list(map(int,input().split())) for i in range(m)]
maxI=n
minI=1
for i in range(m):
maxI=min(maxI,D[i][1])
minI=max(minI,D[i][0])
print((max(maxI-minI+1,0))) | p03037 |
def set_range(x, y):
return {t+x for t in range(y-x)}
N, M = list(map(int, input().split()))
L = [0]*M
R = [0]*M
for m in range(M):
L[m], R[m] = list(map(int, input().split()))
S = set_range(1, N+1)
for m in range(M):
S = S.intersection(set_range(L[m], R[m]+1))
print((len(S))) | N, M = list(map(int, input().split()))
L = [0]*M
R = [0]*M
for m in range(M):
L[m], R[m] = list(map(int, input().split()))
print((max(0,min(R)-max(L)+1))) | p03037 |
import sys
input=sys.stdin.readline
N,M = list(map(int, input().split()))
g = set(i for i in range(1,N+1))
for i in range(M):
l,r = list(map(int, input().split()))
t = set(i for i in range(l,r+1))
g = g & t
print((len(g)))
| import sys
input=sys.stdin.readline
N,M = list(map(int, input().split()))
l,r = 1,N
for i in range(M):
l1,r1 = list(map(int, input().split()))
if l1>l:
l = l1
if r1<r:
r = r1
if r-l<0:
print((0))
else:
print((r-l+1))
| p03037 |
# ABC127C - Prison
n, m = list(map(int, input().rstrip().split()))
lst = [list(map(int, input().rstrip().split())) for _ in range(m)]
gates = [{j for j in range(i[0], i[1] + 1)} for i in lst]
ans = gates[0]
for i in gates[1:]:
ans = ans & i
print((len(ans))) | # ABC127C - Prison
n, m = list(map(int, input().rstrip().split()))
a, b = list(map(int, input().rstrip().split()))
ans = {i for i in range(a, b + 1)}
for _ in range(m - 1):
a, b = list(map(int, input().rstrip().split()))
ans = ans & {i for i in range(a, b + 1)}
print((len(ans))) | p03037 |
# ABC127C - Prison
n, m = list(map(int, input().rstrip().split()))
lst = [list(map(int, input().rstrip().split())) for _ in range(m)]
ans = 0
l, r = lst[0][0], lst[0][1]
for i in lst[1:]:
l = max(l, i[0])
r = min(r, i[1])
for i in range(1, n + 1):
if l <= i <= r:
ans += 1
print(ans) | # ABC127C - Prison
# l-max < i < r-min -> count i
n, m = list(map(int, input().rstrip().split()))
lst = [list(map(int, input().rstrip().split())) for _ in range(m)]
l, r = lst[0][0], lst[0][1]
for i in lst[1:]:
l = max(l, i[0])
r = min(r, i[1])
print((max(0, r - l + 1))) | p03037 |
tmp = input().split()
N = int(tmp[0])
M = int(tmp[1])
cardlist = []
for i in range(M):
cardlist.append(list(map(int, input().split())))
count = 0
for i in range(1, N+1):
flag = True
for j in range(M):
if (cardlist[j][0] > i or cardlist[j][1] < i):
flag = False
break
if (flag... | tmp = input().split()
N = int(tmp[0])
M = int(tmp[1])
max = N
min = 0
for i in range(M):
inputcard = list(map(int, input().split()))
if min < inputcard[0]:
min = inputcard[0]
if max > inputcard[1]:
max = inputcard[1]
if (max - min + 1 < 0):
print((0))
else:
print((max - min + 1... | p03037 |
N, M = list(map(int, input().split()))
master = set(range(1, N+1))
for _ in range(M):
L, R = list(map(int, input().split()))
master = master & set(range(L, R+1))
print((len(master))) | N, M = list(map(int, input().split()))
lb = 1
rb = N
for _ in range(M):
L, R = list(map(int, input().split()))
lb = max(lb, L)
rb = min(rb, R)
print((rb-lb+1 if lb <= rb else 0)) | p03037 |
n,m = list(map(int,input().split()))
card = [0]*n
for i in range(m):
l,r = list(map(int,input().split()))
l -= 1
card[l:r] = list([x+1 for x in card[l:r]])
print((card.count(m))) | n,m = list(map(int,input().split()))
card = [0]*n
l,r = 1,n
for i in range(m):
tmp_l,tmp_r = list(map(int,input().split()))
if l < tmp_l:
l=tmp_l
if r > tmp_r:
r = tmp_r
ans = 0
if r-l>=0:
ans = r-l+1
print(ans) | p03037 |
n,m = list(map(int, input().split()))
for m_i in range(m):
l,r = list(map(int, input().split()))
if m_i==0:
ans = set(range(l, r+1))
else:
ans &= set(range(l, r+1))
print((len(ans))) | n,m = list(map(int, input().split()))
L = []
R = []
for _ in range(m):
l,r = list(map(int, input().split()))
L.append(l)
R.append(r)
print((min(R)-max(L)+1 if min(R)-max(L)>=0 else 0)) | p03037 |
#n: id card
#m: gate
n, m = list(map(int, input().split()))
data = [0 for i in range(n+1)]
ans = 0
for i in range(m):
l, r = list(map(int, input().split()))
for j in range(l, r+1):
data[j] += 1
if data[j] == m:
ans += 1
print(ans) | #n: id card
#m: gate
n, m = list(map(int, input().split()))
data = [0 for i in range(n+1)]
for i in range(m):
l, r = list(map(int, input().split()))
data[l-1] += 1
data[r] -= 1
for i in range(n):
data[i+1] += data[i]
print((data.count(m))) | p03037 |
N, M = [int(x) for x in input().split()]
LR = [[int(x) for x in input().split()] for i in range(M)]
LR = [list(range(x,y+1)) for (x,y) in LR]
res = set(LR[0])
for x in LR[1:]:
# print(res)
# print(x)
res = res.intersection(set(x))
# print(res)
print((len(res))) | N, M = [int(x) for x in input().split()]
L = 1
R = N
for i in range(M):
L_,R_ = [int(x) for x in input().split()]
L = max(L, L_)
R = min(R, R_)
print((max((R-L + 1), 0))) | p03037 |
n, m = input().split()
N = int(n)
M = int(m)
s = set([])
card = N
for i in range(M):
l, r = input().split()
L = int(l)
R = int(r)
for j in range(N):
if L <= j+1 and j+1 <= R:
pass
else:
s.add(j+1)
print((N - len(list(s))))
| n, m = input().split()
N = int(n)
M = int(m)
listL = []
listR = []
card = N
for i in range(M):
l, r = input().split()
L = int(l)
R = int(r)
listL.append(L)
listR.append(R)
maxL = max(listL)
minR = min(listR)
if minR < maxL:
result = 0
else:
result = minR - maxL + 1
... | p03037 |
N, M = list(map(int, input().split()))
L = []
R = []
for i in range(M):
L_in, R_in = list(map(int, input().split()))
L.append(L_in)
R.append(R_in)
cnt = 0
for n in range(N):
counter = 0
for m in range(M):
if (n + 1) == R[m] or (L[m] <= (n + 1) and (n + 1) <= R[m]):
... | N, M = list(map(int, input().split()))
L = []
R = []
for m in range(M):
L_in, R_in = list(map(int, input().split()))
L.append(L_in)
R.append(R_in)
if min(R) >= max(L):
print((min(R) - max(L) + 1))
else:
print((0))
| p03037 |
N,M=list(map(int,input().split()))
all=[]
for i in range(M):
L,R=list(map(int,input().split()))
ids=[b for b in range(L,R+1)]
all.append(ids)
for a in range(M):
ans=set(all[a])&set(all[0])
print((len(ans))) | N,M=list(map(int,input().split()))
all=[]
for i in range(M):
L,R=list(map(int,input().split()))
if i==0:
ans=[b for b in range(L,R+1)]
else:
ids=[b for b in range(L,R+1)]
ans=set(ans)&set(ids)
print((len(ans))) | p03037 |
N,M=list(map(int,input().split()))
all=[]
for i in range(M):
L,R=list(map(int,input().split()))
if i==0:
ans=[b for b in range(L,R+1)]
else:
ids=[b for b in range(L,R+1)]
ans=set(ans)&set(ids)
print((len(ans))) | N,M=list(map(int,input().split()))
L,R=[],[]
for i in range(M):
l,r=list(map(int,input().split()))
L.append(l)
R.append(r)
ans=min(R)-max(L)+1
if ans<=0:
ans=0
print(ans) | p03037 |
import sys
input = sys.stdin.readline
def main():
N, M = [int(x) for x in input().split()]
answer = set()
for i in range(M):
L, R = [int(x) for x in input().split()]
if i == 0:
answer = {x for x in range(L, R + 1)}
else:
s = {x for x in range(L, ... | import sys
input = sys.stdin.readline
def main():
N, M = [int(x) for x in input().split()]
A = []
for i in range(M):
A.append([int(x) for x in input().split()])
answer = A[0]
for i in range(1, M):
if max(answer) < min(A[i]) or max(A[i]) < min(answer):
prin... | p03037 |
n, m = list(map(int, input().split()))
buf = set(range(1, n+1))
for i in range(m):
l, r = list(map(int, input().split()))
buf = buf & set(range(l, r+1))
print((len(buf)))
| a = 1
n, m = list(map(int, input().split()))
ans_r = 10 ** 5
l_list = []
r_list = []
for i in range(m):
l, r = list(map(int, input().split()))
l_list.append(int(l))
r_list.append(int(r))
for r in r_list:
if ans_r > r:
ans_r = r
for l in l_list:
if a < l:
a = l
if... | p03037 |
N, M = list(map(int, input().split()))
B = set()
for i in range(M):
L, R = list(map(int, input().split()))
A = set(j for j in range(L, R+1))
if i == 0:
B = A
B = A & B
print((len(B)))
| N, M = list(map(int, input().split()))
maxL = 1
minR = N
for i in range(M):
L, R = list(map(int, input().split()))
maxL = max(maxL, L)
minR = min(minR, R)
print((max(minR - maxL +1, 0))) | p03037 |
n, m = list(map(int, input().split()))
left, right = list(map(int, input().split()))
ans = set(range(left, right+1))
for i in range(m-1):
left, right = list(map(int, input().split()))
set_temp = set(range(left, right+1))
ans = ans & set_temp
print((len(ans))) | n, m = list(map(int, input().split()))
min_num = 0
max_num = 10**5
for i in range(m):
min_temp, max_temp = list(map(int, input().split()))
if min_temp > min_num:
min_num = min_temp
if max_temp < max_num:
max_num = max_temp
print((max(max_num - min_num + 1, 0)))
| p03037 |
def resolve():
N,M = list(map(int,input().split()))
# LL,RR = [],[]
# for i in range(M):
# L,R = map(int,input().split())
# LL.append(L)
# RR.append(R)
ans = 0
# print()
# print(N,M)
# print(LL,RR)
bool_id = [1]*N
# print(bool_id)
for i in range(M): ... | def resolve():
N,M = list(map(int,input().split()))
LL,RR = [],[]
for i in range(M):
L,R = list(map(int,input().split()))
LL.append(L)
RR.append(R)
bool_id = [1]*N
lmin = -1
rmax = 10**10
for i in range(M):
lmin = max(lmin,LL[i])
rmax = m... | p03037 |
N, M = list(map(int,input().split()))
ID = list(i+1 for i in range(N))
for i in range(M):
L,R = list(map(int,input().split()))
ID_new = [j for j in range(L,R+1)]
ID = set(ID) & set(ID_new)
print((len(ID))) | N, M = list(map(int,input().split()))
l=1
r=N
for i in range(M):
L,R = list(map(int,input().split()))
l = max(l,L)
r = min(r,R)
ans = r-l+1
if ans >= 0:
print(ans)
else:
print((0))
| p03037 |
# -*- coding: utf-8 -*-
# abc127/abc127_c
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: ... | # -*- coding: utf-8 -*-
# abc127/abc127_c
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: ... | p03037 |
def resolve():
(n, m) = list(map(int, input().split(" ")))
results = [0] * n
for i in range(m):
o = list(map(int, input().split(" ")))
if i == 0:
results[o[0]:o[1]+1] = [1] * (o[1]+1-o[0])
continue
for j in range(n):
if not results[j]:
... | def resolve():
(n, m) = list(map(int, input().split(" ")))
for i in range(m):
o = list(map(int, input().split(" ")))
if i == 0:
lmax = o[0]
rmin = o[1]
else:
lmax = max(lmax, o[0])
rmin = min(rmin, o[1])
print((rmin-lm... | p03037 |
n, m = [int(i) for i in input().split()]
table = [[int(i) for i in input().split()] for m in range(m)]
a = list(range(table[0][0],table[0][1]+1))
ans = a
for i,t in enumerate(table[1:]):
if i == 0:
b = list(range(t[0], t[1]+1))
ans = set(a) & set(b)
else:
b = list(range(t[0], t[1]+1... | n,m=list(map(int,input().split()))
low=1
high=n
for i in range(m):
l,r=list(map(int,input().split()))
low = max(low,l)
high=min(high,r)
ans=high-low+1
print((ans if ans>=0 else 0)) | p03037 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.