# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729645 | danikoynov | 이상한 기계 (APIO19_strange_device) | C++14 | 5015 ms | 524288 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 endl '\n'
using namespace std;
typedef long long ll;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int maxn = 1e6 + 10;
int n;
ll l[maxn], r[maxn];
ll A, B;
void solve()
{
cin >> n >> A >> B;
for (int i = 1; i <= n; i ++)
{
cin >> l[i] >> r[i];
}
ll g = __gcd(A, B + 1);
/// period is A * B / g
/**if ((double)(1e18) / (double)(A) < (double)(B) / (double)(g))
{
ll ans = 0;
for (int i = 1; i <= n; i ++)
{
ans = ans + (r[i] - l[i] + 1);
}
cout << ans << endl;
return;
}*/
double period = A * B / g;
unordered_set < ll > st;
for (int i = 1; i <= n; i ++)
{
for (ll j = l[i]; j <= r[i]; j ++)
{
ll x = (j + (j / B)) % A, y = j % B;
///cout << x << " " << y << endl;
st.insert({x * B + A});
}
}
cout << st.size() << endl;
}
int main()
{
solve();
return 0;
}
/**
1 10000 3312452154131231
1 1
*/
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... |