結果

問題 No.907 Continuous Kadomatu
ユーザー maroon_kurimaroon_kuri
提出日時 2019-10-11 22:22:56
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 416 ms / 2,000 ms
コード長 6,406 bytes
コンパイル時間 2,046 ms
コンパイル使用メモリ 185,392 KB
実行使用メモリ 28,376 KB
最終ジャッジ日時 2024-11-25 08:06:50
合計ジャッジ時間 4,826 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
28,096 KB
testcase_01 AC 29 ms
28,100 KB
testcase_02 AC 29 ms
28,096 KB
testcase_03 AC 29 ms
28,104 KB
testcase_04 AC 29 ms
28,096 KB
testcase_05 AC 38 ms
28,100 KB
testcase_06 AC 31 ms
28,100 KB
testcase_07 AC 33 ms
28,100 KB
testcase_08 AC 37 ms
28,228 KB
testcase_09 AC 36 ms
28,100 KB
testcase_10 AC 40 ms
28,100 KB
testcase_11 AC 42 ms
28,228 KB
testcase_12 AC 48 ms
28,228 KB
testcase_13 AC 47 ms
28,224 KB
testcase_14 AC 50 ms
28,100 KB
testcase_15 AC 48 ms
28,228 KB
testcase_16 AC 49 ms
28,100 KB
testcase_17 AC 50 ms
28,100 KB
testcase_18 AC 49 ms
28,100 KB
testcase_19 AC 50 ms
28,096 KB
testcase_20 AC 51 ms
28,100 KB
testcase_21 AC 51 ms
28,100 KB
testcase_22 AC 29 ms
27,976 KB
testcase_23 AC 52 ms
28,100 KB
testcase_24 AC 416 ms
28,376 KB
testcase_25 AC 30 ms
28,100 KB
testcase_26 AC 29 ms
28,104 KB
testcase_27 AC 29 ms
27,968 KB
testcase_28 AC 29 ms
28,100 KB
testcase_29 AC 29 ms
28,104 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))

using uint=unsigned;
using ull=unsigned long long;

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

void print(ll x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
int mask(int i){
	return (int(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
    static random_device rd;
    static mt19937_64 gen(rd());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}

using uint=unsigned;
using ull=unsigned long long;

//const uint mod=998244353;
const uint mod=1000000007;
//uint mod=1;
struct mint{
	uint v;
	mint(ll vv=0){s(vv%mod+mod);}
	mint& s(uint vv){
		v=vv<mod?vv:vv-mod;
		return *this;
	}
	mint operator-()const{return mint()-*this;}
	mint& operator+=(const mint&rhs){return s(v+rhs.v);}
	mint&operator-=(const mint&rhs){return s(v+mod-rhs.v);}
	mint&operator*=(const mint&rhs){
		v=ull(v)*rhs.v%mod;
		return *this;
	}
	mint&operator/=(const mint&rhs){return *this*=rhs.inv();}
	mint operator+(const mint&rhs)const{return mint(*this)+=rhs;}
	mint operator-(const mint&rhs)const{return mint(*this)-=rhs;}
	mint operator*(const mint&rhs)const{return mint(*this)*=rhs;}
	mint operator/(const mint&rhs)const{return mint(*this)/=rhs;}
	mint pow(int n)const{
		mint res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	mint inv()const{return pow(mod-2);}
	/*mint inv()const{
		int x,y;
		int g=extgcd(v,mod,x,y);
		assert(g==1);
		if(x<0)x+=mod;
		return mint(x);
	}*/
	friend ostream& operator<<(ostream&os,const mint&m){
		return os<<m.v;
	}
	bool operator<(const mint&r)const{return v<r.v;}
	bool operator==(const mint&r)const{return v==r.v;}
};

const int vmax=(1<<21)+10;
mint fact[vmax],finv[vmax],invs[vmax];
void initfact(){
	fact[0]=1;
	rng(i,1,vmax){
		fact[i]=fact[i-1]*i;
	}
	finv[vmax-1]=fact[vmax-1].inv();
	for(int i=vmax-2;i>=0;i--){
		finv[i]=finv[i+1]*(i+1);
	}
	for(int i=vmax-1;i>=1;i--){
		invs[i]=finv[i]*fact[i-1];
	}
}
mint choose(int n,int k){
	return fact[n]*finv[n-k]*finv[k];
}
mint binom(int a,int b){
	return fact[a+b]*finv[a]*finv[b];
}
mint catalan(int n){
	return binom(n,n)-(n-1>=0?binom(n-1,n+1):0);
}

const int S=210;
using P=array<mint,S>;

P add(const P&a,const P&b){
	P res;
	rep(i,S)
		res[i]=a[i]+b[i];
	return res;
}

P inte(const P&a){
	P res;
	rep(i,S-1)
		res[i+1]=invs[i+1]*a[i];
	return res;
}

P neg(const P&a){
	P res;
	rep(i,S)
		res[i]=-a[i];
	return res;
}

void cut(vi&pos,vc<P>&v,int z){
	pos.pb(inf);
	v.eb();
	int i=lower_bound(all(pos),z)-pos.bg;
	v.resize(i);
	pos[i]=z;
	pos.resize(i+1);
}

mint eval(const P&a,mint x){
	mint res=0,w=1;
	rep(i,S){
		res+=a[i]*w;
		w*=x;
	}
	return res;
}

P rev(const P&a,const vc<P>&buf){
	P res;
	rep(i,S)if(a[i].v){
		rep(j,i+1)
			res[j]+=a[i]*buf[i][j];
	}
	return res;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	initfact();
	
	int n;cin>>n;
	vi a(n),b(n);
	rep(i,n)cin>>a[i]>>b[i];
	vi c(n);
	rep(i,n)c[i]=b[i]-a[i];
	vi d(n-1);
	rep(i,n-1)
		if(i%2==0)
			d[i]=b[i+1]-a[i];
		else
			d[i]=b[i]-a[i+1];
	if(*min_element(all(d))<=0){
		cout<<0<<endl;
		return 0;
	}
	
	vi pos{0,c[0]};
	vc<P> v(1);
	v[0][0]=1;
	
	auto ch=[&](){
		mint pre=0;
		rep(j,v.size()){
			v[j]=inte(v[j]);
			v[j][0]+=pre-eval(v[j],pos[j]);
			pre=eval(v[j],pos[j+1]);
		}
		return pre;
	};
	
	rep(k,n-1){
		cut(pos,v,d[k]);
		
		mint tmp=ch();
		dmp(tmp);
		
		vc<P> buf(S);
		buf[0][0]=1;
		rep(i,S-1)rep(j,S-1){
			buf[i+1][j]+=buf[i][j]*d[k];
			buf[i+1][j+1]-=buf[i][j];
		}
		
		for(auto&z:v)
			z=rev(z,buf);
		reverse(all(v));
		for(auto&z:pos)
			z=d[k]-z;
		reverse(all(pos));
		
		cut(pos,v,c[k+1]);
	}
	
	mint ans=ch();
	rep(i,n)
		ans/=c[i];
	cout<<ans<<endl;
}
0