problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03037 | s570651087 | Wrong Answer | N,M = map(int,input().split())
LR = [list(map(int,input().split())) for i in range(M)]
maxi = 0
mini = 10**6
for lr in LR:
maxi = max(lr[0],maxi)
mini = min(lr[1],mini)
if mini-maxi+1 >= N:
print(N)
else:
print(mini-maxi+1) |
p03037 | s612665260 | Wrong Answer | n, m = map(int, input().split())
l_r = [ list(map(int, input().split())) for _ in range(m) ]
ans = 0
l_ans = 0
r_ans = float('inf')
for l, r in l_r:
l_ans = max(l_ans, l)
r_ans = min(r_ans, r)
print(r_ans-l_ans+1) |
p03037 | s141347849 | Wrong Answer | n,m = map(int, raw_input().split(' '))
def intersection(A,B):
a,b = max(A[0],B[0]), min(A[1],B[1])
return [a,b] if a <= b else []
r = [1,n]
for _ in range(m):
a,b = map(int, raw_input().split(' '))
keys = intersection(r, [a,b])
if len(keys) == 0: break
print (keys[1] - keys[0] + 1) if keys else 0
|
p03037 | s946928795 | Wrong Answer | N,M = map(int, input().split())
L = []
R = []
for _ in range(M):
l,r = map(int, input().split())
L.append(l)
R.append(r)
if min(R) <= max(L):
print(min(R)-max(L)+1)
else:
print(0) |
p03037 | s083466250 | Wrong Answer | n,m = map(int,input().split())
ls = [i for i in range(m)]
rs = [i for i in range(m)]
cnt = 0
for _ in range(m):
ls[_],rs[_] = map(int,input().split())
maxl = max(ls)
minr = min(rs)
for nn in range(1,n+1):
if maxl <= nn or minr >= nn:
cnt += 1
print(cnt) |
p03037 | s325571005 | Wrong Answer | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: map(str, sys.stdin.buffer.readline().split())
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(... |
p03037 | s064548965 | Wrong Answer | n, m = map(int, input().split())
lr = [[int(i) for i in input().split()] for _ in range(m)]
mi, ma = 0, n
for l, r in lr:
mi, ma = max(mi, l), min(ma, r)
print(ma - mi + 1)
|
p03037 | s111771954 | Wrong Answer | #C
n, m = map(int, input().split())
l = []
r = []
for _ in range(m):
tmp=list(map(int,input().split()))
l.append(tmp[0])
r.append(tmp[1])
lmax = max(l)
rmin = min(r)
print(rmin - lmax + 1)
|
p03037 | s075445875 | Wrong Answer | N,M = map(int,input().split())
A = []
B = []
for _ in range(M):
L,R = map(int,input().split())
A.append(L)
B.append(R)
print(min(B)-max(A)+1) |
p03037 | s898226848 | Wrong Answer | import itertools
n,m = map(int,input().split())
card = [list(map(int,input().split())) for c in range(m)]
ans = 0
tmp = []
if m == 1:
print(max(card[0]))
else:
for c in card:
c = [i for i in range(c[0],c[-1]+1)]
tmp.append(c)
tmp = list(itertools.chain.from_iterable(tmp))
tmp = [x for x in ... |
p03037 | s255607341 | Wrong Answer | n, m = map(int, input().split())
cnt = 0
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)
print(r_min - l_max + 1)
|
p03037 | s442615830 | Wrong Answer | def i():
return int(input())
def i2():
return map(int,input().split())
def s():
return str(input())
def l():
return list(input())
def intl():
return list(int(k) for k in input().split())
n,m = i2()
l = []
r = []
for i in range(m):
L,R = i2()
l.append(L)
r.append(R)
print(min(r) - max(l) + 1)
|
p03037 | s758891841 | Wrong Answer | N,M=map(int,input().split())
interval=[[0,0] for i in range(M)]
for i in range(M):
interval[i][0],interval[i][1]=map(int,input().split())
L=[interval[i][0] for i in range(M)]
R=[interval[i][1] for i in range(M)]
L_max=max(L)
R_min=min(R)
print(R_min-L_max+1) |
p03037 | s159799380 | 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())
if max(l)<=min(r):
print(0)
else:
print(min(r)-max(l)+1) |
p03037 | s471154582 | Wrong Answer | N,M = map(int,input().split())
L = 1
R = N
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) |
p03037 | s757792904 | Wrong Answer | N, M = map(int, input().split())
for i in range(M):
L, R = map(int, input().split())
if i == 0:
top = R
bottom = L
top = min(top, R)
bottom = max(bottom, L)
print(top-bottom+1) |
p03037 | s266185512 | Wrong Answer | N, M = map(int, input().split())
L = list(list(map(int,input().split())) for i in range(M))
l = 0
r = N
for i in range(M):
l = max(l,L[i][0])
r = min(r,L[i][1])
print(l-r+1) |
p03037 | s604718088 | 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)
ans=min(R)-max(L)+1
print(ans) |
p03037 | s020860949 | 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())
if max(l)<min(r):
print(0)
else:
print(min(r)-max(l)+1) |
p03037 | s227408983 | Wrong Answer | #ABC127_C
N,M=map(int,input().split())
L=[]
R=[]
for i in range(M):
l,m=map(int,input().split())
L.append(l)
R.append(m)
if min(R)<=max(L):
print(0)
else:
print(min(R)-max(L)+1) |
p03037 | s856366307 | Wrong Answer | N,M=map(int, input().split())
list_lr=[list(map(int, input().split())) for _ in range(M)]
a=list_lr[0][1]-list_lr[-1][0]+1
print(a if a<=N else N) |
p03037 | s573077299 | Wrong Answer | n,m = map(int,input().split())
l,r = 1,n
for i in range(m):
l_tmp,r_tmp = map(int,input().split())
if l_tmp > l:
l = l_tmp
if r_tmp < r:
r = r_tmp
print(r-l+1) |
p03037 | s012210590 | Wrong Answer | # -*- coding: utf-8 -*-
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)
Lmax = max(L)
Rmax = min(R)
print(Rmax-Lmax+1) |
p03037 | s135208192 | Wrong Answer | N,M=map(int,input().split())
s=[list(map(int,input().split())) for i in range(M)]
t=[i+1 for i in range(N)]
for j in range(M):
for k in range(len(t)):
if s[j][0]>t[k]:
t[k]=0
if s[j][1]<t[k]:
t[k]=0
t=set(t)
print(len(t)-1) |
p03037 | s006357928 | Wrong Answer | n,m = map(int,input().split())
lmax, rmin = 0, n
for _ in range(m):
l,r = map(int,input().split())
lmax = max(lmax, l)
rmin = min(rmin, r)
print((rmin-lmax)+1) |
p03037 | s704290896 | Wrong Answer | #import numpy as np
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with
#A = int(input())
N,M= map(int,input().split())
#A = list(map(int,input().split()))
#B = list(map(int,input().split()))
#S= str(input())
left=1
right=10**6
for m in range(M):
l,r = map(... |
p03037 | s807885844 | Wrong Answer | N, M = map(int, input().split())
L_list = []
for i in range(M):
A = list(map(int, input().split()))
L_list.append(A)
min_range = L_list[0][0]
max_range = L_list[0][1]
for i in range(i, M):
if L_list[i][0] >= min_range:
min_range = L_list[i][0]
if L_list[i][1] <= max_range:
max_range = L_... |
p03037 | s035350703 | Wrong Answer | # -*- coding: utf-8 -*-
def main():
N,M = map(int,input().split())
L = []
R = []
for _ in range(M):
l,r = map(int,input().split())
L.append(l)
R.append(r)
L.sort(reverse=True)
R.sort()
lmax = L[0]
rmin = R[0]
print(max(0,rmin-lmax)+1)
if __name__ == '__main... |
p03037 | s111166171 | Wrong Answer | n, m = map(int, input().split())
lr = []
for i in range(m):
lr.append(list(map(int, input().split())))
lmax = 0
mmin = 10**5
for i in range(m):
lmax = max(lmax, lr[i][0])
mmin = min(mmin, lr[i][1])
print(mmin - lmax + 1) |
p03037 | s366965248 | Wrong Answer | n,m=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(m)]
b=min(ab[i][1] for i in range(m))
a=max(ab[i][0] for i in range(m))
print(b-a+1) |
p03037 | s595746949 | Wrong Answer | n,m = map(int, input().split())
l,r = 0,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 | s707211988 | 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))
if (n < min(r)):
s = 0
else:
s += 1
print(s) |
p03037 | s426443769 | Wrong Answer | n, m = (int(x) for x in input().split())
l, r = (int(x) for x in input().split())
sss = set(range(l, r + 1))
for i in range(m-1):
l, r = (int(x) for x in input().split())
sss &= set(range(l, r))
print(len(sss)) |
p03037 | s090143949 | Wrong Answer | n,m = map(int,input().split())
i_now = []
r_now = []
for k in range(m):
i,r = map(int,input().split())
i_now.append(i)
r_now.append(r)
i_max = max(i_now)
r_min = min(r_now)
ans = r_min - i_max + 1
print(ans) |
p03037 | s426124863 | Wrong Answer | N,M=map(int, input().split())
a=[[int(j) for j in input().split()] for i in range(M)]
ans = a[0][1]-a[-1][0]+1
print(ans) |
p03037 | s368494862 | Wrong Answer | N, M = map(int, input().split())
id_range = range(N + 1)
for m in range(M):
L, R = map(int, input().split())
if (L not in id_range) and (R not in id_range):
id_range = range(0)
break
if L in id_range:
id_range = range(L, id_range[len(id_range) - 1] + 1, 1)
if R in id_range:
id_range = range(id... |
p03037 | s811312742 | Wrong Answer | n,m = map(int,input().split())
mn = 1
mx = n
for i in range(m):
l,r = map(int,input().split())
if l > mn:
mn = l
if r < mx:
mx = r
if mx > mn:
print(0)
else:
print(mn - mx + 1)
|
p03037 | s445813794 | Wrong Answer | N, M = map(int, input().split())
L = list(list(map(int,input().split())) for i in range(M))
l = 0
r = N
for i in range(M):
l = max(l,L[i][0])
r = min(r,L[i][1])
print(r-l+1) |
p03037 | s175904056 | Wrong Answer | #前のやつだとTLEする
#こんなことしなくても最小と最大を更新していけばおｋ
n,m=map(int,input().split())
l,r=map(int,input().split())
l_max,r_min=l,r
for i in range(m-1):
l,r=map(int,input().split())
if l_max<l: l_max=l
if r_min>r: r_min=r
print(r_min-l_max+1) |
p03037 | s100267028 | Wrong Answer | N, M = map(int, input().split(' '))
_min = 1
_max = N
for _ in range(M):
l, r = map(int, input().split(' '))
_min = max(_min, l)
_max = min(_max, r)
print(_max - _min + 1)
|
p03037 | s268606473 | Wrong Answer | def mi():
return 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()
l = max(l,a)
r = min(r,b)
print(r-l+1) |
p03037 | s475234201 | Wrong Answer | n,k = map(int,input().split())
rc = [list(map(int,input().split())) for i in range(k)]
tmp = set(range(1,n+1))
for i in rc:
tmp = tmp & set(range(i[0],i[1]))
print(len(tmp))
|
p03037 | s257345335 | Wrong Answer | n, m = map(int, input().split())
mini, maxi = 0, 10**5+1
for _ in range(m):
l, r = map(int, input().split())
if l>mini:
mini = l
if r<maxi:
maxi = r
print(maxi - mini + 1) |
p03037 | s496780988 | Wrong Answer | n,m = map(int,input().split())
left = 0
right = n
for i in range(m):
l,r = map(int,input().split())
left = max(left,l)
right = min(right,r)
print(right-left+1) |
p03037 | s020933814 | 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())
s=0
for j in range(L[0],R[0]+1):
if all(L[k]<=j<=R[k] for k in range(j,M)):
s+=1
print(s)
|
p03037 | s744600483 | Wrong Answer | import sys
N, M = map(int, sys.stdin.readline().split())
LR = sorted([list(map(int,sys.stdin.readline().split())) for i in range(M)])
if LR[0][1] - LR[M-1][0] >= 0:
print(LR[0][1] - LR[M-1][0] + 1)
else:
print(0) |
p03037 | s931561237 | Wrong Answer | n, m = map(int, input().split())
l_max = 1
r_min = 10 ** 5
for i in range(m):
l, r = map(int, input().split())
l_max = max(l, l_max)
r_min = min(r, r_min)
print(r_min - l_max + 1)
|
p03037 | s436748979 | Wrong Answer | n,m = map(int, input().split())
mini = 0
maxi = 10**9
for i in range(m):
l,r = map(int, input().split())
if mini < l:
mini = l
if r < maxi:
maxi = r
print(maxi-mini+1) |
p03037 | s148059127 | Wrong Answer | #!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
n, m = map(int, input().strip().split())
ls, rs = [], []
for _ in range(m):
l, r = map(int, input().strip().split())
ls.append(l)
rs.append(r)
l = max(ls)
r = min(rs)
print(r - l + 1)
if __name__=='__main__':
main()
|
p03037 | s339379075 | Wrong Answer | n,m = map(int,input().split())
l_max=0
r_min=n
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 | s695751627 | Wrong Answer | n,m = map(int, input().split())
minn, maxn = 1, n
for i in range(m):
l, r = map(int,input().split())
minn, maxn = max(minn, l), min(maxn, r)
print(maxn-minn+1) |
p03037 | s496709374 | Wrong Answer | N, M = list(map(int, input().split()))
min_num = 1
max_num = N
for i in range(M):
min_input, max_input = list(map(int, input().split()))
if min_input > min_num:
min_num = min_input
if max_input < max_num:
max_num = max_input
print(max_num- min_num + 1) |
p03037 | s562942691 | 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) |
p03037 | s308802445 | Wrong Answer | L,M=map(int,input().split())
a=[0]*L
x=[]
y=[]
for i in range(M):
b,c=map(int,input().split())
x.append(b)
y.append(c)
print(-max(x)+min(y)+1) |
p03037 | s675296374 | Wrong Answer | n,m = map(int,input().split())
l_max=0
r_min=10**5
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 | s581995419 | Wrong Answer | n, m = map(int, input().split())
l, r = 0, n
for _ in range(m):
li, ri = map(int, input().split())
l = max(l, li)
r = min(r, ri)
print(r - l + 1)
|
p03037 | s114576169 | Wrong Answer | n,m=map(int,input().split())
LR=[list(map(int,input().split())) for _ in range(m)]
l,r=LR[0]
ans=r-l+1
for i in range(1,m):
if l < LR[i][0]:
l=LR[i][0]
if r > LR[i][1]:
r=LR[i][1]
ans=r-l+1
print(ans)
|
p03037 | s142045722 | Wrong Answer | N,T = map(int,input().split())
X = [list(map(int,input().split())) for n in range(T)]
M = N
m = 0
for a,b in X:
M = min(M,b)
m = max(m,a)
print(M-m+1) |
p03037 | s798114364 | Wrong Answer | N,M=map(int,input().split())
l=[list(map(int,input().split()))for i in range(M)]
min=0
max=1000000
for i in l:
if i[0]>=min:
min=i[0]
if i[1]<=max:
max=i[1]
print(max-min+1) |
p03037 | s943703612 | Wrong Answer | import numpy as np
N, M = [int(i) for i in input().split()]
LR = np.ones([M,2])
for i in range(M):
LR[i][0],LR[i][1] = [int(i) for i in input().split()]
max_L = max(LR[:,0])
min_R = min(LR[:,1])
if max_L < min_R:
ans = int(min_R - max_L)
else:
ans =0
print(ans)
|
p03037 | s990529073 | Wrong Answer | N,M=map(int,input().split())
LR=[]
for i in range(M):
LR.append(list(map(int,input().split())))
l,r=LR[0][0],LR[0][1]
for i in range(M):
if LR[i][0]<l and LR[i][1]<r:
r=LR[i][1]
elif l<LR[i][0] and LR[i][1]<r:
l,r=LR[i][0],LR[i][1]
elif l<LR[i][0] and r<LR[i][1]:
l=LR[i][0]
print(r-l+1) |
p03037 | s751593265 | Wrong Answer | n, m = map(int, input().split())
left = 1
right = n
for i in range(m):
l, r = map(int, input().split())
left = max(left, l)
right = min(right, r)
print(right-left+1) |
p03037 | s801006319 | Wrong Answer | N, M = map(int, input().split())
L = 1
R = N
for i in range(M):
l, r = map(int, input().split())
if L < l:
L = l
if R > r:
R = r
print(1+R-L) |
p03037 | s222089691 | Wrong Answer | n, m = map(int, input().split())
a = []
flag = True
for i in range(m):
l, r = map(int, input().split())
if i == 0:
l1 = l
r1 = r
else:
if l1 < l:
l1 = l
elif r1 > r:
r1 = r
if flag: print(r1-l1+1)
else: print(0) |
p03037 | s909713837 | Wrong Answer | N, M = map(int, input().split())
l = 0
r = N
for i in range(M):
L, R = map(int, input().split())
if M == 1:
print(R-L+1)
break
else:
if L > l:
l = L
if R < r:
r = R
ans = r - l + 1
else:
print(... |
p03037 | s045618078 | Wrong Answer | from itertools import accumulate
N, M = map(int, input().split())
left = 1
right = M
for i in range(M):
a,b = map(int, input().split())
left = max(left,a)
right = min(right, b)
print(max(0,right-left+1))
# imos = [0] * (N + 2)
# for i in range(M):
# l, r = map(int, input().split())
# imos[l] +=... |
p03037 | s364598568 | Wrong Answer | n,m = map(int, input().split())
fn = 1
ln = n
for i in range(m):
l,r = map(int, input().split())
fn = max(fn,l)
ln = min(ln,r)
print(ln-fn+1 if ln-fn>0 else 0) |
p03037 | s986282096 | 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)) |
p03037 | s932210918 | Wrong Answer | n, m = map(int, input().split())
l = 0
r = n
for i in range(m):
lt, rt = map(int, input().split())
l = max(l, lt)
r=min(r,rt)
print(r-l+1)
|
p03037 | s680619430 | Wrong Answer | n,m = map(int,input().split())
MIN = 0
MAX = 10**5
for i in range(m):
l,r = map(int,input().split())
MIN = MIN if MIN > l else l
MAX = MAX if MAX < r else r
if MIN > n:
print(0)
else:
MAX = MAX if MAX <= n else n
print(MAX-MIN+1) |
p03037 | s026275225 | Wrong Answer | N, M = map(int, input().split(' '))
l_val, r_val = map(int, input().split(' '))
for i in range(M-1):
l, r = map(int, input().split(' '))
l_val = max(l_val, l)
r_val = min(r_val, r)
print(r_val - l_val + 1) |
p03037 | s414222192 | Wrong Answer | n, m = map(int, input().split())
l, r = [], []
for i in range(m):
tmpa, tmpb = map(int, input().split())
l.append(tmpa)
r.append(tmpb)
print(r[0] - l[m - 1] + 1) |
p03037 | s492788493 | Wrong Answer | N, M=map(int, input().split())
a=0
b=N-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 | s104210072 | Wrong Answer | N, M = map(int, input().split())
LR = [list(map(int, input().split())) for i in range(M)]
ListL = []
ListR = []
for i in range(M):
ListL.append(LR[i][0])
for i in range(M):
ListR.append(LR[i][1])
print(min(ListR)-max(ListL)+1)
|
p03037 | s681424961 | Wrong Answer | n,m = map(int,input().split())
a = []
lmax = 0
rmin = 10**6
for i in range(m):
a.append(list(map(int,input().split())))
if a[i][0] > lmax:
lmax = a[i][0]
if a[i][1] < rmin:
rmin = a[i][1]
print(1+rmin-lmax) |
p03037 | s424192312 | Wrong Answer | n , m = map(int , input().split())
l = -10
r = 100000
for i in range(m):
j = list(map(int , input().split()))
l = max(l , j[0])
r = min(r , j[1])
print(min(r - l + 1 , n)) |
p03037 | s570797683 | Wrong Answer | N, M = map(int, input().split())
c_min = 1
c_max = 10 ** 5
for i in range(M):
LM = list(map(int, input().split()))
c_min = max(c_min, LM[0])
c_max = min(c_max, LM[1])
print(c_max - c_min + 1) |
p03037 | s331622248 | Wrong Answer | n, m = list(map(int, input().split()))
R, L = [], []
for i in range(m):
r, l = list(map(int, input().split()))
R.append(r)
L.append(l)
print( min(R) - max(L) + 1) |
p03037 | s842850066 | Wrong Answer | N,M = map(int,input().split())
L,R = map(int,input().split())
pass_card = R - L + 1
for _ in range(M-1):
L_now,R_now = map(int,input().split())
if L_now > L:
pass_card -= (L_now - L)
L = L_now
if R_now < R:
pass_card -= (R - R_now)
R = R_now
print(pass_card) |
p03037 | s787976645 | Wrong Answer | import sys
input=sys.stdin.readline
n,k=map(int,input().split())
L=[0]*(n+1)
und=0
top=10**5
for i in range(k):
a,b=map(int,input().split())
und=max(und,a)
top=min(b,top)
print(top-und+1 if top>und else 0) |
p03037 | s718242833 | Wrong Answer | N, M = [int(a) for a in input().split()]
L = []
R = []
for _ in range(M):
l, r = [int(a) for a in input().split()]
L.append(l)
R.append(r)
mingate = max(L)
maxgate = min(R)
print(maxgate - mingate + 1) |
p03037 | s876796417 | Wrong Answer | n, m = map(int, input().split())
a = []
for i in range(m):
a.append(input().split())
haba = a[0]
for i in a:
if int(haba[0]) < int(i[0]) < int(haba[1]):
haba[0] = i[0]
if int(haba[0]) < int(i[1]) < int(haba[1]):
haba[1] = i[1]
if n < int(haba[0]):
ans = 0
elif int(haba[0]) <= n <= int(ha... |
p03037 | s776630076 | Wrong Answer | n, m = map(int, input().split())
s = [0] * (n+2)
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(1, n+2):
ans[i] = ans[i-1] + s[i]
print(ans.count(max(ans))) |
p03037 | s917107101 | Wrong Answer | n, m = map(int, input().split())
max_l = 1
min_r = n
for _ in range(m):
l, r = map(int, input().split())
max_l = max(max_l, l)
min_r = min(min_r, r)
ans = min_r - max_l + 1
print(ans) |
p03037 | s572817272 | Wrong Answer | n, m = map(int, input().split())
ans_l = 0
ans_r = n
for _ in range(m):
l, r = map(int, input().split())
ans_l = max(ans_l, l)
ans_r = min(ans_r, r)
print(ans_r-ans_l+1)
|
p03037 | s347052065 | 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(rr-ll+1) |
p03037 | s648248608 | Wrong Answer | N_ID, M_gate = map(int, input().split())
mini = float('inf')
MAX = 0
for i in range(M_gate):
L, R = map(int, input().split())
MAX = max(MAX, L)
mini = min(mini, R)
answer = mini - MAX + 1
print(answer) |
p03037 | s929091710 | Wrong Answer | n, m = list(map(int, input().split()))
#b = list(map(int, input().split()))
l = []
r = []
for i in range(m):
x, y = list(map(int, input().split()))
l.append(x)
r.append(y)
L = l[0]
R = r[0]
for i in range(1, m):
if not((R < l[i] and R < r[i]) or (r[i] < L and l[i] < L)):
L = max(L, l[i])
... |
p03037 | s402372929 | Wrong Answer | N, M = map(int, input().split())
L = []
R = []
for _ in range(M):
l, r = map(int, input().split())
L.append(l)
R.append(r)
print(min(R) - max(L) + 1)
|
p03037 | s350786842 | Wrong Answer | n,m = map(int,input().split())
mn = 10**9
mx = -1
for i in range(m):
l,r = map(int,input().split())
if l > mx:
mx = l
if r < mn:
mn = r
print(abs(mx-mn)+1)
|
p03037 | s386049194 | Wrong Answer | N,M = map(int,input().split())
LR = [[int(x) for x in input().split()] for _ in range(M)]
L = 1
R = N
for l,r in LR:
L = max(L,l)
R = max(R,r)
if L > R:
print(0)
else:
print(R-L+1)
|
p03037 | s091721278 | Wrong Answer | n,m=map(int,input().split())
lmax=0
rmin=float('inf')
for i in range(m):
l,r=map(int,input().split())
lmax=max(lmax,l)
rmin=min(rmin,r)
print(rmin-lmax+1)
|
p03037 | s558253422 | Wrong Answer | import numpy as np
N,M = map(int,input().split(" "))
Min = 1
Max = N
for _ in range(M):
L,R = map(int,input().split(" "))
if L>Min:
Min=L
if R<Max:
Max=R
print(Max-Min+1) |
p03037 | s044395646 | 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())
l = max(L)
r = min(R)
print(r-l+1) |
p03037 | s403074733 | Wrong Answer | n,m = map(int,input().split())
gate = [1,n]
for i in range(m):
l,r = map(int,input().split())
gate[0] = max(gate[0],l)
gate[1] = min(gate[1],r)
print(gate[1]-gate[0]+1) |
p03037 | s232804803 | Wrong Answer | N, M = map(int, raw_input().split())
L = []
R = []
for i in range(M):
Li, Ri = map(int, raw_input().split())
L.append(Li)
R.append(Ri)
ans = min(R) - max(L) + 1
print ans
|
p03037 | s224757167 | Wrong Answer | l = input().split(" ")
n = int(l[0])
m = int(l[1])
r = []
l = []
for i in range(m):
gatei = input().split(" ")
li = int(gatei[0])
ri = int(gatei[1])
l.append(li)
r.append(ri)
l.sort()
r.sort()
count = r[0] - l[m-1] + 1
print(count) |
p03037 | s474492279 | Wrong Answer | N, M = map(int, input().split())
idcard = [[int(j) for j in input().split()] for i in range(M)]
for i in range(1,M):
idcard[i] = [idcard[i][0], idcard[i-1][1]]
print(idcard[M-1][1]-idcard[M-1][0] + 1)
|
p03037 | s580304301 | 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 and li <= r:
l = li
else:
lb = False
if r > ri and ri >= l:
r = ri
else:
rb = False
if not (lb or rb):
print(0)
... |
p03037 | s634450527 | Wrong Answer | n,m = map(int,input().split())
l = list(list(map(int,input().split())) for _ in range (m))
a = l[0][0]
b = l[0][1]
for s,t in l:
a = max(a,s)
b = min(b,t)
print(b-a+1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.