#include <bits/stdc++.h>
using namespace std;
long long n,a,b;
map<pair<long long,long long>,long long> mp;
void help()
{
for(long long t=0;t<=110;t++)
{
long long x=(t+t/b)%a,y=t%b;
if(mp[{x,y}])
{
cout<<t<<" "<<x<<" "<<y<<" "<<mp[{x,y}]<<endl;
}
mp[{x,y}]=t+1;
}
}
pair<long long,long long> p[600001];
void solve()
{
int cnt=n;
for(long long i=1;i<=n;i++)
{
long long l,r;
cin>>l>>r;
p[i]={l%(a*b),r%(a*b)};
if(p[i].first>p[i].second)
{
cnt++;
p[cnt].first=0;
p[cnt].second=p[i].second;
p[i].second=a*b-1;
}
}
long long ans=0;
sort(p+1,p+cnt+1);
long long r=-1;
for(long long i=1;i<=cnt;i++)
{
if(p[i].second>r)
{
if(p[i].first>r)
ans+=p[i].second-p[i].first+1;
else ans+=p[i].second-r;
}
r=max(r,p[i].second);
}
cout<<ans<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>a>>b;
//help();
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
3 ms |
568 KB |
Output is correct |
3 |
Correct |
3 ms |
604 KB |
Output is correct |
4 |
Incorrect |
0 ms |
460 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Runtime error |
116 ms |
34644 KB |
Execution killed with signal 8 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Runtime error |
150 ms |
30588 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Runtime error |
150 ms |
30588 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Runtime error |
150 ms |
30588 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
31 ms |
2652 KB |
Output is correct |
3 |
Correct |
31 ms |
2652 KB |
Output is correct |
4 |
Runtime error |
147 ms |
30548 KB |
Execution killed with signal 11 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
3 ms |
568 KB |
Output is correct |
3 |
Correct |
3 ms |
604 KB |
Output is correct |
4 |
Incorrect |
0 ms |
460 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |