codeforces传送门
luogu传送门
线段树优化建图+拓扑排序
zkw线段树优化建图模板
struct zkwSegtree_improve_graph {
/* Author : atzk */
int n , N , rf , r2 , r4 ;
vector < vector < pair < int , int > > > map ;
zkwSegtree_improve_graph ( int n ) {
N = ( 1 << ( __lg ( n + 5 ) + 1 ) ) ;
rf = N >> 1 , r2 = N << 1 , r4 = N << 2 ;
map.resize ( r4 ) ;
build () ;
}
void build () {
for ( int i = 1 ; i < rf ; ++ i ) {
ll fa = i , ls = i << 1 , rs = i << 1 | 1 ;
map [ fa ].emplace_back ( ls , 0 ) ;
map [ fa ].emplace_back ( rs , 0 ) ;
// map [ ls + r2 ].emplace_back ( fa + r2 , 0 ) ;
// map [ rs + r2 ].emplace_back ( fa + r2 , 0 ) ;
}
for ( int i = N ; i < r2 ; ++ i ) {
ll fa = i >> 1 , now = i , son = fa + r2 ;
map [ fa ].emplace_back ( now , 0 ) ;
// map [ now ].emplace_back ( son , 0 ) ;
}
}
void linkto ( ll now , ll l , ll r , ll w ) {
now += N ;
for ( l += N - 1 , r += N + 1 ; l ^ r ^ 1 ; l >>= 1 , r >>= 1 ) {
if ( ~l & 1 ) map [ now ].emplace_back ( l ^ 1 , w ) ;
if ( r & 1 ) map [ now ].emplace_back ( r ^ 1 , w ) ;
}
}
void linkfrom ( ll now , ll l , ll r , ll w ) {
now += N ;
l += N - 1 , r += N + 1 ;
if ( ~l & 1 ) map [ l ^ 1 ].emplace_back ( now , w ) ;
if ( r & 1 ) map [ r ^ 1 ].emplace_back ( now , w ) ;
l >>= 1 ; r >>= 1 ;
for ( ; l ^ r ^ 1 ; l >>= 1 , r >>= 1 ) {
if ( ~l & 1 ) map [ l ^ 1 + r2 ].emplace_back ( now , w ) ;
if ( r & 1 ) map [ r ^ 1 + r2 ].emplace_back ( now , w ) ;
}
}
void linkpoint ( ll from , ll to , ll w ) {
map [ from + N ].emplace_back ( to + N , w ) ;
}
};
Ac code:
# include <bits/stdc++.h>
using namespace std ;
using ll = int64_t ;
using i64 = int64_t ;
namespace predefine {
const long long inf = 0x3f3f3f3f3f3f3f3f ;
using Int = __int128 ;
using pll = pair < ll , ll > ;
# define IOS iostream::sync_with_stdio ( 0 ) ; cin.tie ( 0 ) ;
# define af( i , a , b ) for ( ll i = a ; i <= b ; ++ i )
# define df( i , a , b ) for ( ll i = a ; i >= b ; -- i )
# define Dg( x ) cout << " ------- " << x << " ------- " << '\n'
# define Dged Dg ( "Debug ed" )
# define Dgop Dg ( "Debug op" )
# define pr( x ) cout << #x << " = " << x << '\n'
# define pr1( x ) cout << #x << " = " << x + 1 << '\n'
# define pn putchar ('\n')
# define ps cout << "yes"
# define __fin( a ) freopen ( a , "r" , stdin )
# define __fout( a ) freopen ( a , "w+" , stdout )
# define lowbit( x ) ( x & ( - x ) )
# define endl '\n'
}
using namespace predefine ;
//----- 板子 ---------------------------------------------------------------------------------------------------------
struct zkwSegtree_improve_graph {
/* Author : atzk */
int n , N , rf , r2 , r4 ;
vector < vector < pair < int , int > > > map ;
zkwSegtree_improve_graph ( int n ) {
N = ( 1 << ( __lg ( n + 5 ) + 1 ) ) ;
rf = N >> 1 , r2 = N << 1 , r4 = N << 2 ;
map.resize ( r4 ) ;
build () ;
}
void build () {
for ( int i = 1 ; i < rf ; ++ i ) {
ll fa = i , ls = i << 1 , rs = i << 1 | 1 ;
map [ fa ].emplace_back ( ls , 0 ) ;
map [ fa ].emplace_back ( rs , 0 ) ;
// map [ ls + r2 ].emplace_back ( fa + r2 , 0 ) ;
// map [ rs + r2 ].emplace_back ( fa + r2 , 0 ) ;
}
for ( int i = N ; i < r2 ; ++ i ) {
ll fa = i >> 1 , now = i , son = fa + r2 ;
map [ fa ].emplace_back ( now , 0 ) ;
// map [ now ].emplace_back ( son , 0 ) ;
}
}
void linkto ( ll now , ll l , ll r , ll w ) {
now += N ;
for ( l += N - 1 , r += N + 1 ; l ^ r ^ 1 ; l >>= 1 , r >>= 1 ) {
if ( ~l & 1 ) map [ now ].emplace_back ( l ^ 1 , w ) ;
if ( r & 1 ) map [ now ].emplace_back ( r ^ 1 , w ) ;
}
}
void linkfrom ( ll now , ll l , ll r , ll w ) {
now += N ;
l += N - 1 , r += N + 1 ;
if ( ~l & 1 ) map [ l ^ 1 ].emplace_back ( now , w ) ;
if ( r & 1 ) map [ r ^ 1 ].emplace_back ( now , w ) ;
l >>= 1 ; r >>= 1 ;
for ( ; l ^ r ^ 1 ; l >>= 1 , r >>= 1 ) {
if ( ~l & 1 ) map [ l ^ 1 + r2 ].emplace_back ( now , w ) ;
if ( r & 1 ) map [ r ^ 1 + r2 ].emplace_back ( now , w ) ;
}
}
void linkpoint ( ll from , ll to , ll w ) {
map [ from + N ].emplace_back ( to + N , w ) ;
}
};
/* jiangly 取模类(偷个懒使用,这样就不用取模力)*/
using i64 = long long;
template<class T>
constexpr T power(T a, i64 b) {
T res = 1;
for (; b; b /= 2, a *= a) {
if (b % 2) {
res *= a;
}
}
return res;
}
constexpr i64 mul(i64 a, i64 b, i64 p) {
i64 res = a * b - i64(1.L * a * b / p) * p;
res %= p;
if (res < 0) {
res += p;
}
return res;
}
template<i64 P>
struct MLong {
i64 x;
constexpr MLong() : x{} {}
constexpr MLong(i64 x) : x{norm(x % getMod())} {}
static i64 Mod;
constexpr static i64 getMod() {
if (P > 0) {
return P;
} else {
return Mod;
}
}
constexpr static void setMod(i64 Mod_) {
Mod = Mod_;
}
constexpr i64 norm(i64 x) const {
if (x < 0) {
x += getMod();
}
if (x >= getMod()) {
x -= getMod();
}
return x;
}
constexpr i64 val() const {
return x;
}
explicit constexpr operator i64() const {
return x;
}
constexpr MLong operator-() const {
MLong res;
res.x = norm(getMod() - x);
return res;
}
constexpr MLong inv() const {
assert(x != 0);
return power(*this, getMod() - 2);
}
constexpr MLong &operator*=(MLong rhs) & {
x = mul(x, rhs.x, getMod());
return *this;
}
constexpr MLong &operator+=(MLong rhs) & {
x = norm(x + rhs.x);
return *this;
}
constexpr MLong &operator-=(MLong rhs) & {
x = norm(x - rhs.x);
return *this;
}
constexpr MLong &operator/=(MLong rhs) & {
return *this *= rhs.inv();
}
friend constexpr MLong operator*(MLong lhs, MLong rhs) {
MLong res = lhs;
res *= rhs;
return res;
}
friend constexpr MLong operator+(MLong lhs, MLong rhs) {
MLong res = lhs;
res += rhs;
return res;
}
friend constexpr MLong operator-(MLong lhs, MLong rhs) {
MLong res = lhs;
res -= rhs;
return res;
}
friend constexpr MLong operator/(MLong lhs, MLong rhs) {
MLong res = lhs;
res /= rhs;
return res;
}
friend constexpr std::istream &operator>>(std::istream &is, MLong &a) {
i64 v;
is >> v;
a = MLong(v);
return is;
}
friend constexpr std::ostream &operator<<(std::ostream &os, const MLong &a) {
return os << a.val();
}
friend constexpr bool operator==(MLong lhs, MLong rhs) {
return lhs.val() == rhs.val();
}
friend constexpr bool operator!=(MLong lhs, MLong rhs) {
return lhs.val() != rhs.val();
}
};
template<>
i64 MLong<0LL>::Mod = i64(1E18) + 9;
template<int P>
struct MInt {
int x;
constexpr MInt() : x{} {}
constexpr MInt(i64 x) : x{norm(x % getMod())} {}
static int Mod;
constexpr static int getMod() {
if (P > 0) {
return P;
} else {
return Mod;
}
}
constexpr static void setMod(int Mod_) {
Mod = Mod_;
}
constexpr int norm(int x) const {
if (x < 0) {
x += getMod();
}
if (x >= getMod()) {
x -= getMod();
}
return x;
}
constexpr int val() const {
return x;
}
explicit constexpr operator int() const {
return x;
}
explicit constexpr operator i64() const {
return x;
}
constexpr MInt operator-() const {
MInt res;
res.x = norm(getMod() - x);
return res;
}
constexpr MInt inv() const {
assert(x != 0);
return power(*this, getMod() - 2);
}
constexpr MInt &operator*=(MInt rhs) & {
x = 1LL * x * rhs.x % getMod();
return *this;
}
constexpr MInt &operator+=(MInt rhs) & {
x = norm(x + rhs.x);
return *this;
}
constexpr MInt &operator-=(MInt rhs) & {
x = norm(x - rhs.x);
return *this;
}
constexpr MInt &operator/=(MInt rhs) & {
return *this *= rhs.inv();
}
friend constexpr MInt operator*(MInt lhs, MInt rhs) {
MInt res = lhs;
res *= rhs;
return res;
}
friend constexpr MInt operator+(MInt lhs, MInt rhs) {
MInt res = lhs;
res += rhs;
return res;
}
friend constexpr MInt operator-(MInt lhs, MInt rhs) {
MInt res = lhs;
res -= rhs;
return res;
}
friend constexpr MInt operator/(MInt lhs, MInt rhs) {
MInt res = lhs;
res /= rhs;
return res;
}
friend constexpr std::istream &operator>>(std::istream &is, MInt &a) {
i64 v;
is >> v;
a = MInt(v);
return is;
}
friend constexpr std::ostream &operator<<(std::ostream &os, const MInt &a) {
return os << a.val();
}
friend constexpr bool operator==(MInt lhs, MInt rhs) {
return lhs.val() == rhs.val();
}
friend constexpr bool operator!=(MInt lhs, MInt rhs) {
return lhs.val() != rhs.val();
}
};
template<>
int MInt<0>::Mod = 998244353;
template<int V, int P>
constexpr MInt<P> CInv = MInt<P>(V).inv();
constexpr int P = 1e9 + 7 ;
using Z = MInt<P>;
//----- 板子 ---------------------------------------------------------------------------------------------------------
ll Pow ( ll a , ll b , ll mod ) {
a = a % mod ; ll ans = 1 ;
for ( ; b ; b >>= 1 ) { if ( b & 1 ) ans = ( a * ans ) % mod ; a = ( a * a ) % mod ; }
return ans ; }
inline ll sum1 ( ll _a ) { return ( _a * ( _a + 1 ) ) >> 1 ; }
inline ll sum2 ( ll _b ) { return _b * ( _b + 1 ) * ( 2 * _b + 1 ) / 6 ; }
ll dx [ 4 ] = { -1 , 0 , 1 , 0 } ;
ll dy [ 4 ] = { 0 , 1 , 0 , -1 } ;
// using ll = long long ;!!!
ll cnt = 0 ;
/*
*/
void solve () {
ll n ; cin >> n ;
vector < pll > v ( n ) ;
ll min = inf ;
for ( auto& [ in , out ] : v ) {
cin >> out >> in ;
min = std::min ( min , out ) ;
}
sort ( v.begin () , v.end () ) ;
// Dgop ;
// for ( auto [ l , r ] : v ) {
// cout << l << ' ' << r << endl ;
// } cout << endl ;
// Dged ;
zkwSegtree_improve_graph g ( n ) ;
auto r4 = g.r4 ;
vector < ll > size ( r4 ) ;
for ( int i = 0 ; i < n ; ++ i ) {
size [ i + g.N ] = v [ i ].second - v [ i ].first ;
}
auto next = [ & ] ( ll now ) {
auto it = lower_bound ( v.begin () , v.end () , make_pair ( v [ now ].second , 0ll ) ) ;
if ( it == v.end () ) return -1ll ;
else return ( it - v.begin () ) ;
};
set < ll > is ;
vector < Z > tans ( r4 ) ;
vector < ll > used ( r4 ) ;
vector < ll > sum ( n + 1 ) ;
for ( int i = 0 ; i < n ; ++ i ) {
// Dgop ;
ll l = next ( i ) ;
if ( l == -1 ) {
// pr1 ( i + g.N ) ;
is.emplace ( i + g.N ) ;
continue ;
}
ll r = next ( l ) ;
if ( r == -1 ) r = n - 1 ;
else -- r ;
// pr1 ( i ) ; pr1 ( l ) ; pr1 ( r ) ;
g.linkto ( i , l , r , 0 ) ;
++ sum [ l ] ;
-- sum [ r + 1 ] ;
// if ( v [ i ].first < min )
// tans [ i + g.N ] += 1 ;
// Dged ;
}
// Dgop ;
if ( sum [ 0 ] == 0 ) tans [ 0 + g.N ] = 1 ;
// cout << tans [ 0 + g.N ] << ' ' ;
for ( int i = 1 ; i < n ; ++ i ) {
sum [ i ] += sum [ i - 1 ] ;
if ( sum [ i ] == 0 ) tans [ i + g.N ] = 1 ;
// cout << tans [ i ] << ' ' ;
}
// cout << endl ;
// Dged ;
auto& map = g.map ;
vector < ll > din ( r4 ) ;
for ( int i = 0 ; i < r4 ; ++ i ) {
for ( auto [ u , w ] : map [ i ] ) {
++ din [ u ] ;
}
}
ll ansin = inf ;
Z ans = 0 ;
queue < ll > q ;
for ( int i = 0 ; i < r4 ; ++ i ) {
if ( din [ i ] == 0 ) {
q.emplace ( i ) ;
}
}
while ( !q.empty () ) {
ll now = q.front () ;
q.pop () ;
for ( auto [ here , w ] : map [ now ] ) {
-- din [ here ] ;
if ( din [ here ] == 0 ) {
q.emplace ( here ) ;
}
if ( used [ here ] == used [ now ] + size [ now ] ) {
tans [ here ] += tans [ now ] ;
}
else if ( used [ here ] < used [ now ] + size [ now ] ) {
// ps ;
used [ here ] = used [ now ] + size [ now ] ;
tans [ here ] = tans [ now ] ;
}
}
// pr ( now ) ;
if ( is.count ( now ) ) {
// pr1 ( now ) ;
// pr ( tans [ now ] ) ;
if ( ansin == v [ now - g.N ].first - used [ now ] ) {
ans += tans [ now ] ;
}
else if ( ansin > v [ now - g.N ].first - used [ now ] ) {
ansin = v [ now - g.N ].first - used [ now ] ;
ans = tans [ now ] ;
}
}
}
cout << ans << endl ;
}
/*
*/
int main () {
// IOS ;
// __fin ( "in.in" ) ;
ll _ = 1 ;
// rd ( _ ) ;
// cin >> _ ;
while ( _ -- ) {
solve () ;
}
return 0 ;
}
/*
//----- 数据 ---------------------------------------------------------------------------------------------------------
----------
*/