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;
const int N = 1e6 + 6;
long long l[N] , r[N] , a , b , sum = 0;
int n;
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> a >> b;
for(int i = 0 ; i < n ; i++){
cin >> l[i] >> r[i];
sum += r[i] - l[i] + 1;
}
if(sum < N){
map<pair<long long , long long> , int> mp;
for(int i = 0 ; i < n ; i++)
for(long long j = l[i] ; j <= r[i] ; j++)
mp[{(j + j / b) % a , j % b}]++;
cout << (int)mp.size() << '\n';
return 0;
}
cout << 0 << '\n';
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... |