제출 #781599

#제출 시각아이디문제언어결과실행 시간메모리
781599makanhuliaStrange Device (APIO19_strange_device)C++17
0 / 100
470 ms16992 KiB
#include<bits/stdc++.h> using namespace std; #define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define int long long #define pii pair<int, int> #define fi first #define se second #define pb push_back int n, a, b; bool comp(pii a, pii b) { return (a.fi < b.fi || (a.fi == b.fi && a.se < b.se)); } signed main() { ioss; cin >> n >> a >> b; int tmp = a*b; vector<pii> idx; for(int i = 0; i < n; i++) { int l, r; cin >> l >> r; l %= tmp, r %= tmp; if(r < l) r += tmp; idx.pb({l, r}); } sort(idx.begin(), idx.end(), comp); int ans = 0; for(int i = 0; i < n; i++) { auto [l, r] = idx[i]; if(i == 0) ans += (r-l)+1; else { auto [x, y] = idx[i-1]; if(x <= l && y >= l) l = y+1; else if(x <= r && y >= r) r = x-1; else if(x <= l && y >= r) continue; ans += (r-l)+1; } } 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...