# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317740 | tjdgus4384 | Strange Device (APIO19_strange_device) | C++14 | 57 ms | 3184 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 n, A, B, l[100001], r[100001], S;
vector<pair<int, int> > v;
long long gcd(long long X, long long Y){
if(X%Y == 0) return Y;
if(Y%X == 0) return X;
if(X>Y) return gcd(X%Y, Y);
if(Y>X) return gcd(Y, Y%X);
}
int main(){
scanf("%lld %lld %lld", &n, &A, &B);
for(int i = 0;i < n;i++){
scanf("%lld %lld", &l[i], &r[i]);
S += r[i] - l[i] + 1;
}
long long g = gcd(B+1, A);
long long t = (A/g) * B;
for(int i = 0;i < n;i++){
l[i] %= t;
r[i] %= t;
if(r[i] < l[i]){
v.push_back({l[i], t-1});
v.push_back({0, r[i]});
}
else v.push_back({l[i], r[i]});
}
sort(v.begin(), v.end());
long long s = v[0].first, e = v[0].second, ans = 0;
for(int i = 1;i < v.size();i++){
if(v[i].first <= e) e = v[i].second;
else{
ans += (e-s+1);
s = v[i].first;
e = v[i].second;
}
}
ans += e - s + 1;
printf("%lld", 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... |