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;
int main(){
// Subtask 1
ll n,a,b; cin >> n >> a >> b;
vector<pair<ll,ll>> v(n);
for(int i=0;i<n;i++) cin >> v[i].first >> v[i].second;
set<pair<ll,ll>> s;
for(int i=0;i<n;i++){
for(ll t=v[i].first;t<=v[i].second;t++){
s.insert({(t+t/b)%a,t%b});
}
}
cout << s.size() << endl;
}
# | 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... |