# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
782446 | makanhulia | Strange Device (APIO19_strange_device) | C++17 | 437 ms | 33212 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 LL long long
using namespace std;
int main()
{
LL n,a,b;
scanf("%lld %lld %lld",&n,&a,&b);
LL t=b*(a/__gcd(b+1,a));
vector<pair<LL,LL>>v;
for(LL a=1;a<=n;a++)
{
LL l,r;
scanf("%lld %lld",&l,&r);
l%=t ,r%=t;
if(l>=r)
{
v.push_back(make_pair(l,t-1));
v.push_back(make_pair(0,r));
}
else v.push_back(make_pair(l,r));
}
sort(v.begin(),v.end());
LL kanan=0,tot=0,kiri=0;
for(pair<LL,LL>x:v)
{
if(x.second>=kanan && (x.first<=kanan ))
{
kanan=x.second;
}
else if(kanan<x.first)
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... |