题目大意
给定一个
n∗m
的网格图,给定
p
对起点和终点,求不经过
Data Constraint
题解
一个结论:设矩阵
A[i][j]
表示第
i
个起点到第
至于这个方案我们就可以设
f[i][j]
表示第
i
个关键点到第
矩阵行列式用高斯消元来算:每次找主元交换两行时,就给最后的答案乘-1,最后在乘上消完之后的矩阵的对角线。
时间复杂度: O(p3)
SRC
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std ;
#define N 15 + 10
#define M 200 + 10
#define K 200000 + 10
typedef long long ll ;
const int MO = 998244353 ;
struct Note {
int x , y , type ;
Note ( int X = 0 , int Y = 0 , int T = 0 ) { x = X , y = Y , type = T ; }
} P[3*M] ;
int fac[K] , _fac[K] ;
int f[3*M][3*M] , h[3*M] ;
int A[M] , B[M] , C[M][M] ;
int n , m , p , q ;
int ans , Cnt ;
bool cmp( Note a , Note b ) { return a.x < b.x || ( a.x == b.x && a.y < b.y ) ; }
int Power( int x , int k ) {
int s = 1 ;
while ( k ) {
if ( k & 1 ) s = (ll)s * x % MO ;
x = (ll)x * x % MO ;
k /= 2 ;
}
return s ;
}
int Calc( int n , int m ) { return (ll)fac[n] * _fac[m] % MO * _fac[n-m] % MO ; }
int Get( Note a , Note b ) {
return Calc( b.x - a.x + b.y - a.y , b.x - a.x ) ;
}
void Pre() {
fac[0] = _fac[0] = 1 ;
for (int i = 1 ; i < K ; i ++ ) {
fac[i] = (ll)fac[i-1] * i % MO ;
_fac[i] = Power( fac[i] , MO - 2 ) ;
}
}
void Gauss( int n ) {
int t = 1 ;
for (int i = 1 ; i <= n ; i ++ ) {
if ( !C[i][i] ) {
for (int j = i + 1 ; j <= n ; j ++ ) {
if ( C[j][i] ) swap( C[j] , C[i] ) ;
}
t *= -1 ;
if ( !C[i][i] ) { ans = 0 ; return ; }
}
int ni = Power( C[i][i] , MO - 2 ) ;
for (int j = 1 ; j <= n ; j ++ ) {
if ( C[j][i] == 0 || i == j ) continue ;
int d = (ll)C[j][i] * ni % MO ;
for (int k = 1 ; k <= n ; k ++ ) C[j][k] = ((C[j][k] - (ll)C[i][k] * d % MO) % MO + MO) % MO ;
}
}
ans = 1 ;
for (int i = 1 ; i <= n ; i ++ ) ans = (ll)ans * C[i][i] % MO ;
ans *= t ;
}
int main() {
Pre() ;
scanf( "%d%d%d%d" , &n , &m , &p , &q ) ;
for (int i = 1 ; i <= p ; i ++ ) {
scanf( "%d" , &A[i] ) ;
P[++Cnt] = Note( 0 , A[i] , 1 ) ;
}
for (int i = 1 ; i <= p ; i ++ ) {
scanf( "%d" , &B[i] ) ;
P[++Cnt] = Note( n , B[i] , 2 ) ;
}
for (int i = 1 ; i <= q ; i ++ ) {
int x , y ;
scanf( "%d%d" , &x , &y ) ;
P[++Cnt] = Note( x , y , 3 ) ;
}
sort( P + 1 , P + Cnt + 1 , cmp ) ;
for (int i = 1 ; i <= Cnt ; i ++ ) {
if ( P[i].type != 1 ) continue ;
for (int j = i + 1 ; j <= Cnt ; j ++ ) {
if ( P[j].y < P[i].y ) continue ;
f[i][j] = Get( P[i] , P[j] ) ;
for (int k = i + 1 ; k < j ; k ++ ) {
if ( P[k].y > P[j].y || P[k].y < P[i].y ) continue ;
f[i][j] = ((f[i][j] - ((ll)f[i][k] * Get( P[k] , P[j] )) % MO) % MO + MO) % MO ;
}
}
}
int tot1 = 0 , tot2 = 0 ;
for (int i = 1 ; i <= Cnt ; i ++ ) {
if ( P[i].type == 1 ) h[i] = ++ tot1 ;
if ( P[i].type == 2 ) h[i] = ++ tot2 ;
}
for (int i = 1 ; i <= Cnt ; i ++ ) {
if ( P[i].type != 1 ) continue ;
for (int j = i + 1 ; j <= Cnt ; j ++ ) {
if ( P[j].type != 2 ) continue ;
C[h[i]][h[j]] = f[i][j] ;
}
}
Gauss( p ) ;
printf( "%d\n" , ans ) ;
return 0 ;
}
以上.