# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
540602 | krit3379 | Strange Device (APIO19_strange_device) | C++17 | 467 ms | 17684 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define N 1000005
long long a,b,g,rb,l,r,ll,rr,flag,ans;
vector<pair<long long,long long>> p;
int main(){
int n,i;
scanf("%d %lld %lld",&n,&a,&b);
g=__gcd(a,b+1);
r=a/g;
if(1e18/r>=b)rb=r*b;
else rb=1e18+5;
for(i=1;i<=n;i++){
scanf("%lld %lld",&l,&r);
if(r-l+1>=rb)flag=true;
l%=rb;
r%=rb;
if(l<=r)p.push_back({l,r});
else p.push_back({l,rb-1}),p.push_back({0,r});
}
if(flag){printf("%lld",rb);return 0;}
sort(p.begin(),p.end());
ll=-1;
rr=-2;
for(auto [l,r]:p){
if(l<=rr)rr=r;
else{
ans+=rr-ll+1;
ll=l,rr=r;
}
}
ans+=rr-ll+1;
printf("%lld",ans);
return 0;
}
Compilation message (stderr)
# | 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... |