# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317791 | tjdgus4384 | Strange Device (APIO19_strange_device) | C++14 | 57 ms | 4108 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;
long long A, B, l[100001], r[100001];
vector<pair<long long, long long> > v;
int n;
int main(){
scanf("%d %lld %lld", &n, &A, &B);
for(int i = 0;i < n;i++){
scanf("%lld %lld", &l[i], &r[i]);
}
long long g = __gcd((B+1)%A, A), t;
bool chk = false;
if(log10(A/g) + log10(B) > 18.7) chk = true;
else t = (A/g) * B;
for(int i = 0;i < n;i++){
if(chk){
v.push_back({l[i], r[i]});
continue;
}
if((r[i] - l[i] + 1) >= t){
printf("%lld", t);
return 0;
}
l[i] %= t;
r[i] %= t;
if(r[i] < l[i]){
v.push_back({l[i], t-1});
v.push_back({0, r[i]});
}
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... |