이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
int n, a, b;
bool comp(pii a, pii b) {
return (a.fi < b.fi || (a.fi == b.fi && a.se < b.se));
}
signed main() {
ioss;
cin >> n >> a >> b;
int tmp = a*b;
if((b+1)%a == 0) tmp = b;
vector<pii> idx;
for(int i = 0; i < n; i++) {
int l, r; cin >> l >> r;
l %= tmp, r %= tmp;
if(r < l) r += tmp;
idx.pb({l, r});
}
sort(idx.begin(), idx.end(), comp);
int ans = 0;
for(int i = 0; i < n; i++) {
auto [l, r] = idx[i];
if((r-l)+1 >= tmp) {
ans = tmp;
break;
}
if(i == 0) ans += (r-l)+1;
else {
auto [x, y] = idx[i-1];
if(x <= l && y >= l) l = y+1;
else if(x <= r && y >= r) r = x-1;
else if(x <= l && y >= r) continue;
ans += (r-l)+1;
}
}
cout << ans << 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... |