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;
typedef unsigned long long ull;
#define fi first
#define se second
#define pb push_back
#define TC int t; cin>>t; while(t--)
#define all(x) (x).begin(),(x).end()
//*AC BERSAMA ALLAH FORTIS FORTUNA ADIUVAT
//# nyampah
ll gcd(ll a, ll b){
if(b==0) return a;
return gcd(b,a%b);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n,a,b;
cin>>n>>a>>b;
vector<bool> freq(1000005);
set<pair<ll,ll> > sp;
vector<bool> dif(1000005,1);
for(int i=1;i<=a*b;i++){
int idx=i;
if(i==a*b) idx=0;
if(sp.count(make_pair((i+i/b)%a,i%b))){
dif[idx]=0;
}
else sp.insert(make_pair((i+i/b)%a,i%b));
}
for(int i=1;i<=n;i++){
int l,r; cin>>l>>r;
if(r-l>a*b) r=l+a*b;
for(int j=l;j<=r;j++){
freq[j%(a*b)]=1;
}
}
int cnt=0;
for(int i=0;i<1000000;i++){
if(freq[i] && dif[i]) {
cnt++;
}
}
cout<<cnt<<'\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... |