# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087028 | alexander707070 | Strange Device (APIO19_strange_device) | C++14 | 353 ms | 69088 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>
#define MAXN 1000007
using namespace std;
const long long inf=1e18+7;
int n;
pair<long long,long long> p[MAXN];
long long A,B;
vector< pair<long long,long long> > v;
long long ans,last;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>A>>B;
long long cycle=A/__gcd(A,B+1);
if(cycle>inf/B)cycle=inf;
else cycle*=B;
for(int i=1;i<=n;i++){
cin>>p[i].first>>p[i].second;
if(p[i].second-p[i].first+1>=cycle){
cout<<cycle<<"\n";
return 0;
}
p[i].first%=cycle; p[i].second%=cycle;
if(p[i].first<=p[i].second){
v.push_back({p[i].first,p[i].second});
}else{
v.push_back({0,p[i].second});
v.push_back({p[i].first,cycle-1});
}
}
sort(v.begin(),v.end());
last=-1;
for(int i=0;i<v.size();i++){
ans+=max(0LL , v[i].second-max(v[i].first-1,last));
last=max(last,v[i].second);
}
cout<<ans<<"\n";
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... |