#include <bits/stdc++.h>
#define SPEEDUP ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
#define int long long
using namespace std;
const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int inf = (1e18 + 7);
int l[N], r[N];
main(){
SPEEDUP;
int n, A, B;
cin >> n >> A >> B;
for(int i = 0; i <= 25; i++){
cout << i << " ";
}
cout << endl;
vector<int > vec;
for(int i = 0;i <= 25; i++){
cout << ((i + (i + B - 1) / B)) << " ";
vec.pb(((i + (i + B - 1) / B)));
}
cout << endl;
for(int i = 0;i <= 25; i++){
cout << (i % B) << " ";
}
cout << endl;
for(auto to : vec){
cout << to % A << " ";
}
cout << endl;
for(int i = 1; i <= n; i++){
cin >> l[i] >> r[i];
}
int ans = 0;
int la = -1, ra = -1;
for(int i = 1; i <= n; i++){
if(la == -1){
la = l[i], ra = r[i];
}
else{
la = max(la, l[i]);
ra = max(ra, r[i]);
}
ans += ra - la + 1;
la = ra + 1;
}
int x;
if(0 == (A % (B + 1ll))){
if(inf / B >= (A / (B + 1ll))){
x = B * (A / (B + 1ll));
}
else{
assert("false");
cout << ans << endl;
return 0;
}
}
else{
if(inf / A >= B){
x = A * B;
}
else{
assert("false");
cout << ans << endl;
return 0;
}
}
set<pair<int,int >> st;
for(int i = 1;i <= n; i++){
if(r[i] % x >= l[i] % x){
// cout << i << " ! " << l[i] % x << " " << r[i] % x <<endl;
st.insert({l[i] % x, r[i] % x});
}
else{
// cout << i << " ? " << 0 << " " << r[i] % x << endl;
// cout << i << " ? " << l[i] % x << " " << x - 1 << endl;
st.insert({0, r[i] % x});
st.insert({l[i] % x, x - 1});
}
}
ans = 0;
la = -1, ra = -1;
for(auto to : st){
if(la == -1){
la = to.fr, ra = to.sc;
}
else{
la = max(la, to.fr);
ra = max(ra, to.sc);
}
ans += ra - la + 1;
la = ra + 1;
}
cout << ans;
}
Compilation message
strange_device.cpp:19:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
19 | main(){
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |