이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define int long long
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
const int INF = 1e9+10;
const int MAXN = 1e6+10;
int n, a, b;
int F, K, P;
vector <pii> vec;
int ans;
signed main() {
	cin >> n >> a >> b;
	b++;
    F = __gcd(a, b);
    K = a/F * b;
    P = K - a/F;
    
    for(int i=1; i<=n; i++){
        int l, r; cin >> l >> r;
        if(r-l+1 >= P){
            cout << P << '\n'; exit(0);
        }
        l %= P; r %= P;
        if(l<=r){
            vec.pb({l, r});
        } else {
            vec.pb({l, P-1}); 
            vec.pb({0, r});
        }
    }
    sort(vec.begin(), vec.end());
    int las = -1, ans = 0;
    for(auto in : vec){
        if(in.se <= las) continue;
        ans += in.se - max(in.fi-1, las);
        las = in.se;
    }
    cout << ans << '\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... |