#include <bits/stdc++.h>
#define ft first
#define sd second
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define pll pair<ll, ll>
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long ll;
vector<pll> vc;
vector<pll> seg;
int n;
ll A, B;
int main(){
#ifdef _LOCAL
freopen("in.txt","r",stdin);
#else
ios_base::sync_with_stdio(0); cin.tie(0);
#endif // _LOCAL
cin >> n >> A >> B;
if (B <= ll(1e6)){
ll fi = A;
while (fi <= ll(1e18) && (fi + fi / B) % A != 0 || fi % B != 0)
fi += A;
seg.clear();
for (int i = 0; i < n; i++){
ll l, r; cin >> l >> r;
if (r - l + 1 >= fi){
seg.PB(MP(0, fi - 1));
continue;
}
ll vl = ((l - 1) / fi) * fi + fi;
if (vl > r){
vl -= fi;
seg.PB(MP(l - vl, r - vl));
} else {
vl -= fi;
seg.PB(MP(l - vl, fi - 1));
vl += fi;
seg.PB(MP(0ll, r - vl));
}
}
sort(all(seg));
ll lst = -1, ans = 0;
for (pll cr : seg)
if (cr.ft > lst){
ans += cr.sd - cr.ft + 1ll;
lst = cr.sd;
} else {
ans += max(lst, cr.sd) - lst;
lst = max(lst, cr.sd);
}
cout << ans << '\n';
return 0;
}
for (int i = 0; i < n; i++){
ll l, r; cin >> l >> r;
for (ll t = l; t <= r; t++)
vc.PB(MP((t + t / B) % A, t % B));
}
sort(all(vc));
vc.resize(unique(all(vc)) - vc.begin());
cout << sz(vc);
return 0;
}
Compilation message
strange_device.cpp: In function 'int main()':
strange_device.cpp:30:31: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
while (fi <= ll(1e18) && (fi + fi / B) % A != 0 || fi % B != 0)
~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
9 ms |
896 KB |
Output is correct |
| 3 |
Correct |
10 ms |
896 KB |
Output is correct |
| 4 |
Incorrect |
5 ms |
512 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Runtime error |
602 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
426 ms |
33276 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
509 ms |
16856 KB |
Output is correct |
| 3 |
Incorrect |
535 ms |
53312 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
509 ms |
16856 KB |
Output is correct |
| 3 |
Incorrect |
535 ms |
53312 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
509 ms |
16856 KB |
Output is correct |
| 3 |
Incorrect |
535 ms |
53312 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
57 ms |
2552 KB |
Output is correct |
| 3 |
Runtime error |
791 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
9 ms |
896 KB |
Output is correct |
| 3 |
Correct |
10 ms |
896 KB |
Output is correct |
| 4 |
Incorrect |
5 ms |
512 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
