제출 #663096

#제출 시각아이디문제언어결과실행 시간메모리
663096Ai7081이상한 기계 (APIO19_strange_device)C++17
65 / 100
509 ms16868 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pii pair<ll, ll> const ll inf = 1e18+1; ll n, a, b, l, r, loop; vector<pii> v; ll gcd(ll c1, ll c2) { if (!(max(c1,c2)%min(c1,c2))) return min(c1, c2); return gcd(min(c1,c2), max(c1,c2)%min(c1,c2)); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> a >> b; a/=gcd(a,b+1); double dloop=(double)a*double(b); loop = (dloop>1e18 ? 1e18+1 : (ll)dloop); while (n--) { cin >> l >> r, l%=loop, r%=loop; if (l>r) v.push_back({0,r}), v.push_back({l,loop-1}); else v.push_back({l,r}); } sort(v.begin(), v.end()); ll out=0, ma=-1; for (auto [x,y]:v) out += (ma<x ? y-x+1 : max((ll)0,y-ma)), ma=max(ma,y); cout << out; return 0; } /* 3 3 3 4 4 7 9 17 18 ans: 4 3 5 10 1 20 50 68 89 98 ans: 31 1 1000000000000000 1000000000000000000 100000 1000000 */
#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...