이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define i28 __int128
int main(){
ll n, A, B;
cin>>n>>A>>B;
i28 k = A / __gcd(A, B + 1);
k = k * B;
vector<pair<ll, ll>> vec;
for (int i=1;i<=n;i++){
ll l, r;
cin>>l>>r;
if (r - l + 1 >= k){
cout<<(long long)k<<'\n';
return 0;
}
l = l % k;
r = r % k;
if (l <= r)
vec.push_back({l, r});
else{
vec.push_back({l, k - 1});
vec.push_back({0, r});
}
}
sort(begin(vec), end(vec));
ll mx = -1, ans = 0;
for (auto [i, j] : vec){
mx = max(mx, i - 1);
ans += max(0LL, j - mx);
mx = max(mx, j);
}
cout<<ans<<'\n';
}
# | 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... |