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;
typedef long long ll;
#define f(i,a,b) for(int i = a; i < b; i++)
const int N = 1e6 + 5;
int n;
ll l[N], r[N];
ll A, B, S;
void subtask_1(){
set <pair<ll,ll>> s;
f(i,1,n+1){
for(ll j = l[i]; j <= r[i]; j++){
ll a, b;
a = (j + j/B) % A;
b = j % B;
s.insert({a, b});
}
}
cout << s.size() << "\n";
}
void subtask_2(){
ll X = A / __gcd(A, B+1);
ll period = X * B;
cout << min(r[1] - l[1] + 1, period) << "\n";
}
int main(){
cin >> n >> A >> B;
f(i,1,n+1){
cin >> l[i] >> r[i];
S += r[i] - l[i] + 1;
}
if(S <= N){
subtask_1();
return 0;
}
if(n == 1){
subtask_2();
return 0;
}
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... |