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>
#define int long long
#define pii pair<int, int>
using namespace std;
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, a, b; cin >> n >> a >> b;
priority_queue<pii, vector<pii>, greater<pii>> pq;
set<pair<int, int>> ans;
while(n--) {
int l, r; cin >> l >> r;
pq.push({l, r});
}
while(!pq.empty()) {
int i=pq.top().first, j=pq.top().second;
pq.pop();
while(i<=j) {
while(!pq.empty() && pq.top().first==i) j=max(j, pq.top().second);
ans.insert({(i+i/b)%a, i%b});
i++;
}
}
cout << ans.size() << '\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... |