# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140578 | luciocf | Strange Device (APIO19_strange_device) | C++14 | 4724 ms | 524292 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 ll;
ll A, B;
void solve_1(void)
{
ll l, r;
scanf("%lld %lld", &l, &r);
ll x = (r-l+1)/B;
ll g = A/__gcd(B+1, A);
if (x >= g)
printf("%lld\n", B*g);
else
printf("%lld\n", r-l+1);
}
int main(void)
{
int n;
scanf("%d %lld %lld", &n, &A, &B);
if (n == 1)
{
solve_1();
return 0;
}
set<ll> st;
for (int i = 1; i <= n; i++)
{
ll l, r;
scanf("%lld %lld", &l, &r);
for (ll j = l; j <= r; j++)
st.insert(j);
}
map<pair<ll, ll>, int> mp;
int ans = 0;
for (auto t: st)
{
ll x = (t + t/B)%A;
ll y = t%B;
if (!mp[{x, y}]) ans++;
mp[{x, y}] = 1;
}
printf("%d\n", ans);
}
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... |