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;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n,a,b;
cin >> n >> a >> b;
long long l[n];
long long r[n];
long long rez=0;
set< pair<long long,long long> > s;
for(int i=0;i<n;i++)
{
cin >> l[i]>>r[i];
for(long long t=l[i];t<=r[i];t++)
{
long long y=t%b;
long long x=(t+t/b)%a;
if(!s.count(make_pair(x,y)))
{
s.insert(make_pair(x,y));
rez++;
}
}
}
cout << rez;
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... |