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;
#define DIM 1000007
typedef pair<long long, long long> pll;
long long n, A, B, l[DIM], r[DIM], mx, res;
set<pll> s;
int main()
{
cin>>n>>A>>B;
if(A%2==0) A/=2;
for(int i=1; i<=n; i++)
{
cin>>l[i]>>r[i];
}
for(int i=1; i<=n; i++)
{
if(r[i]-l[i]+1>=A) res+=A;
else res+=r[i]-l[i]+1;
}
cout<<res;
return 0;
}
# | 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... |