//this is actually 1
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
struct AcAutomaton{
vector<pll> segs;
int n; ll a, b;
void read_in(){
cin >> n >> a >> b;
REP(i, n){
pll s; cin >> s;
segs.pb(s);
}
}
vector<pll> normalize(pll segment, bool moduling, ll mod){
if(!moduling) return {segment};
vector<pll> ans;
ll cnt = segment.ff / mod;
if(segment.ff / mod == segment.ss / mod) {
return {mp(segment.ff%mod, segment.ss%mod)};
}
else if(segment.ff / mod + 1 == segment.ss / mod){
return {mp(segment.ff % mod, mod-1), mp(0, segment.ss % mod)};
}
else return {mp(0, mod-1)};
}
void solve(){
vector<pll> n_segs;
ll mod;
bool moduling = false;
if((ld)a < (ld)2*INFF / (ld)b){
moduling = true;
mod = a * b;
}
REP(i, segs.size()){
vector<pll> tmp = normalize(segs[i], moduling, mod);
for(auto x : tmp) n_segs.pb(x);
}
pll seg = mp(-1ll, -1ll);
sort(all(n_segs));
ll ans = 0;
for(auto x : n_segs){
if(seg == mp(-1ll, -1ll)) seg = x;
else{
if(x.ff > seg.ss){
ans += (seg.ss - seg.ff + 1);
seg = x;
}
else{
ckmax(seg.ss, x.ss);
}
}
}
if(seg != mp(-1ll, -1ll)) ans += (seg.ss - seg.ff + 1);
cout << ans << endl;
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int tcase = 1;
while(tcase--){
AcAutomaton solver;
solver.read_in();
solver.solve();
}
return 0;
}
Compilation message
strange_device.cpp: In member function 'std::vector<std::pair<long long int, long long int> > AcAutomaton::normalize(pll, bool, ll)':
strange_device.cpp:96:12: warning: unused variable 'cnt' [-Wunused-variable]
96 | ll cnt = segment.ff / mod;
| ^~~
strange_device.cpp: In member function 'void AcAutomaton::solve()':
strange_device.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
strange_device.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
strange_device.cpp:113:9: note: in expansion of macro 'REP'
113 | REP(i, segs.size()){
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
896 KB |
Output is correct |
| 3 |
Correct |
6 ms |
896 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
394 ms |
40640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
507 ms |
40580 KB |
Output is correct |
| 3 |
Incorrect |
513 ms |
40640 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
507 ms |
40580 KB |
Output is correct |
| 3 |
Incorrect |
513 ms |
40640 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
507 ms |
40580 KB |
Output is correct |
| 3 |
Incorrect |
513 ms |
40640 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
53 ms |
4972 KB |
Output is correct |
| 3 |
Correct |
54 ms |
4968 KB |
Output is correct |
| 4 |
Correct |
596 ms |
40768 KB |
Output is correct |
| 5 |
Correct |
53 ms |
4972 KB |
Output is correct |
| 6 |
Correct |
52 ms |
4972 KB |
Output is correct |
| 7 |
Correct |
51 ms |
4968 KB |
Output is correct |
| 8 |
Correct |
55 ms |
4972 KB |
Output is correct |
| 9 |
Correct |
52 ms |
4972 KB |
Output is correct |
| 10 |
Correct |
54 ms |
4968 KB |
Output is correct |
| 11 |
Correct |
54 ms |
4976 KB |
Output is correct |
| 12 |
Correct |
49 ms |
5108 KB |
Output is correct |
| 13 |
Correct |
52 ms |
4972 KB |
Output is correct |
| 14 |
Correct |
549 ms |
40644 KB |
Output is correct |
| 15 |
Incorrect |
55 ms |
4972 KB |
Output isn't correct |
| 16 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
896 KB |
Output is correct |
| 3 |
Correct |
6 ms |
896 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
