# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
172125 | dennisstar | Strange Device (APIO19_strange_device) | C++11 | 609 ms | 36600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define ryan bear
#define all(V) ((V).begin()), ((V).end())
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef vector<int> vim;
typedef vector<ll> vlm;
vector<pll> V;
const ll INF=(1e18)+10;
int n; ll A, B;
ll l, r;
int main() {
scanf("%d %lld %lld", &n, &A, &B);
A/=__gcd(A, B+1);
if ((ll)(1e18)/B<A) A=INF;
else A*=B;
for (int i=0; i<n; i++) {
scanf("%lld %lld", &l, &r);
if (r-l+1>=A) V.push_back({0, A-1});
else {
r=(r-l)+l%A;
l%=A;
if (r>=A) {
V.push_back({l, A-1});
V.push_back({0, r-A});
}
else V.push_back({l, r});
}
}
ll mx=0, ans=0; sort(all(V));
for (pll pl:V) {
ans+=max(0ll, pl.se-max(pl.fi, mx)+1);
mx=max(pl.se+1, mx);
}
printf("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | 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... |