이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int maxn = 1e6 + 10;
int n;
ll l[maxn], r[maxn];
ll A, B;
void solve()
{
cin >> n >> A >> B;
for (int i = 1; i <= n; i ++)
{
cin >> l[i] >> r[i];
}
if (n == 1)
{
ll ans = (r[1] - l[1] + 1);
if (ans / B > A)
ans = min(ans, A * B);
cout << ans << endl;
return;
}
if ((ll)(2e18) / B < A)
{
ll ans = 0;
for (int i = 1; i <= n; i ++)
ans = ans + (r[i] - l[i] + 1);
cout << ans << endl;
return;
}
unordered_set < ll > st;
for (int i = 1; i <= n; i ++)
{
for (ll j = l[i]; j <= r[i]; j ++)
{
st.insert(j % (A * B));
}
}
cout << st.size() << endl;
}
int main()
{
solve();
return 0;
}
/**
7 3
4 1 3 4 0 2 3
*/
# | 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... |