This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
n,a,b = map(int, input().split())
ranges = []
for i in range(n):
ranges.append(list(map(int, input().split())))
newranges = []
flag = False
for i in range(n):
ranges[i] = [ranges[i][0]%(a*b), ranges[i][1]%(a*b)]
if ranges[i][0]>ranges[i][1]:
newranges.append([ranges[i][0]%(a*b),a*b])
newranges.append([0,ranges[i][1]%(a*b)])
else:
newranges.append(ranges[i])
newranges.sort()
if newranges[0][0]==0 and newranges[-1][-1]==a*b:
flag = True
ans = 0
cur = a*b
while newranges:
sus = newranges.pop()
ans += min(cur,sus[1])-sus[0]+1
cur = sus[0]-1
print(ans-flag)
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |