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;
using ll = long long;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
ll A, B;
cin >> n >> A >> B;
int L = 0;
set<pair<int, int>> s;
for (int i = 1; ; i++) {
int x = (i + i / B) % A, y = i % B;
if (s.find({x, y}) != s.end()) {
L = i - 1;
break;
}
s.insert({x, y});
}
vector<int> p(L + 1);
while (n--) {
ll l, r;
cin >> l >> r;
if (L <= r - l + 1) {
p[0]++;
continue;
}
p[l % L]++; p[r % L + 1]--;
if (l % L > r % L) p[0]++;
}
int cnt = 0;
for (int i = 0; i < L; i++) {
p[i] += p[i - 1];
cnt += !!p[i];
}
cout << cnt << '\n';
}
# | 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... |