problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03037 | s481769819 | Wrong Answer | # import math
# import statistics
# a=input()
#b,c=int(input()),int(input())
# c=[]
# for i in a:
# c.append(i)
e1,e2 = map(int,input().split())
#f = list(map(int,input().split()))
#g = [input() for _ in range(a)]
h = []
for i in range(e2):
h.append(list(map(int,input().split())))
L=[]
R=[]
for i in range(len(h... |
p03037 | s755198198 | Wrong Answer | n,m = map(int,input().split())
ans,ansf = 1,n
for i in range(m):
l,r = map(int,input().split())
ans = max(ans,l)
ansf = min(ansf,r)
print(ansf-ans+1)
|
p03037 | s181855315 | Wrong Answer | n, m = map(int, input().split())
l = [0]*m
r = [0]*m
for i in range(m):
l[i], r[i] = map(int, input().split())
print(min(r) - max(l)+1)
|
p03037 | s103412780 | Wrong Answer | N, M = map(int,input().split())
l = 0; r = N;
for i in range(M):
a, b = map(int,input().split())
l = max(l, a)
r = min(r, b)
print(max(0, abs(r-l)+1)) |
p03037 | s251026846 | Wrong Answer | N, M = map(int, input().split())
L = 0
R = N
for i in range(M):
l, r = map(int,input().split())
L = max(L, l)
R = min(R, r)
print(R - L + 1) |
p03037 | s727167934 | Wrong Answer | ans=0
a,b=map(int,input().split())
W=[]
for i in range(b):
s,t=map(int,input().split())
for k in range(s,t+1):
W.append(k)
for d in range(len(W)+1):
V=W.count(d)
if V==b:
ans+=1
print(ans) |
p03037 | s201093759 | Wrong Answer |
n,m = map(int,input().split())
l = []
r = []
for i in range(m):
L,R = map(int,input().split())
l.append(L)
r.append(R)
left = max(l)
right = min(r)
if left >= right:
print(0)
else:
print(right - left + 1)
|
p03037 | s796817799 | Wrong Answer | n,m=map(int,input().split())
left=0
right=10**5
for i in range(m):
l,r=map(int,input().split())
left=max(left,l)
right=min(right,r)
print(right-left+1) |
p03037 | s733174563 | Wrong Answer | ans=0
a,b=map(int,input().split())
W=[]
for i in range(b):
s,t=map(int,input().split())
for k in range(s,t+1):
W.append(k)
for d in range(len(W)+1):
V=W.count(d)
if V==b:
ans+=1
print(ans)
|
p03037 | s010689734 | Wrong Answer | import numpy as np
n, m = map(int, input().split())
#card_list = np.zeros(n)
under = 1
top = n
for i in range(m):
l, r = map(int, input().split())
if under < l:
under = l
if top > r:
top = r
#print(under, top)
print(top-under+1)
|
p03037 | s020952571 | Wrong Answer | N, M = [int(i) for i in input().split()]
left = 0
right = N - 1
for _ in range(M):
L, R = [int(i) for i in input().split()]
if left < L:
left = L
if right > R:
print(right, R)
right = R
print(right-left+1)
|
p03037 | s586980739 | Wrong Answer | n,m=map(int,input().split())
ansl=1
ansr=n
for i in range(m):
l,r=map(int,input().split())
if ansl<l:
ansl=l
if ansr>r:
ansr=r
print(ansr-ansl+1) |
p03037 | s649766294 | Wrong Answer | n, m = map(int, input().split())
l_max = 0
r_min = float('inf')
for i in range(m):
l, r = map(int, input().split())
l_max = max(l_max, l)
r_min = min(r_min, r)
ans = int(r_min-l_max+1)
print(ans) |
p03037 | s549452571 | Wrong Answer | n,m = map(int, input().split())
l,r = [0]*m,[0]*m
for i in range(m):
l[i],r[i] = map(int,input().split())
s = min(n,min(r)) - min(n,max(l))
print(s+1) |
p03037 | s013071810 | Wrong Answer | n,m=map(int,input().split())
a=[]
b=[]
for i in range(m):
l,r=map(int,input().split())
a.append(l)
b.append(r)
x=max(a)
y=min(b)
print(y-x+1) |
p03037 | s735501517 | Wrong Answer | n, m = map(int, input().split())
l = 1
r = n
for _ in range(m):
li, ri = map(int, input().split())
l = max(l, li)
r = min(r, ri)
print(r - l + 1 if r > 0 else 0)
|
p03037 | s326906453 | Wrong Answer | N, M = map(int,input().split())
LR = [list(map(int,input().split())) for _ in range(M)]
max_L = 0
min_R = 10**5
for m in range(M):
if max_L > LR[m][0]:
max_L = LR[m][0]
if min_R <LR[m][1]:
min_R = LR[m][1]
L = [x[0] for x in LR]
R = [x[1] for x in LR]
if max(L) - min(R) >=0:
print(max(L)-min(R)... |
p03037 | s191651315 | Wrong Answer | import numpy as np
n, m = map(int, input().split())
table = np.ones(n, dtype=int)
for i in range(m):
l, r = map(int, input().split())
table[:l-1] = 0
table[r+1:] = 0
print(sum(table)) |
p03037 | s962292050 | Wrong Answer | n, m = map(int, input().split())
L_max, R_min = map(int, input().split())
for i in range(m-1):
l, r = map(int, input().split())
L_max = max(L_max, l)
R_min = min(R_min, r)
print(R_min - L_max + 1) |
p03037 | s897559855 | Wrong Answer | n, m = map(int, input().split())
left = 0
right = m+1
for i in range(m):
l, r = map(int, input().split())
left = max(left, l)
right = min(right, r)
ans = 0
for i in range(left-1, right):
ans += 1
print(ans)
|
p03037 | s974583021 | Wrong Answer | n,m=map(int, input().split())
lr = [map(int, input().split()) for _ in range(m)]
l, r = [list(i) for i in zip(*lr)]
answer = (r[0] - l[-1] +1)
print(answer) |
p03037 | s801364609 | Wrong Answer | N, M = map(int, input().split())
l_max = 1
r_min = N + 1
for _ in range(M):
L, R = map(int, input().split())
if l_max < L:
l_max = L
if r_min > R:
r_min = R
if r_min < l_max:
print(r_min - l_max + 1)
else:
print(0) |
p03037 | s436788624 | Wrong Answer | N,M=map(int,input().split())
LR=[list(map(int,input().split())) for _ in range(M)]
l=0
r=10**5+1
for i in LR:
if i[0]>l:
l=i[0]
if i[1]<r:
r=i[1]
print(r-l+1) |
p03037 | s271117896 | Wrong Answer | N, M = list(map(int, input("").split(" ")))
permit = [list(map(int, input("").split(" "))) for i in range(M)]
able = [1 for i in range(N)]
l,r = 1, N
for i,j in permit:
l = max(l, i)
r = min(r, j)
print(r-l+1) |
p03037 | s180658372 | Wrong Answer | def main():
N, M = map(int, input().split())
Lmax = 0
Rmin = N+1
for i in range(M):
L, R = map(int, input().split())
if L > Lmax:
Lmax = L
if R < Rmin:
Rmin = R
print(Rmin - Lmax + 1)
main() |
p03037 | s136288669 | Wrong Answer | n,m = map(int,input().split())
min_i = 1
max_i = n
for i in range(m):
l,r = map(int,input().split())
min_i = max(min_i,l)
max_i = min(max_i,r)
print(max_i-min_i+1) |
p03037 | s388376197 | Wrong Answer | N, M=map(int, input().split()) #複数数値入力 「A B」みたいなスペース空いた入力のとき
LR=[[int(i) for i in input().split()] for i in range(M)] # 二次元配列入力 二次元マップみたいな入力のとき
mi, ma = 0, 10**5
for i in LR:
mi = max(mi, i[0])
ma = min(ma, i[1])
if ma-mi <= 0:
print(0)
else:
print(ma-mi + 1) |
p03037 | s398619114 | Wrong Answer | N, M = map(int, input().split())
L = 0
R = N
for i in range(M):
l, r = map(int, input().split())
L = max(L, l)
R = min(R, r)
print(R - L + 1) |
p03037 | s928175603 | Wrong Answer | def main():
N,M = map(int, input().split())
l=-100000
r=1000000
for i in range(M):
L,R =map(int,input().split())
if l<L:
l=L
if R<r:
r=R
print(r-l+1)
main() |
p03037 | s590014501 | Wrong Answer | n, m = map(int, input().split())
array = [list(map(int, input().split())) for i in range(m)]
result = [1, n]
for el in array:
work = sorted(result + el)
result = [work[1], work[2]]
if result[0] > result[1]:
result = [1, 0]
break
print(result[1]-result[0]+1) |
p03037 | s017785084 | Wrong Answer | # -*- coding: utf-8 -*-
def main():
N,M = map(int,input().split())
LR = [list(map(int,input().split())) for i in range(M)]
LR.sort(key=lambda x: x[0],reverse=True)
lmax = LR[0][0]
LR.sort(key=lambda x: x[1])
rmin = LR[0][1]
print(rmin-min(rmin,lmax)+1)
if __name__ == '__main__':
main() |
p03037 | s471639996 | Wrong Answer | N,M=map(int, input().split())
pass_id = [i for i in range(1, N+1)]
for i in range(M):
L,R=map(int, input().split())
for id in pass_id:
if not id in range(L,R+1):
pass_id.pop(pass_id.index(id))
print(len(pass_id)) |
p03037 | s378628056 | Wrong Answer | n, m = map(int, input().split())
rg = []
for i in range(m):
rg.append(list(map(int, input().split())))
ans = set(range(0, n))
for i in rg:
ans &= set(range(i[0], i[1]))
print(len(ans)+1) |
p03037 | s231229239 | Wrong Answer | N,M=map(int,input().split())
G=[list(map(int,input().split())) for _ in range(M)]
min=0
max=float("inf")
for i in range(M):
if G[i][0]>min:
min=G[i][0]
if G[i][1]<max:
max=G[i][1]
print(max-min+1) |
p03037 | s730263549 | Wrong Answer | n, m = map(int, input().split())
a = 0
b = 10**5+1
for i in range(m):
l, r = map(int, input().split())
a = max(a, l)
b = min(b, r)
print(b-a+1)
|
p03037 | s562050900 | Wrong Answer | n,m = map(int,input().split())
num_conter = [1]*n
max_L = 0
max_R = 10**5+1
for i in range(m):
L,R = map(int,input().split())
if max_L < L:
max_L = L
if max_R > R:
max_R = R
print(max_R-max_L+1)
|
p03037 | s170781590 | Wrong Answer | def solve():
import sys
n, m, *LR = map(int, sys.stdin.read().split())
L = LR[::2]
R = LR[1::2]
l = max(L)
r = min(R)
print(r - l + 1)
solve()
|
p03037 | s795086871 | Wrong Answer | n, m = map(int, input().split())
l_max = 0
r_min = 10**6
for i in range(m):
l, r = map(int, input().split())
l_max = max(l_max, l)
r_min = min(r_min, r)
print(r_min-l_max+1)
|
p03037 | s942185433 | Wrong Answer | def main():
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
L, R = 1, N
for _ in range(M):
left, right = map(int, input().split())
L = max(L, left)
R = min(R, right)
ans = R - L + 1
print(ans)
if __name__ == '__main__':
main()
# import... |
p03037 | s757592202 | Wrong Answer | n, m = map(int, input().split())
l0, r0 = 1, n
for j in range(m):
l1, r1 = map(int, input().split())
l0 = max(l0, l1)
r0 = min(r0, r1)
print(r0-l0+1)
|
p03037 | s177759190 | Wrong Answer | n, m = map(int, input().split())
ll = [0 for i in range(n+1)]
l_max = 0
r_min = 1000000
for _ in range(m):
l, r = map(int, input().split())
if l > l_max :
l_max = l
if r < r_min:
r_min = r
print(r_min - l_max + 1) |
p03037 | s745526282 | Wrong Answer | n,m=map(int,input().split())
##かーどについての初期配列
head =0
tail = n
for i in range(m):
l,r = map(int,input().split())
head = max(head,l)
tail = min(r,tail)
print(tail-head+1) |
p03037 | s477306311 | Wrong Answer | n, m = map(int, input().split())
l = 0
r = float('inf')
for i in range(m):
li, ri = map(int, input().split())
lb, rb = True, True
if l <= li <= r:
l = li
elif li < l:
pass
else:
lb = False
if r >= ri >= l:
r = ri
elif ri > r:
pass
else:
rb ... |
p03037 | s025856740 | Wrong Answer | import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y)... |
p03037 | s848706706 | Wrong Answer | N, M = map(int, input().split())
lower = 0
upper = N+1
for _ in range(M):
L, R = map(int, input().split())
lower = max(lower, L)
upper = min(upper, R+1)
print(upper - lower)
|
p03037 | s280583532 | Wrong Answer | N,M = map(int,input().split())
bottom = 0
top = N+1
for i in range(M):
L,R = map(int,input().split())
bottom = max(bottom, L)
top = min(top,R)
print(top - bottom + 1) |
p03037 | s656987617 | Wrong Answer | N, M = map(int, input().split())
L = sorted([list(map(int, input().split())) for _ in range(M)])
ml = 0
mm = 10**7
for v in L:
ml = max(ml, v[0])
mm = min(mm, v[1])
print(mm - ml + 1)
|
p03037 | s109254997 | Wrong Answer | def resolve():
N, M = [int(i) for i in input().split()]
llrr = [list(map(int, input().split())) for _ in range(M)]
maxL = 1
minR = N
for l, r in llrr:
maxL = max(maxL, l)
minR = min(minR, r)
ans = minR - maxL + 1
if ans < 0:
print(0)
else:
print(ans)
|
p03037 | s640671416 | Wrong Answer | import copy
N, M = map(int, input().split())
l1 = []
l2 = []
for i in range(M):
L, R = map(int, input().split())
l1 = list(range(L,R+1))
if len(l2) == 0:
l2 = copy.copy(l1)
ans = set(l1) & set(l2)
l2 = copy.copy(ans)
print(len(ans)) |
p03037 | s858513325 | Wrong Answer | n, m = map(int, input().split())
l = 1
r = m
for _ in range(m):
li, ri = map(int, input().split())
l = max(l, li)
r = min(r, ri)
print(r - l + 1 if r >= 1 else 0)
|
p03037 | s672622824 | Wrong Answer | import sys
sys.setrecursionlimit(10**6)
n, m = map(int, input().split())
L = []; R = []
for _ in range(m):
l, r = map(int, input().split())
L.append(l)
R.append(r)
maxL = max(L)
minR = min(R)
ans = minR-maxL+1
print(ans) |
p03037 | s493343557 | Wrong Answer | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
n, m = map(int, readline().split())
INF = int(1e5)+1
mx = -1
mi = INF
for _ in range(m):
l, r = map(int, readline().split())
mx = max(l, mx)
mi =... |
p03037 | s677493274 | Wrong Answer | n,m = map(int,input().split())
max_L = []
min_R = []
cnt = 0
for i in range(m):
L,R = map(int,input().split())
max_L.append(L)
min_R.append(R)
print(min(min_R)-max(max_L)+1) |
p03037 | s203832196 | Wrong Answer | n , m = map(int, input().split())
count = 0
low = 0
high = n
for _ in range(m):
l,r=map(int, input().split())
low = max(l, low)
high = min(high, r)
#print(low, high)
print(high-low+1) |
p03037 | s068995052 | Wrong Answer | N,M = map(int,input().split())
k_1 = []
k_2 = []
for i in range(M):
l,r = map(int,input().split())
k_1.append(l)
k_2.append(r)
print(min(k_2)-max(k_1)+1)
|
p03037 | s570797213 | Wrong Answer | N,M = map(int, input().split())
l=0
r=N
for _ in range(M):
ll,rr=map(int,input().split())
l = max(l,ll)
r = min(r,rr)
print(r-l+1) |
p03037 | s744041802 | Wrong Answer | n,m = map(int,input().split())
l = []
r = []
for i in range(m):
l_t,r_t = map(int,input().split())
l.append(l_t)
r.append(r_t)
print(min(r)-max(l)+1)
|
p03037 | s377426640 | Wrong Answer | n, m = [int(i) for i in input().split()]
l = []
r = []
for _ in range(m):
i, k = [int(i) for i in input().split()]
l.append(i)
r.append(k)
print(min(r) - max(l) + 1)
|
p03037 | s171739650 | Wrong Answer | N,M=map(int,input().split())
ans=0
L,R=0,(10**5)+1
for i in range(M):
l,r=map(int,input().split())
L=max(L,l); R=min(R,r)
if r<l: break
R=min(R,N)
print(abs((L-1)-R) if 0<R-L else 0) |
p03037 | s097113295 | Wrong Answer | N, M = map(int, input().split())
Lmax = 0
Rmin = 10**5 + 1
for n in range(M):
L, R = map(int, input().split())
if L > Lmax:
Lmax = L
if R < Rmin:
Rmin = R
gate = Rmin - Lmax + 1
print(gate) |
p03037 | s187217758 | Wrong Answer | n,m = map(int,input().split())
gate = [[int(i) for i in input().split()] for _ in range(m)]
minv = gate[0][0]
maxv = gate[0][1]
for x in gate:
minv = max(minv,x[0])
maxv = min(maxv,x[1])
print(maxv-minv+1)
|
p03037 | s153780400 | Wrong Answer | N,M=map(int,input().split())
L=[0]*M
R=[0]*M
for i in range(M):
L[i],R[i]=map(int,input().split())
print(min(R)-max(L)+1) |
p03037 | s013157213 | Wrong Answer | # coding: utf-8
import sys
import itertools
def sr(): return sys.stdin.readline().rstrip()
def ir(): return int(sr())
def lr(): return list(map(int, sr().split()))
N, M = lr()
l_list = []
r_list = []
for i in range(M):
l, r = lr()
l_list.append(l)
r_list.append(r)
maxL = 0
minR = 100000000
for i in... |
p03037 | s580797314 | Wrong Answer |
def main():
n,m = map(int,input().split())
lm = 1
rm = n
for i in range(m):
l,r = map(int,input().split())
lm = max(lm,l)
rm = min(rm,r)
print(rm-lm+1)
if __name__ == "__main__":
main()
|
p03037 | s276263015 | Wrong Answer | N,M= map(int,input().split())
gate=[list(map(int,input().split())) for i in range(M)]
count2=0
min1=0
max1=1000000000
for j in gate:
if j[0]>min1:
min1=j[0]
if j[1]<max1:
max1=j[1]
print(max1-min1+1) |
p03037 | s749000403 | Wrong Answer | N, M = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(M)]
l = 0
r = 100001
for lr in LR:
l = max(lr[0], l)
r = min(r, lr[1])
print(r - l + 1) |
p03037 | s717498957 | Wrong Answer | N, M = map(int, input().split())
L = [0] * M
R = [0] * M
for i in range(M):
L[i], R[i] = map(int,input().split())
count = 1
for i in range(N):
if max(L) <= i <= min(R):
count += 1
print(count) |
p03037 | s866516755 | Wrong Answer | import collections
n,m = map(int,input().split())
card = [list(map(int,input().split())) for c in range(m)]
l = 0
r = n
for index,c in enumerate(card):
if c[0] >= l:
l = c[0]
if c[1] <= r:
r = c[1]
print(r-l+1)
|
p03037 | s109167099 | Wrong Answer | n, m = map(int, input().split())
L = []
R = []
for i in range(m):
l, r = map(int, input().split())
L.append(l)
R.append(r)
print(min(R) - max(L) + 1)
|
p03037 | s951285495 | Wrong Answer | n,m=map(int,input().split())
l=1;ma=n
te=set(range(1,n+1))
for i in range(m):
x,y=map(int,input().split())
l=max(x,l)
ma=min(ma,y)
print(min(abs(l-ma)+1,m)) |
p03037 | s680720525 | Wrong Answer | n, m = map(int, input().split())
s = [0] * (n+1)
for i in range(m):
l, r = map(int, input().split())
s[l-1] += 1
s[r] -= 1
ans = [0] * (n+2)
for i in range(n+1):
ans[i+1] = ans[i] + s[i]
print(ans.count(max(ans))) |
p03037 | s694632521 | Wrong Answer | # coding: utf-8
import sys
import itertools
def sr(): return sys.stdin.readline().rstrip()
def ir(): return int(sr())
def lr(): return list(map(int, sr().split()))
N, M = lr()
l_list = []
r_list = []
for i in range(M):
l, r = lr()
l_list.append(l)
r_list.append(r)
for i in range(M):
if i == 0:
... |
p03037 | s991250576 | Wrong Answer | """
i番目のゲートは LiからRiまでのIDカードのうちどれか1枚を持っていれば通過できます
"""
N, M = map(int, input().split())
left = 0
right =N
for i in range(M):
L, R = map(int, input().split())
if left<L:
left = L
if right > R:
right = R
print(right-left+1)
|
p03037 | s594168390 | Wrong Answer | n,m=map(int,input().split())
lh=0
rh=10**9
for i in range(m):
l,r=map(int,input().split())
if lh<=l:
lh=l
if rh>=r:
rh=r
print(rh,lh)
if rh-lh<0:
print(0)
else:
print(rh-lh+1) |
p03037 | s476359577 | Wrong Answer | n,m=map(int,input().split())
a=[]
b=[]
for i in range(m):
f,g=map(int,input().split())
a.append(f)
b.append(g)
print(min(b)-max(a)+1) |
p03037 | s326333265 | Wrong Answer | N, M = map(int, input().split())
L, R = [], []
for i in range(M):
tmp = list(map(int, input().split()))
L.append(tmp[0])
R.append(tmp[1])
lower = max(L)
upper = min(R)
print(abs(upper-lower)+1)
|
p03037 | s850304649 | Wrong Answer | N, M = map(int, input().split())
LR = [(map(int, input().split())) for i in range(M)]
L = 1
R = N
for i in range(M):
a, b = LR[i]
L = max(L,a)
R = min(R,b)
print(R-L+1) |
p03037 | s978143764 | Wrong Answer | N, M = map(int, input().split())
min_ID = 0
max_ID = N
for _ in range(M):
L, R = map(int, input().split())
if min_ID < L:
min_ID = L
if max_ID > R:
max_ID = R
print(max_ID - min_ID + 1)
|
p03037 | s157517723 | Wrong Answer | n,m=map(int,input().split())
L=[]
R=[]
for i in range(m):
l,r=map(int,input().split())
L.append(l)
R.append(r)
print(min(R)-max(L)+1) |
p03037 | s947235206 | Wrong Answer | N,M = map(int,input().split())
L = []
R = []
count = 0
for j in range(M):
l,r = map(int,input().split())
L.append(l)
R.append(r)
for i in range(N+1):
if i > max(L) and i < min(R):
count += 1
print(count) |
p03037 | s313518099 | Wrong Answer | # coding: utf-8
# Your code here!
N,M = map(int,input().split())
Li,Ri = map(int,input().split())
for i in range(2,M+1):
L,R = map(int,input().split())
if (Li<=L and L<=Ri):
Li = L
Ri = min(Ri,R)
elif (R>=Li and R<=Ri):
Li = max(L,Li)
Ri = R
else:
Li=1
... |
p03037 | s361065403 | Wrong Answer | n, m = map(int,input().split())
l = []
r = []
for i in range(m):
a, b = map(int,input().split())
l.append(a)
r.append(b)
a = 1
b = n
for i in range(m):
a = max(l[i], a)
b = min(r[i], b)
print(b - a + 1) |
p03037 | s992813123 | Wrong Answer | n,m=map(int,input().split())
l=1;ma=n
te=set(range(1,n+1))
for i in range(m):
x,y=map(int,input().split())
l=max(x,l)
ma=min(ma,y)
print(abs(l-ma)+1) |
p03037 | s008017036 | Wrong Answer | n,m = list(map(int, input().split()))
high=10**10
low=0
for i in range(m):
a,b = list(map(int, input().split()))
if a>low:
low=a
if b<high:
kigk=b
print(high-low+1) |
p03037 | s630807991 | Wrong Answer | N, M = map(int, input().split())
maxL = 1
minR = 1
for i in range(M):
L, R = map(int, input().split())
maxL = max(maxL, L)
minR = min(minR, R)
print(max(minR - maxL +1, 0))
|
p03037 | s146660559 | Wrong Answer | n,m = map(int, input().split())
a = [0,n]
for i in range(m):
s,t = map(int, input().split())
a[0] = max(a[0], s)
a[1] = min(a[1], t)
print(a[1] - a[0] + 1) |
p03037 | s053424483 | Wrong Answer | n, m = list(map(int, input().split()))
list = [list(map(int, input().split())) for x in range(m)]
ans = [1]*n
s = 0
m = n
for i in list:
if i[0] > s:
s = i[0]
if i[1] < m:
m = i[1]
print(m-s+1) |
p03037 | s731388256 | Wrong Answer | n,m=map(int,input().split())
hidari=-10**100
migi=10**100
for i in range(m):
l,r=map(int,input().split())
if l>migi or r<hidari:
keep=0
break
elif hidari<=l<=r<=migi:
hidari=l
migi=r
elif l<=hidari<=migi<=r:
pass
elif l<=hidari<=r<=migi:
migi=r
elif hidari<=l<=migi<=r:
hidari=l
... |
p03037 | s769830592 | Wrong Answer | # coding: utf-8
# Your code here!
N,M = map(int,input().split())
Li,Ri = map(int,input().split())
for i in range(2,M+1):
L,R = map(int,input().split())
if (L<=Ri and R>=Ri):
Li = L
elif (R>=Li and Li>=L):
Ri = R
else:
Li=1
Ri=0
break
print(Ri-Li+1) |
p03037 | s259856727 | Wrong Answer | N, M = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(M)]
lList = [arr[0] for arr in LR]
rList = [arr[1] for arr in LR]
l = max(lList)
r = min(rList)
print(r-l+1) |
p03037 | s115194277 | Wrong Answer | n,m = map(int,input().split())
a = 1
b = n
for i in range(m):
l,r = map(int,input().split())
a = max(a,l)
b = min(b,r)
print(b-a+1) |
p03037 | s709426390 | Wrong Answer | n,m=map(int,input().split())
L=[]
M=[]
for i in range(m):
l,m=map(int,input().split())
L.append(l)
M.append(m)
a=max(L)
b=min(M)
print(b-a+1) |
p03037 | s692726021 | Wrong Answer | N,M = map(int, input().split())
L,R = map(int, input().split())
for _ in range(M-1):
l,r = map(int, input().split())
if R>r:
R = r
if L<l:
L = l
print(R-L+1) |
p03037 | s068710956 | Wrong Answer | n, m = map(int, input().split())
l_lst = []
r_lst = []
for i in range(m):
l, r = map(int, input().split())
l_lst.append(l)
r_lst.append(r)
print(min(r_lst) - max(l_lst) + 1) |
p03037 | s800606511 | Wrong Answer | N,M= map(int, input().split())
L,R= map(int, input().split())
flag = True
for i in range(M-1):
a,b= map(int, input().split())
if a >= L and b <= R:
L = a
R = b
elif L <= b and R >= b:
R = b
elif L <= a and R >= a:
L = a
else:
flag = False
break
if flag... |
p03037 | s717959496 | Wrong Answer | def main():
x = list(map(int, input().split()))
n = x[0]
m = x[1]
common_section = [1, n+1]
for i in range(m):
a = list(map(int, input().split()))
if a[0] > common_section[0]:
common_section[0] = a[0]
if a[1] < common_section[1]:
common_section[1] = ... |
p03037 | s489642863 | Wrong Answer | N, M = map(int, input().split())
card = False
for _ in range(M):
L, R = map(int, input().split())
if card is True:
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)) |
p03037 | s222828804 | Wrong Answer | n,a = map(int,input().split())
m = [tuple(map(int,input().split())) for _ in range(a)]
l,r=m[0][0],m[0][1]
for i in range(1,a):
l = max(m[i][0],l)
r = min(m[i][1],r)
print(r-l+1)
|
p03037 | s311184609 | Wrong Answer | N,M = map(int,input().split())
List = [0 for i in range(N)]
for m in range(M):
L,R = map(int,input().split())
List[L-1:R] = [1 for i in range(R-L+1)]
List[:L-1] = [0 for i in range(L-1)]
List[R:] = [0 for i in range(N-R)]
print(List)
print(List.count(1)) |
p03037 | s044053855 | Wrong Answer | n, m = map(int, input().split())
left, right = 1, n
for _ in range(m):
l, r = map(int, input().split())
if l > left:
left = l
if r < right:
right = r
if l >= r:
print(0)
quit()
print(right - left + 1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.