이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*input
2 16 13
2 5
18 18
*/
#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
const int64_t INF = 2e18;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int N;
int64_t A, B;
cin >> N >> A >> B;
int64_t M = A / __gcd(A, B + 1);
M = (INF / M < B ? INF : B * M);
map<int64_t, int> vals;
while (N--) {
int64_t L, R;
cin >> L >> R;
++R;
if (R - L >= M) return cout << M << endl, 0;
L %= M, R %= M;
if (L < R) ++vals[L], --vals[R];
else ++vals[0], --vals[R], ++vals[L], --vals[M];
}
int64_t last = 0, cnt = 0;
int cur = 0;
for (auto p : vals) {
cnt += (cur > 0) * (p.first - last);
last = p.first;
cur += p.second;
}
cout << cnt << 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... |