# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660898 | littlefermat | 이상한 기계 (APIO19_strange_device) | C++14 | 1427 ms | 53408 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 L first
#define R second
using namespace std;
typedef long long ll;
vector<pair<ll,ll> > v;
int main()
{
ll e=pow(10,18)+1;
ll n,A,B,x;
cin>>n>>A>>B;
ll j=n;
A=A/__gcd(A,B+1);
ll mod=A*B;
for(long long i=0;i<n;i++){
ll l,r;
cin>>l>>r;
if(r-l >= mod)
cout<<mod<<endl,exit(0);
l %= mod; r %= mod;
if(l > r)
v.push_back(make_pair(0,r)),
v.push_back(make_pair(l,mod-1));
else
v.push_back(make_pair(l,r));
}
sort(v.begin(),v.end());
for(int i = 0 ;i <v.size()-1; i++ ){
if(v[i+1].L <= v[i].R ){
if(v[i].R < v[i+1].R ){
v[i+1].L = v[i].L , v[i].L=v[i].R+1;
}
else{
v[i+1].L=v[i].L,v[i+1].R=v[i].R,v[i].L=v[i].R+1;
}
}
}
ll m=0;
for(int i=0;i<v.size();i++)
m += v[i].second - v[i].first+1;
cout<<m<<"\n";
}
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... |