Submission #266429

#TimeUsernameProblemLanguageResultExecution timeMemory
266429defineStrange Device (APIO19_strange_device)C++17
10 / 100
3365 ms65084 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define rep(i,n) for(int i=0;i<n;i++) #define REP(i,n) for(int i=1;i<n;i++) #define rev(i,n) for(int i=n-1;i>=0;i--) #define all(v) v.begin(),v.end() #define P pair<int,int> #define len(s) (int)s.size() template<class T> inline bool chmin(T &a, T b){ if(a>b){a=b;return true;} return false; } template<class T> inline bool chmax(T &a, T b){ if(a<b){a=b;return true;} return false; } constexpr int mod = 1e9+7; constexpr long long inf = 3e18; int gcd(int x,int y){ return (y?gcd(y,x%y):x); } int A,B,N; void solve1(){ int ans=0; while(N--){ int a,b;cin>>a>>b; ans+=b-a+1; } cout<<ans<<endl; exit(0); } signed main(){ cin>>N>>A>>B; int x=(A%B+1)%A; int g=gcd(A,x); if(inf/(A/g)<B)solve1(); int lc=A/g*B; set<P>st; rep(i,N){ int a,b;cin>>a>>b; if(b-a+1>=lc){ cout<<lc<<endl;return 0; } if(a/lc!=b/lc){ st.insert({a%lc,lc-1}); st.insert({0,b%lc}); }else { st.insert({a%lc,b%lc}); } } int ans=0,now=-1; for(P i:st){ if(i.first<=now){ ans+=max(0ll,i.second-now); chmax(now,i.second); }else { ans+=i.second-i.first+1; now=i.second; } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...