이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define sz size()
#define pii pair <ll, ll>
const int N = 1e6 + 5;
#define ll long long
#define pb push_back
vector <pii> v;
ll n, a, b;
int main () {
// freopen ("input.txt", "r", stdin);
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> a >> b;
ll m = a / __gcd (a, b + 1) * b;
for (int i = 1; i <= n; ++i) {
ll l, r;
cin >> l >> r;
if (r - l + 1 >= m) {
v.pb ({0, m - 1});
}
else if (l % m > r % m) {
v.pb ({l, m - 1});
v.pb ({0, r});
}
else {
v.pb ({l % m, r % m});
}
}
sort (v.begin(), v.end());
ll l = 0, r = 0, jogap = 0;
for (int i = 0; i + 1 < (int)v.sz; ++i) {
if (v[i].ff <= r) r = max (r, v[i].ff);
else {
jogap += r - l + 1;
l = v[i].ff;
r = v[i].ss;
}
}
jogap += r - l + 1;
cout << jogap;
}
# | 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... |