이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,long long>pii;
typedef pair<int,pii>pi2;
int n,a,b;
int f(int index){
return (index+index/b)%a;
}
int f2(int index){
return index%b;
}
void solve(){
cin >> n >> a >> b;
__int128 lcm=(__int128)a*(__int128)b/__gcd(a,b+1);
map<int,int>mp;
int temp,temp2;
for(int x=0;x<n;x++){
cin >> temp >> temp2;
int blk=temp/lcm;
int blk2=temp2/lcm;
temp%=lcm;
temp2%=lcm;
if(blk==blk2){
mp[temp]++;
mp[temp2+1]--;
}
else{
mp[temp]++;
mp[lcm]--;
mp[0]++;
mp[temp2+1]--;
}
}
int counter=0;
int last=-1;
int ans=0;
for(auto it:mp){
if(last!=-1&&counter>0){
ans+=it.first-last;
}
counter+=it.second;
last=it.first;
}
cout << ans;
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
while(t--){
solve();
}
}
# | 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... |