이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
const int maxN=1e6+5;
const ll inf=2e18;
int n;
ll a,b;
pll p[maxN+1];
set<pll> se;
int main()
{
//freopen("","r",stdin);
//freopen("","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>a>>b;
for(int i=1;i<=n;i++)
{
cin>>p[i].fi>>p[i].se;
}
ll x=inf,d=__gcd(a,b+1);
if((ld)1.0*inf/b<a/d)
{
x=inf;
}
else x=b*(a/d);
for(int i=1;i<=n;i++)
{
if(p[i].se-p[i].fi+1>=x)
{
cout<<x;
return 0;
}
ll lmod=p[i].fi%x,rmod=p[i].se%x;
if(lmod>rmod)
{
se.insert({lmod,x-1});
se.insert({0,rmod});
}
else se.insert({lmod,rmod});
}
ll ans=0,mx=-1;
for(auto i:se)
{
ans+=max(0ll,i.se-max(mx+1,i.fi)+1);
mx=max(mx,i.se);
}
cout<<ans;
}
# | 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... |