# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
372476 | hivakarami | Strange Device (APIO19_strange_device) | C++14 | 551 ms | 53700 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>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
const int N = 1e6 + 100;
const ll mod = 1e9 + 7;
const ll inf = 1e18 + 10;
vector<pair<ll, ll>> v;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
ll a, b;
cin >> n >> a >> b;
ll k = a / __gcd(a, b+1);
if(k > inf/b)
k = inf;
else
k *= b;
//cout << k << endl;
while(n--)
{
ll l, r;
cin >> l >> r;
if(r - l + 1 >= k)
{
cout << k << endl;
return 0;
}
l = l%k;
r = r%k;
if(l <= r)
{
v.push_back({l, r});
}
else
{
v.push_back({l, k-1});
v.push_back({0, r});
}
}
sort(v.begin(), v.end());
ll ans = 0, mx = -1;
for(int i = 0; i < v.size(); i++)
{
ll l = v[i].f, r = v[i].s;
//cout << l << ' ' << r << endl;
if(l > mx)
ans += r - l + 1;
else if(r >= mx)
ans += r - mx;
mx = max(mx, r);
}
cout << ans << endl;
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... |