# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729240 | 1075508020060209tc | Strange Device (APIO19_strange_device) | C++14 | 5092 ms | 524288 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;
#define int long long
int n;int A;int B;
int ar[1000006];int br[1000006];
map<pair<int,int>,int>vis;
signed main(){
cin>>n>>A>>B;
for(int i=1;i<=n;i++){
cin>>ar[i]>>br[i];
}
for(int t=1;t<=A*B+10;t++){
int x=(t+t/B)%A;
int y=(t%B);
if(vis[{x,y}]){
A=t-1;
break;
}
vis[{x,y}]=1;
}
vector<pair<int,int>>seg;
for(int i=1;i<=n;i++){
if(br[i]-ar[i]+1>=A){
cout<<A;return 0;
}
int l=ar[i]%A;int r=br[i]%A;
if(r<l){
seg.push_back({l,A-1});
seg.push_back({0,r});
}else{
seg.push_back({l,r});
}
}
sort(seg.begin(),seg.end());
int ans=0;
int rpl=seg[0].second;
int lpl=seg[0].first;
for(int i=1;i<seg.size();i++){
if(seg[i].first<=rpl+1){
rpl=max(rpl,seg[i].second);
continue;
}else{
ans+=rpl-lpl+1;
lpl=seg[i].first;rpl=seg[i].second;
}
}
ans+=rpl-lpl+1;
cout<<ans<<endl;
}
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... |