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;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
constexpr bool typetest = 0;
constexpr int N = 1e6 + 5;
constexpr ll Inf = 1e18 + 7;
int n;
ll A, B;
vector<pair<ll, ll>> s;
void Read()
{
cin >> n >> A >> B;
// A * B / gcd(A, B + 1)
A /= __gcd(A, B + 1);
if (A <= Inf / B)
A *= B;
else
A = Inf;
for (int i = 1; i <= n; ++i)
{
ll l, r;
cin >> l >> r;
if (r - l + 1 >= A)
tie(l, r) = make_tuple(0, A - 1);
else
{
l %= A;
r %= A;
}
if (l <= r)
s.emplace_back(l, r);
else
{
s.emplace_back(l, A - 1);
s.emplace_back(0, r);
}
}
}
void Solve()
{
sort(s.begin(), s.end());
ll leftest(0);
ll ans(0);
for (auto i : s)
{
leftest = max(leftest, i.first);
ans += max(0ll, i.second - leftest + 1);
leftest = max(leftest, i.second + 1);
}
cout << ans;
}
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t(1);
if (typetest)
cin >> t;
for (int _ = 1; _ <= t; ++_)
{
Read();
Solve();
}
}
# | 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... |