제출 #934537

#제출 시각아이디문제언어결과실행 시간메모리
934537ByeWorld이상한 기계 (APIO19_strange_device)C++14
35 / 100
1209 ms48760 KiB
#include <bits/stdc++.h> #define fi first #define se second #define pb push_back #define int long long #define lf (id<<1) #define rg ((id<<1)|1) #define md ((l+r)>>1) using namespace std; typedef pair<int,int> pii; typedef pair<pii,int> ipii; const int INF = 1e9+10; const int MAXN = 1e6+10; int n, a, b; int F, K, P; vector <pii> vec; int ans; signed main() { cin >> n >> a >> b; b++; F = __gcd(a, b); K = a/F * b; P = K - a/F; for(int i=1; i<=n; i++){ int l, r; cin >> l >> r; if(r-l+1 >= P){ cout << P << '\n'; exit(0); } l %= P; r %= P; if(l<=r){ vec.pb({l, r}); } else { vec.pb({l, P-1}); vec.pb({0, r}); } } sort(vec.begin(), vec.end()); int las = -1, ans = 0; for(auto in : vec){ if(in.se <= las) continue; ans += in.se - max(in.fi-1, las); las = in.se; } cout << ans << '\n'; }
#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...