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 int long long
signed main(){
int n, A, B;
cin >> n >> A >> B;
vector<array<int, 2>> a(n);
int sum = 0;
for(int i = 0; i < n; i ++)
cin >> a[i][0] >> a[i][1], sum += a[i][1] - a[i][0] + 1;
if(sum <= 1e6){
set<array<int, 2>> s;
for(int i = 0; i < n; i ++)
for(int j = a[i][0]; j <= a[i][1]; j ++)
s.insert({(j + (j / B)) % A, j % B});
cout << s.size();
}
}
# | 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... |