oj.uz

Submission #985032

# Submission time Handle Problem Language Result Execution time Memory
985032 2024-05-17T09:49:12 Z SyedSohaib_123 Strange Device (APIO19_strange_device) PyPy 3
0 / 100
 47 ms 18332 KB 
from math import gcd
def solve():
    n,a,b=map(int,input().split())
    ls=[]
    for i in range(n):
        x,y=map(int,input().split())
        ls.append([x,y])
    a/=gcd(a,b+1)
    a*=b
    for i in ls:
        if i[1]-i[0]+1>=a:
            print(a)
            return
    q=[]
    for i in ls:
        f=i[0]%a
        s=i[1]%a
        if(f<s or i[0]==i[1]):
            q.append([f,s])
        else:
            q.append([f,a-1])
            q.append([0,s])
    q.sort()
    ans=a-q[0][0]
    maxi=q[0][1]
    for i in range(1,len(q)):
        if q[i-1][1]<q[i][0]:
            ans-=q[i][0]-q[i-1][1]-1
        maxi=max(maxi,q[i][1])
    print(int(ans-a+maxi+1))
solve()

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 18332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 18184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 18228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 18228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 18228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 18228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 18236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 18332 KB Output isn't correct
2 Halted 0 ms 0 KB -