# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128537 | ae04071 | Strange Device (APIO19_strange_device) | C++11 | 923 ms | 34684 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;
using lli = long long;
const lli INF = 2e18;
lli mul(lli a,lli b) {
if(a>=INF || b>=INF || INF/a<b) return INF;
else return min(INF, a*b);
}
int main() {
int n;
lli A,B;
scanf("%d%lld%lld",&n,&A,&B);
lli g = __gcd(A-1,B), s = abs(B-A+1) / g;
lli kg = __gcd(s, A), k = A / kg;
//lli I = mul(k, B/g);
lli I = mul(mul(k, B/g), g);
vector<pair<lli,int>> arr;
for(int i=0;i<n;i++) {
lli l,r;
scanf("%lld%lld",&l,&r);
if(r-l+1>=I) {
arr.push_back({0,1});
arr.push_back({I,-1});
} else {
l%=I; r%=I;
if(l<=r) {
arr.push_back({l,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... |