제출 #932774

#제출 시각아이디문제언어결과실행 시간메모리
93277412345678Strange Device (APIO19_strange_device)C++17
10 / 100
727 ms116076 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int nx=1e6+5; ll n, a, b, l[nx], r[nx], sm, p, mx, res; set<pair<ll, ll>> s; void add_range(ll x, ll y) { x=x%p; y=y%p; if (y<x) y+=p; s.insert({x, min(p-1, y)}); if (y>=p) s.insert({0, y-p}); } int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>a>>b; p=a*b; for (int i=1; i<=n; i++) cin>>l[i]>>r[i], mx=max(mx, r[i]-l[i]+1), sm+=(r[i]-l[i]+1); if (a>=(LLONG_MAX-1)/b+1) return cout<<sm, 0; if (mx>=p) return cout<<p, 0; for (int i=1; i<=n; i++) add_range(l[i], r[i]); //for (auto [x, y]:s) cout<<"val "<<x<<' '<<y<<'\n'; for (auto itr=s.begin(); itr!=s.end()&&next(itr)!=s.end();) { auto itr2=next(itr); pair<ll, ll> nw; if (itr2->first>itr->second+1) itr=itr2; else nw={itr->first, max(itr->second, itr2->second)}, s.erase(itr), s.erase(itr2), s.insert(nw), itr=s.find(nw); } for (auto [x, y]:s) res+=y-x+1; cout<<res; }
#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...